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 1.6M
-rw-r--r-- 1 mcc users 3.5K 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.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18: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
-rwxr-xr-x 1 mcc users 1.4M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is HexagonalGrid-PT-516, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732257500273
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527921321678

info: Time: 3600 - MCC
===========================================================================================
prep: translating HexagonalGrid-PT-516 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating HexagonalGrid-PT-516 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ HexagonalGrid-PT-516 @ 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: 3517/65536 symbol table entries, 889 collisions
lola: preprocessing...
lola: Size of bit vector: 40544
lola: finding significant places
lola: 1267 places, 2250 transitions, 785 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2731 transition conflict sets
lola: TASK
lola: reading formula from HexagonalGrid-PT-516-LTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= po1_9_1)
lola: LP says that atomic proposition is always false: (2 <= pi3_3_6)
lola: LP says that atomic proposition is always false: (2 <= po3_8_1)
lola: LP says that atomic proposition is always false: (2 <= pil2_3_7)
lola: LP says that atomic proposition is always false: (3 <= pi3_4_4)
lola: A ((pol1_7_5 <= pbl_9_2)) : A (F (G (X (FALSE)))) : A (FALSE) : A (X (G (F (X ((3 <= pb5_9_2)))))) : A (F ((X ((po1_4_4 <= pb6_9_3)) U (pb2_2_2 <= pb6_2_6)))) : A (F ((F ((2 <= pb4_2_4)) U G ((3 <= pb5_1_4))))) : A (X (X (X (G ((pb2_6_3 <= pol1_8_2)))))) : A (G (F (G (G ((po2_5_8 <= po1_2_1)))))) : A (X (F ((FALSE U (pol1_6_6 <= po1_6_7))))) : A ((pi6_1_2 <= pb5_4_8)) : A (G (F ((2 <= pb5_4_1)))) : A (G (((pb4_4_4 <= pi3_4_2) U F ((3 <= pb1_6_7))))) : A (X ((3 <= pbl_5_4))) : A ((X (X (FALSE)) U ((1 <= pb4_3_3) U FALSE))) : A ((F (X ((3 <= pb5_2_5))) U G (G ((1 <= pol1_7_3))))) : A (X (F (G ((pil3_7_5 <= pi5_5_1)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (pol1_7_5 <= pbl_9_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pol1_7_5 <= pbl_9_2)
lola: processed formula length: 21
lola: 30 rewrites
lola: closed formula file HexagonalGrid-PT-516-LTLCardinality.task
lola: processed formula with 1 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

FORMULA HexagonalGrid-PT-516-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file HexagonalGrid-PT-516-LTLCardinality.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

FORMULA HexagonalGrid-PT-516-LTLCardinality-1 FALSE 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file HexagonalGrid-PT-516-LTLCardinality.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 HexagonalGrid-PT-516-LTLCardinality-2 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: (pi6_1_2 <= pb5_4_8)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pi6_1_2 <= pb5_4_8)
lola: processed formula length: 20
lola: 30 rewrites
lola: closed formula file HexagonalGrid-PT-516-LTLCardinality.task
lola: processed formula with 1 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

FORMULA HexagonalGrid-PT-516-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 30 rewrites
lola: closed formula file HexagonalGrid-PT-516-LTLCardinality.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 HexagonalGrid-PT-516-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((pb2_6_3 <= pol1_8_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((pb2_6_3 <= pol1_8_2))))))
lola: processed formula length: 41
lola: 30 rewrites
lola: closed formula file HexagonalGrid-PT-516-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23118 markings, 53642 edges
lola: ========================================

FORMULA HexagonalGrid-PT-516-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= pbl_5_4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((3 <= pbl_5_4)))
lola: processed formula length: 22
lola: 30 rewrites
lola: closed formula file HexagonalGrid-PT-516-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 367 markings, 366 edges
lola: ========================================

FORMULA HexagonalGrid-PT-516-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((pol1_6_6 <= po1_6_7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((pol1_6_6 <= po1_6_7))))
lola: processed formula length: 33
lola: 30 rewrites
lola: closed formula file HexagonalGrid-PT-516-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6448 markings, 6448 edges
lola: ========================================

FORMULA HexagonalGrid-PT-516-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((3 <= pb5_2_5))) U G ((1 <= pol1_7_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((3 <= pb5_2_5))) U G ((1 <= pol1_7_3))))
lola: processed formula length: 50
lola: 30 rewrites
lola: closed formula file HexagonalGrid-PT-516-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6186 markings, 6186 edges
lola: ========================================

FORMULA HexagonalGrid-PT-516-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((pb2_2_2 <= pb6_2_6)))
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: (pb6_2_6 + 1 <= pb2_2_2)
lola: processed formula length: 24
lola: 32 rewrites
lola: closed formula file HexagonalGrid-PT-516-LTLCardinality.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

FORMULA HexagonalGrid-PT-516-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= pb1_6_7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= pb1_6_7))))
lola: processed formula length: 26
lola: 30 rewrites
lola: closed formula file HexagonalGrid-PT-516-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1129 markings, 1128 edges, 226 markings/sec, 0 secs
lola: 2484 markings, 2483 edges, 271 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4829 markings, 4829 edges
lola: ========================================

