fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r120-csrt-158961292400053
Last Updated
Jun 28, 2020

About the Execution of 2019-Gold for NeighborGrid-PT-d5n4m1t35

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.600 1290064.00 1357945.00 1305.60 TFF?F?FF???????? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r120-csrt-158961292400053.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is NeighborGrid-PT-d5n4m1t35, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r120-csrt-158961292400053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 59M
-rw-r--r-- 1 mcc users 3.8K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 10 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rwxr-xr-x 1 mcc users 59M Apr 27 15:14 model.pnml

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

=== Now, execution of the tool begins

BK_START 1590336669075

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ NeighborGrid-PT-d5n4m1t35 @ 3570 seconds

FORMULA NeighborGrid-PT-d5n4m1t35-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA NeighborGrid-PT-d5n4m1t35-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
Makefile:16: recipe for target 'verify' failed
vrfy: finished
info: timeLeft: 2281
rslt: Output for LTLCardinality @ NeighborGrid-PT-d5n4m1t35
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 197632/268435456 symbol table entries, 5872 collisions
lola: preprocessing...
lola: Size of bit vector: 32768
lola: finding significant places
lola: 1024 places, 196608 transitions, 1023 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: A (G ((() OR X ((p_1_3_1_2_0 <= p_3_0_3_1_1))))) : A ((NOT(G ((p_2_0_2_0_0 <= p_0_0_2_0_3))) AND (((p_2_0_2_0_0 <= p_0_0_2_0_3) OR X ((p_0_1_0_2_2 <= p_3_3_0_1_0))) OR NOT(F (NOT(G ((p_1_3_3_2_3 <= p_0_2_3_0_2)))))))) : A (G ((G (X (((p_2_3_3_2_3 + 1 <= p_1_3_3_0_2) AND ((p_0_1_1_0_1 <= p_0_3_3_3_3) U (2 <= p_0_3_0_3_1))))) AND X (G (F (G ((1 <= p_3_3_0_1_2)))))))) : A ((((2 <= p_0_0_1_2_2) OR F (NOT(G (F (G ((3 <= p_0_2_3_0_0))))))) U (G (F ((p_2_0_3_0_2 <= p_0_2_2_3_3))) U (p_3_0_1_2_0 + 1 <= p_1_3_2_3_0)))) : A (NOT(((1 <= p_1_0_3_0_2) OR F (X (G ((X (F ((1 <= p_1_0_3_0_2))) OR ((2 <= p_1_1_1_2_2) AND G ((p_2_0_3_0_3 <= p_3_2_1_3_3)))))))))) : A (F (G (X (G (X ((3 <= p_1_0_1_0_0))))))) : A ((((0 <= p_1_0_2_0_3) OR F ((1 <= p_3_2_1_2_3))) U NOT((G ((0 <= p_1_0_2_0_3)) OR F ((p_2_1_0_2_0 <= p_0_1_0_1_3)))))) : A (X ((F ((2 <= p_0_3_1_1_0)) OR X ((NOT(F (X ((3 <= p_1_2_0_1_0)))) U NOT(X ((p_1_0_0_2_1 <= p_3_1_0_0_2)))))))) : A (G (((p_3_1_0_3_2 <= 2) AND G ((1 <= p_3_3_2_1_0))))) : A (X (((p_0_0_2_0_2 <= p_0_3_3_3_0) OR ((2 <= p_3_0_0_3_0) AND NOT(X (F ((3 <= p_2_1_2_0_1)))))))) : A (F (((((3 <= p_0_3_1_0_2) AND ((p_3_3_0_2_1 <= p_1_3_0_0_3) OR (3 <= p_0_3_1_0_2))) OR NOT(((p_1_1_0_3_0 <= p_1_1_3_2_1) U (2 <= p_0_3_1_1_3)))) U (3 <= p_0_3_1_0_2)))) : A ((((p_2_2_3_0_2 <= p_0_3_0_0_2) U ((p_2_2_3_0_2 <= p_0_3_0_0_2) AND F ((2 <= p_1_2_2_2_0)))) U NOT(G (((p_2_2_3_0_2 <= p_0_3_0_0_2) OR ((p_2_2_3_0_2 <= p_0_3_0_0_2) U G ((p_2_2_3_0_2 <= p_0_3_0_0_2)))))))) : A (NOT(G (((p_2_0_3_0_2 + 1 <= p_2_2_1_2_0) U X ((X ((3 <= p_0_2_2_1_0)) AND X ((((p_2_2_1_2_0 <= p_2_0_3_0_2) AND (2 <= p_2_1_1_3_3)) U (p_1_2_3_1_1 <= p_2_3_0_2_2))))))))) : A ((G (X (G (F ((p_0_0_0_1_1 <= p_1_0_3_3_0))))) OR X (G ((p_0_3_3_2_3 <= p_2_3_3_2_2))))) : A ((G ((3 <= p_0_1_1_0_0)) AND F ((F (NOT(X (X (X (G ((3 <= p_0_1_2_1_3))))))) U F ((3 <= p_0_1_2_1_3)))))) : A (((((p_3_0_2_0_2 <= p_1_1_1_1_2) AND (p_2_0_1_2_0 <= p_1_3_1_0_1)) AND G (((p_3_0_2_0_2 <= p_1_1_1_1_2) OR (1 <= p_1_3_0_1_2)))) U X (F ((p_1_1_1_1_2 + 1 <= p_3_0_2_0_2)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:522
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 183 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 124 rewrites
lola: closed formula file LTLCardinality.xml
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 1 will run for 195 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: 124 rewrites
lola: closed formula file LTLCardinality.xml
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 2 will run for 209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (G (((p_2_3_3_2_3 + 1 <= p_1_3_3_0_2) AND ((p_0_1_1_0_1 <= p_0_3_3_3_3) U (2 <= p_0_3_0_3_1)))))) AND A (F (G ((1 <= p_3_3_0_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 209 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= p_3_3_0_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= p_3_3_0_1_2))))
lola: processed formula length: 30
lola: 124 rewrites
lola: closed formula file LTLCardinality.xml
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 with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 1275 markings, 1274 edges, 255 markings/sec, 0 secs
lola: 1917 markings, 1916 edges, 128 markings/sec, 5 secs
lola: 2460 markings, 2459 edges, 109 markings/sec, 10 secs
lola: 2956 markings, 2955 edges, 99 markings/sec, 15 secs
lola: 3279 markings, 3278 edges, 65 markings/sec, 20 secs
lola: 3637 markings, 3642 edges, 72 markings/sec, 25 secs
lola: 3996 markings, 4031 edges, 72 markings/sec, 30 secs
lola: 4358 markings, 4423 edges, 72 markings/sec, 35 secs
lola: 4716 markings, 4808 edges, 72 markings/sec, 40 secs
lola: 5101 markings, 5202 edges, 77 markings/sec, 45 secs
lola: 5370 markings, 5471 edges, 54 markings/sec, 50 secs
lola: 5474 markings, 5575 edges, 21 markings/sec, 55 secs
lola: 5521 markings, 5622 edges, 9 markings/sec, 60 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: 5548 markings, 5651 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 3 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p_1_0_3_0_2 <= 0) AND A (G (F ((X (G ((p_1_0_3_0_2 <= 0))) AND ((p_1_1_1_2_2 <= 1) OR F ((p_3_2_1_3_3 + 1 <= p_2_0_3_0_3))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p_1_0_3_0_2 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_1_0_3_0_2 <= 0)
lola: processed formula length: 18
lola: 124 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 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: ========================================
lola: subprocess 4 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((p_0_0_2_0_3 + 1 <= p_2_0_2_0_0))) AND A (((p_2_0_2_0_0 <= p_0_0_2_0_3) OR (X ((p_0_1_0_2_2 <= p_3_3_0_1_0)) OR G ((p_1_3_3_2_3 <= p_0_2_3_0_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 239 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p_0_0_2_0_3 + 1 <= p_2_0_2_0_0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: processed formula: (p_2_0_2_0_0 <= p_0_0_2_0_3)
lola: processed formula length: 28
lola: 126 rewrites
lola: closed formula file LTLCardinality.xml
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: 988 markings, 987 edges, 198 markings/sec, 0 secs
lola: 1414 markings, 1413 edges, 85 markings/sec, 5 secs
lola: 1734 markings, 1733 edges, 64 markings/sec, 10 secs
lola: 1945 markings, 1944 edges, 42 markings/sec, 15 secs
lola: 2014 markings, 2013 edges, 14 markings/sec, 20 secs
lola: 2054 markings, 2053 edges, 8 markings/sec, 25 secs
lola: 2123 markings, 2122 edges, 14 markings/sec, 30 secs
lola: 2179 markings, 2178 edges, 11 markings/sec, 35 secs
lola: 2207 markings, 2206 edges, 6 markings/sec, 40 secs
lola: 2237 markings, 2236 edges, 6 markings/sec, 45 secs
lola: 2264 markings, 2263 edges, 5 markings/sec, 50 secs
lola: 2307 markings, 2306 edges, 9 markings/sec, 55 secs
lola: 2339 markings, 2338 edges, 6 markings/sec, 60 secs
lola: 2371 markings, 2370 edges, 6 markings/sec, 65 secs
lola: 2426 markings, 2425 edges, 11 markings/sec, 70 secs
lola: 2486 markings, 2485 edges, 12 markings/sec, 75 secs
lola: 2546 markings, 2545 edges, 12 markings/sec, 80 secs
lola: 2576 markings, 2575 edges, 6 markings/sec, 85 secs
lola: 2623 markings, 2622 edges, 9 markings/sec, 90 secs
lola: 2679 markings, 2678 edges, 11 markings/sec, 95 secs
lola: 2724 markings, 2723 edges, 9 markings/sec, 100 secs
lola: 2764 markings, 2763 edges, 8 markings/sec, 105 secs
lola: 2807 markings, 2806 edges, 9 markings/sec, 110 secs
lola: 2847 markings, 2846 edges, 8 markings/sec, 115 secs
lola: 2872 markings, 2871 edges, 5 markings/sec, 120 secs
lola: 2906 markings, 2905 edges, 7 markings/sec, 125 secs
lola: 2947 markings, 2946 edges, 8 markings/sec, 130 secs
lola: 2984 markings, 2983 edges, 7 markings/sec, 135 secs
lola: 3038 markings, 3037 edges, 11 markings/sec, 140 secs
lola: 3072 markings, 3071 edges, 7 markings/sec, 145 secs
lola: 3112 markings, 3111 edges, 8 markings/sec, 150 secs
lola: 3152 markings, 3151 edges, 8 markings/sec, 155 secs
lola: 3228 markings, 3227 edges, 15 markings/sec, 160 secs
lola: 3287 markings, 3286 edges, 12 markings/sec, 165 secs
lola: 3328 markings, 3327 edges, 8 markings/sec, 170 secs
lola: 3370 markings, 3369 edges, 8 markings/sec, 175 secs
lola: 3430 markings, 3429 edges, 12 markings/sec, 180 secs
lola: 3529 markings, 3528 edges, 20 markings/sec, 185 secs
lola: 3625 markings, 3624 edges, 19 markings/sec, 190 secs
lola: 3694 markings, 3693 edges, 14 markings/sec, 195 secs
lola: 3763 markings, 3762 edges, 14 markings/sec, 200 secs
lola: 3806 markings, 3805 edges, 9 markings/sec, 205 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3837 markings, 3837 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 241 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((2 <= p_0_3_1_1_0)) OR X (X (((p_3_1_0_0_2 + 1 <= p_1_0_0_2_1) OR (G ((p_1_2_0_1_0 <= 2)) AND F ((p_3_1_0_0_2 + 1 <= p_1_0_0_2_1)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((2 <= p_0_3_1_1_0)) OR X (X (((p_3_1_0_0_2 + 1 <= p_1_0_0_2_1) OR (G ((p_1_2_0_1_0 <= 2)) AND F ((p_3_1_0_0_2 + 1 <= p_1_0_0_2_1)))))))))
lola: processed formula length: 147
lola: 124 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5076 markings, 5075 edges, 1015 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: 6519 markings, 6519 edges
lola: ========================================
lola: subprocess 6 will run for 264 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((p_0_0_2_0_2 <= p_0_3_3_3_0) OR ((2 <= p_3_0_0_3_0) AND X (G ((p_2_1_2_0_1 <= 2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((p_0_0_2_0_2 <= p_0_3_3_3_0) OR ((2 <= p_3_0_0_3_0) AND X (G ((p_2_1_2_0_1 <= 2)))))))
lola: processed formula length: 93
lola: 124 rewrites
lola: closed formula file LTLCardinality.xml
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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 6497 markings, 6514 edges, 1299 markings/sec, 0 secs
lola: 21536 markings, 21836 edges, 3008 markings/sec, 5 secs
lola: 42413 markings, 43309 edges, 4175 markings/sec, 10 secs
lola: 65943 markings, 67786 edges, 4706 markings/sec, 15 secs
lola: 91753 markings, 95537 edges, 5162 markings/sec, 20 secs
lola: 117252 markings, 123108 edges, 5100 markings/sec, 25 secs
lola: 142655 markings, 150578 edges, 5081 markings/sec, 30 secs
lola: 167282 markings, 177207 edges, 4925 markings/sec, 35 secs
lola: 191932 markings, 203888 edges, 4930 markings/sec, 40 secs
lola: 217045 markings, 230445 edges, 5023 markings/sec, 45 secs
lola: 241378 markings, 255853 edges, 4867 markings/sec, 50 secs
lola: 265915 markings, 281236 edges, 4907 markings/sec, 55 secs
lola: 290317 markings, 306811 edges, 4880 markings/sec, 60 secs
lola: 316358 markings, 336030 edges, 5208 markings/sec, 65 secs
lola: 340462 markings, 363069 edges, 4821 markings/sec, 70 secs
lola: 364427 markings, 389974 edges, 4793 markings/sec, 75 secs
lola: 388527 markings, 416999 edges, 4820 markings/sec, 80 secs
lola: 412523 markings, 443938 edges, 4799 markings/sec, 85 secs
lola: 437058 markings, 471466 edges, 4907 markings/sec, 90 secs
lola: 461980 markings, 499424 edges, 4984 markings/sec, 95 secs
lola: 488196 markings, 528838 edges, 5243 markings/sec, 100 secs
lola: 514412 markings, 558252 edges, 5243 markings/sec, 105 secs
lola: 539848 markings, 586802 edges, 5087 markings/sec, 110 secs
lola: 565917 markings, 616035 edges, 5214 markings/sec, 115 secs
lola: 590599 markings, 643745 edges, 4936 markings/sec, 120 secs
lola: 614944 markings, 671048 edges, 4869 markings/sec, 125 secs
lola: 639634 markings, 697622 edges, 4938 markings/sec, 130 secs
lola: 664767 markings, 723978 edges, 5027 markings/sec, 135 secs
lola: 688924 markings, 748967 edges, 4831 markings/sec, 140 secs
lola: 713178 markings, 774058 edges, 4851 markings/sec, 145 secs
lola: 737555 markings, 801228 edges, 4875 markings/sec, 150 secs
lola: 764026 markings, 830935 edges, 5294 markings/sec, 155 secs
lola: 790288 markings, 860396 edges, 5252 markings/sec, 160 secs
lola: 816846 markings, 890194 edges, 5312 markings/sec, 165 secs
lola: 842520 markings, 919017 edges, 5135 markings/sec, 170 secs
lola: 869664 markings, 949458 edges, 5429 markings/sec, 175 secs
lola: 895976 markings, 978993 edges, 5262 markings/sec, 180 secs
lola: 922856 markings, 1009153 edges, 5376 markings/sec, 185 secs
lola: 949980 markings, 1039583 edges, 5425 markings/sec, 190 secs
lola: 977648 markings, 1070629 edges, 5534 markings/sec, 195 secs
lola: 1004839 markings, 1101140 edges, 5438 markings/sec, 200 secs
lola: 1030592 markings, 1130024 edges, 5151 markings/sec, 205 secs
lola: 1055987 markings, 1158183 edges, 5079 markings/sec, 210 secs
lola: 1081520 markings, 1185096 edges, 5107 markings/sec, 215 secs
lola: 1107577 markings, 1212134 edges, 5211 markings/sec, 220 secs
lola: 1132992 markings, 1238425 edges, 5083 markings/sec, 225 secs
lola: 1148653 markings, 1255132 edges, 3132 markings/sec, 230 secs
lola: 1150731 markings, 1257462 edges, 416 markings/sec, 235 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((G (((p_0_2_2_1_0 <= 2) OR (((p_2_0_3_0_2 + 1 <= p_2_2_1_2_0) OR (p_2_1_1_3_3 <= 1)) R (p_2_3_0_2_2 + 1 <= p_1_2_3_1_1)))) OR ((p_2_2_1_2_0 <= p_2_0_3_0_2) AND X (X (((p_0_2_2_1_0 <= 2) OR (((p_2_0_3_0_2 + 1 <= p_2_2_1_2_0) OR (p_2_1_1_3_3 <= 1)) R (p_2_3_0_2_2 + 1 <= p_1_2_3_1_1)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G (((p_0_2_2_1_0 <= 2) OR (((p_2_0_3_0_2 + 1 <= p_2_2_1_2_0) OR (p_2_1_1_3_3 <= 1)) R (p_2_3_0_2_2 + 1 <= p_1_2_3_1_1)))) OR ((p_2_2_1_2_0 <= p_2_0_3_0_2) AND X (X (((p_0_2_2_1_0 <= 2) OR (((p_2_0_3_0_2 + 1 <= p_2_2_1_2_0) OR (p_2_1_1_3_3 <= 1)) R (p_2_3_0_2_2 + 1 <= p_1_2_3_1_1)))))))))
lola: processed formula length: 297
lola: 124 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 28 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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 7144 markings, 7143 edges, 1429 markings/sec, 0 secs
lola: 14164 markings, 14163 edges, 1404 markings/sec, 5 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((p_0_0_0_1_1 <= p_1_0_3_3_0))) OR X (G ((p_0_3_3_2_3 <= p_2_3_3_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((p_0_0_0_1_1 <= p_1_0_3_3_0))) OR X (G ((p_0_3_3_2_3 <= p_2_3_3_2_2)))))
lola: processed formula length: 82
lola: 124 rewrites
lola: closed formula file LTLCardinality.xml
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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 5480 markings, 5479 edges, 1096 markings/sec, 0 secs
lola: 13161 markings, 13172 edges, 1536 markings/sec, 5 secs
lola: 24041 markings, 24057 edges, 2176 markings/sec, 10 secs
lola: 38753 markings, 38819 edges, 2942 markings/sec, 15 secs
lola: 56425 markings, 56639 edges, 3534 markings/sec, 20 secs
lola: 76973 markings, 77344 edges, 4110 markings/sec, 25 secs
lola: 98853 markings, 99418 edges, 4376 markings/sec, 30 secs
lola: 120809 markings, 121568 edges, 4391 markings/sec, 35 secs
lola: 142855 markings, 143825 edges, 4409 markings/sec, 40 secs
lola: 164997 markings, 166162 edges, 4428 markings/sec, 45 secs
lola: 190737 markings, 192184 edges, 5148 markings/sec, 50 secs
lola: 217119 markings, 218849 edges, 5276 markings/sec, 55 secs
lola: 243138 markings, 245148 edges, 5204 markings/sec, 60 secs
lola: 270764 markings, 273334 edges, 5525 markings/sec, 65 secs
lola: 298471 markings, 301634 edges, 5541 markings/sec, 70 secs
lola: 326225 markings, 329984 edges, 5551 markings/sec, 75 secs
lola: 354041 markings, 358394 edges, 5563 markings/sec, 80 secs
lola: 381839 markings, 386790 edges, 5560 markings/sec, 85 secs
lola: 409517 markings, 415060 edges, 5536 markings/sec, 90 secs
lola: 437274 markings, 443409 edges, 5551 markings/sec, 95 secs
lola: 465113 markings, 471846 edges, 5568 markings/sec, 100 secs
lola: 492903 markings, 500230 edges, 5558 markings/sec, 105 secs
Killed
rslt: finished

BK_STOP 1590337959139

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

make: [verify] Error 137 (ignored)

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-d5n4m1t35"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool win2019"
echo " Input is NeighborGrid-PT-d5n4m1t35, 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 r120-csrt-158961292400053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NeighborGrid-PT-d5n4m1t35.tgz
mv NeighborGrid-PT-d5n4m1t35 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;