fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r112-csrt-152666469200207
Last Updated
June 26, 2018

About the Execution of LoLA for NeighborGrid-PT-d2n3m1c12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
214.670 3600000.00 49696.00 349.90 TFFFT?TFTFT?T?TF 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 192K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.6K 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.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.7K 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 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 11K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is NeighborGrid-PT-d2n3m1c12, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469200207
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527021527810

info: Time: 3600 - MCC
===========================================================================================
prep: translating NeighborGrid-PT-d2n3m1c12 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating NeighborGrid-PT-d2n3m1c12 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ NeighborGrid-PT-d2n3m1c12 @ 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: 49/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 40 transitions, 8 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from NeighborGrid-PT-d2n3m1c12-CTLFireability.task
lola: A (G (E (X (FIREABLE(ti_0_2v_1_1))))) : (E ((A (F (FIREABLE(to_1_0v_2_0))) U A (G (FIREABLE(to_0_1v_1_0))))) AND E (X (FIREABLE(ti_1_1v_2_0)))) : (E (G (A ((FIREABLE(ti_2_0v_2_1) U FIREABLE(to_0_1v_1_0))))) AND E ((E (G (FIREABLE(to_0_1v_0_2))) U A (G (FIREABLE(to_0_1v_1_0)))))) : ((E (G (FIREABLE(to_0_0v_1_0))) AND A (G ((FIREABLE(ti_0_2v_1_2) AND FIREABLE(to_0_0v_1_1) AND NOT FIREABLE(to_1_2v_2_1))))) OR E ((FIREABLE(to_2_0v_2_1) U A (G (FIREABLE(to_0_1v_1_2)))))) : A (G (E (X (E (F (FIREABLE(to_1_1v_2_1))))))) : (E (F (A (G ((FIREABLE(ti_0_1v_0_2) AND FIREABLE(to_0_1v_1_2)))))) OR NOT(E (F ((NOT FIREABLE(to_1_1v_2_0) OR (FIREABLE(ti_0_1v_1_1) AND FIREABLE(ti_1_2v_2_1))))))) : NOT(E (F (A (G (FIREABLE(to_0_0v_1_1)))))) : E (F (A (G (A (G (FIREABLE(ti_0_1v_1_1))))))) : ((FIREABLE(to_0_0v_0_1) OR FIREABLE(to_0_2v_1_2) OR FIREABLE(to_1_1v_1_2)) AND (A (G (())) AND NOT(A (X (NOT FIREABLE(to_1_1v_2_2)))))) : A (G (E (X (((FIREABLE(ti_0_2v_1_2)) OR (FIREABLE(ti_1_1v_1_2) AND FIREABLE(ti_0_2v_1_2))))))) : FIREABLE(ti_0_2v_1_1) : (NOT FIREABLE(ti_1_1v_1_2) AND NOT(NOT(NOT(E (G (FIREABLE(ti_1_1v_2_0))))))) : NOT((A (F (E (X (FIREABLE(ti_1_2v_2_1))))) AND A (G (E (G (FIREABLE(to_0_0v_1_0))))))) : NOT((FIREABLE(ti_1_0v_2_0) OR (FIREABLE(ti_1_1v_1_2) AND (E (G (FIREABLE(ti_2_0v_2_1))) OR E (G (FIREABLE(to_0_0v_1_0))))))) : FIREABLE(ti_0_2v_1_1) : E (G (A (F (A (G (FIREABLE(ti_1_2v_2_2)))))))
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:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: 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:116
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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(ti_0_2v_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(ti_0_2v_1_1)
lola: processed formula length: 21
lola: 46 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1c12-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: ========================================

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(ti_0_2v_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(ti_0_2v_1_1)
lola: processed formula length: 21
lola: 46 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1c12-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: ========================================

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-14 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: A (G (E (X (E (F (FIREABLE(to_1_1v_2_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
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(E(TRUE U FIREABLE(to_1_1v_2_1))))))
lola: processed formula length: 55
lola: 49 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1c12-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: 24310 markings, 546841 edges
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-4 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: ((FIREABLE(to_0_0v_0_1) OR FIREABLE(to_0_2v_1_2) OR FIREABLE(to_1_1v_1_2)) AND E (X (FIREABLE(to_1_1v_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(to_0_0v_0_1) OR FIREABLE(to_0_2v_1_2) OR FIREABLE(to_1_1v_1_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(to_0_0v_0_1) OR FIREABLE(to_0_2v_1_2) OR FIREABLE(to_1_1v_1_2))
lola: processed formula length: 75
lola: 46 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1c12-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: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(to_1_1v_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(FIREABLE(to_1_1v_2_2))
lola: processed formula length: 25
lola: 47 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1c12-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-8 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 (G (E (X (((FIREABLE(ti_0_2v_1_2)) OR (FIREABLE(ti_1_1v_1_2) AND FIREABLE(ti_0_2v_1_2)))))))
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(((FIREABLE(ti_0_2v_1_2)) OR (FIREABLE(ti_1_1v_1_2) AND FIREABLE(ti_0_2v_1_2)))))))
lola: processed formula length: 103
lola: 48 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1c12-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: 17 markings, 16 edges
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-9 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 (E (X (FIREABLE(ti_0_2v_1_1)))))
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(FIREABLE(ti_0_2v_1_1)))))
lola: processed formula length: 45
lola: 48 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1c12-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: 24310 markings, 514800 edges
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-0 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 (G (A (X (NOT FIREABLE(ti_1_2v_2_1))))) OR E (F (NOT FIREABLE(to_0_0v_1_0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(to_0_0v_1_0)))
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(to_0_0v_1_0)))
lola: processed formula length: 33
lola: 47 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1c12-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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: formula 0: NOT FIREABLE(to_0_0v_1_0)
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-12 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 ((A (F (FIREABLE(to_1_0v_2_0))) U A (G (FIREABLE(to_0_1v_1_0))))) AND E (X (FIREABLE(ti_1_1v_2_0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: (E(A(TRUE U FIREABLE(to_1_0v_2_0)) U NOT(E(TRUE U NOT FIREABLE(to_0_1v_1_0)))) AND EX(FIREABLE(ti_1_1v_2_0)))
lola: processed formula length: 109
lola: 51 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1c12-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 3 significant temporal operators and needs 13 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: 24255 markings, 362340 edges
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (FIREABLE(ti_0_1v_1_1)))))
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(ti_0_1v_1_1)
lola: processed formula length: 25
lola: 48 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1c12-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: 17875 markings, 257400 edges
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (NOT FIREABLE(to_0_0v_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:617
lola: processed formula: NOT FIREABLE(to_0_0v_1_1)
lola: processed formula length: 25
lola: 47 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1c12-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: yes
lola: produced by: tscc_search
lola: The predicate is live.
lola: 17875 markings, 257400 edges
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-6 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: E (G (A (F (A (G (FIREABLE(ti_1_2v_2_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U NOT(E(TRUE U NOT FIREABLE(ti_1_2v_2_2)))))))
lola: processed formula length: 70
lola: 50 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1c12-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 3 significant temporal operators and needs 13 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: 18 markings, 40 edges

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((E (G (FIREABLE(to_0_0v_1_0))) AND A (G ((FIREABLE(ti_0_2v_1_2) AND FIREABLE(to_0_0v_1_1) AND NOT FIREABLE(to_1_2v_2_1))))) OR E ((FIREABLE(to_2_0v_2_1) U A (G (FIREABLE(to_0_1v_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: ((NOT(A(TRUE U NOT FIREABLE(to_0_0v_1_0))) AND NOT(E(TRUE U (NOT FIREABLE(ti_0_2v_1_2) OR NOT FIREABLE(to_0_0v_1_1) OR FIREABLE(to_1_2v_2_1))))) OR E(FIREABLE(to_2_0v_2_1) U NOT(E(TRUE U NOT FIREABLE(to_0_1v_1_2)))))
lola: processed formula length: 218
lola: 53 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1c12-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: 23604 markings, 312703 edges
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (A ((FIREABLE(ti_2_0v_2_1) U FIREABLE(to_0_1v_1_0))))) AND E ((E (G (FIREABLE(to_0_1v_0_2))) U A (G (FIREABLE(to_0_1v_1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: (NOT(A(TRUE U NOT(A(FIREABLE(ti_2_0v_2_1) U FIREABLE(to_0_1v_1_0))))) AND E(NOT(A(TRUE U NOT FIREABLE(to_0_1v_0_2))) U NOT(E(TRUE U NOT FIREABLE(to_0_1v_1_0)))))
lola: processed formula length: 161
lola: 53 rewrites
lola: closed formula file NeighborGrid-PT-d2n3m1c12-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 5 significant temporal operators and needs 22 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: 24255 markings, 363873 edges
lola: ========================================

FORMULA NeighborGrid-PT-d2n3m1c12-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(ti_1_1v_1_2) AND A (F (NOT FIREABLE(ti_1_1v_2_0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: yes no no no yes unknown yes no yes no yes unknown yes unknown yes no
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 14480 KB
lola: time consumption: 1191 seconds
lola: time limit reached - aborting
lola:
preliminary result: yes no no no yes unknown yes no yes no yes unknown yes unknown yes no
lola:
preliminary result: yes no no no yes unknown yes no yes no yes unknown yes unknown yes no
lola: memory consumption: 14480 KB
lola: time consumption: 3570 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NeighborGrid-PT-d2n3m1c12"
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/NeighborGrid-PT-d2n3m1c12.tgz
mv NeighborGrid-PT-d2n3m1c12 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 NeighborGrid-PT-d2n3m1c12, 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 r112-csrt-152666469200207"
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 '' CTLFireability.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 ;