FORMULA HexagonalGrid-PT-516-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 710 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((3 <= pb5_1_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((3 <= pb5_1_4))))
lola: processed formula length: 26
lola: 30 rewrites
lola: closed formula file HexagonalGrid-PT-516-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1654 markings, 1655 edges

FORMULA HexagonalGrid-PT-516-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 887 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= pb5_9_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= pb5_9_2))))
lola: processed formula length: 26
lola: 30 rewrites
lola: closed formula file HexagonalGrid-PT-516-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1443 markings, 1442 edges, 289 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4690 markings, 4690 edges
lola: ========================================

FORMULA HexagonalGrid-PT-516-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= pb5_4_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= pb5_4_1))))
lola: processed formula length: 26
lola: 30 rewrites
lola: closed formula file HexagonalGrid-PT-516-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 904 markings, 903 edges, 181 markings/sec, 0 secs
lola: 1156 markings, 1155 edges, 50 markings/sec, 5 secs
lola: 1466 markings, 1465 edges, 62 markings/sec, 10 secs
lola: 4198 markings, 4197 edges, 546 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5574 markings, 5574 edges
lola: ========================================

FORMULA HexagonalGrid-PT-516-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1759 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((po2_5_8 <= po1_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((po2_5_8 <= po1_2_1))))
lola: processed formula length: 32
lola: 30 rewrites
lola: closed formula file HexagonalGrid-PT-516-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 860
lola: add low 218
lola: add low 1558
lola: add low 217
lola: add low 1557
lola: add low 215
lola: add low 1556
lola: add low 1083
lola: add low 66
lola: add low 1972
lola: add low 1156
lola: add low 784
lola: add low 257
lola: add low 815
lola: add low 129
lola: add low 1788
lola: add low 1130
lola: add low 1287
lola: add low 237
lola: add low 107
lola: add low 1275
lola: add low 1433
lola: add low 366
lola: add low 1109
lola: add low 2192
lola: add low 1244
lola: add low 365
lola: add low 227
lola: add low 1416
lola: add low 74
lola: add low 1415
lola: add low 72
lola: add low 1414
lola: add low 1015
lola: add low 1653
lola: add low 1152
lola: add low 1655
lola: add low 1153
lola: add low 1043
lola: add low 501
lola: add low 117
lola: add low 1302
lola: add low 293
lola: add low 2104
lola: add low 1770
lola: add low 1451
lola: add low 1080
lola: add low 529
lola: add low 1115
lola: add low 388
lola: add low 335
lola: add low 1989
lola: add low 1034
lola: add low 648
lola: add low 1979
lola: add low 798
lola: add low 1543
lola: add low 309
lola: add low 176
lola: add low 1687
lola: add low 1223
lola: add low 187
lola: add low 1288
lola: add low 386
lola: add low 961
lola: add low 255
lola: add low 203
lola: add low 1870
lola: add low 27
lola: add low 1988
lola: add low 1032
lola: add low 647
lola: add low 1404
lola: add low 188
lola: add low 1537
lola: add low 646
lola: add low 494
lola: add low 1686
lola: add low 1221
lola: add low 186
lola: add low 1285
lola: add low 385
lola: add low 323
lola: add low 1986
lola: add low 1640
lola: add low 1303
lola: add low 549
lola: add low 65
lola: add low 1393
lola: add low 502
lola: add low 1255
lola: add low 64
lola: add low 1965
lola: add low 1154
lola: add low 1662
lola: add low 1155
lola: add low 408
lola: add low 2193
lola: add low 1851
lola: add low 1005
lola: add low 271
lola: add low 2076
lola: add low 834
lola: add low 3
lola: add low 1657
lola: add low 979
lola: add low 241
lola: add low 1615
lola: add low 1488
lola: add low 1128
lola: add low 372
lola: add low 1743
lola: add low 1628
lola: add low 1274
lola: add low 777
lola: add low 2074
lola: add low 1931
lola: add low 1126
lola: add low 1009
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4498 markings, 5077 edges

FORMULA HexagonalGrid-PT-516-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3516 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((pil3_7_5 <= pi5_5_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((pil3_7_5 <= pi5_5_1))))
lola: processed formula length: 33
lola: 30 rewrites
lola: closed formula file HexagonalGrid-PT-516-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 1243 markings, 1242 edges, 249 markings/sec, 0 secs
lola: 2337 markings, 2336 edges, 219 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23807 markings, 58516 edges

FORMULA HexagonalGrid-PT-516-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no yes no no no no yes no no yes no no no
lola:
preliminary result: yes no no no yes no no no no yes no no yes no no no
lola: ========================================
lola: memory consumption: 21912 KB
lola: time consumption: 66 seconds

BK_STOP 1527921387681

--------------------
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="HexagonalGrid-PT-516"
export BK_EXAMINATION="LTLCardinality"
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/HexagonalGrid-PT-516.tgz
mv HexagonalGrid-PT-516 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 HexagonalGrid-PT-516, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r208-smll-152732257500273"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;