fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r055-oct2-155234418800293
Last Updated
Apr 15, 2019

About the Execution of 2018-Gold for Dekker-PT-050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.300 447002.00 459460.00 1592.00 FFF?FTFTTTTTFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r055-oct2-155234418800293.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is Dekker-PT-050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r055-oct2-155234418800293
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 3.7K Feb 10 20:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 10 20:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 6 17:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 6 17:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 100 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 338 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 23:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Feb 3 06:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 3 06:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Jan 30 23:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Jan 30 23:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:19 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 1.5M Mar 10 17:31 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 Dekker-PT-050-LTLCardinality-00
FORMULA_NAME Dekker-PT-050-LTLCardinality-01
FORMULA_NAME Dekker-PT-050-LTLCardinality-02
FORMULA_NAME Dekker-PT-050-LTLCardinality-03
FORMULA_NAME Dekker-PT-050-LTLCardinality-04
FORMULA_NAME Dekker-PT-050-LTLCardinality-05
FORMULA_NAME Dekker-PT-050-LTLCardinality-06
FORMULA_NAME Dekker-PT-050-LTLCardinality-07
FORMULA_NAME Dekker-PT-050-LTLCardinality-08
FORMULA_NAME Dekker-PT-050-LTLCardinality-09
FORMULA_NAME Dekker-PT-050-LTLCardinality-10
FORMULA_NAME Dekker-PT-050-LTLCardinality-11
FORMULA_NAME Dekker-PT-050-LTLCardinality-12
FORMULA_NAME Dekker-PT-050-LTLCardinality-13
FORMULA_NAME Dekker-PT-050-LTLCardinality-14
FORMULA_NAME Dekker-PT-050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552709683973

info: Time: 3600 - MCC
===========================================================================================
prep: translating Dekker-PT-050 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Dekker-PT-050 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ Dekker-PT-050 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2850/65536 symbol table entries, 428 collisions
lola: preprocessing...
lola: Size of bit vector: 250
lola: finding significant places
lola: 250 places, 2600 transitions, 100 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5150 transition conflict sets
lola: TASK
lola: reading formula from Dekker-PT-050-LTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p1_42)
lola: LP says that atomic proposition is always false: (2 <= flag_1_49)
lola: LP says that atomic proposition is always false: (2 <= p3_25)
lola: LP says that atomic proposition is always true: (p1_8 <= flag_1_8)
lola: LP says that atomic proposition is always false: (3 <= p0_7)
lola: LP says that atomic proposition is always false: (3 <= p1_20)
lola: LP says that atomic proposition is always false: (2 <= flag_0_18)
lola: LP says that atomic proposition is always false: (2 <= flag_1_48)
lola: A (X (X ((FALSE U (flag_1_17 <= p1_1))))) : A (F (G (G (FALSE)))) : A (F (F (G (X (FALSE))))) : A (X (G (G ((p0_49 <= p3_29))))) : A (F ((F ((p3_33 <= flag_0_29)) U G ((flag_0_42 <= p1_6))))) : A (((TRUE U (flag_0_43 <= p1_9)) U ((p3_32 <= p0_36) U (p3_44 <= flag_0_39)))) : A (F (X (X ((p1_34 <= flag_0_41))))) : A ((p3_45 <= p1_37)) : A (F ((X ((flag_0_40 <= p1_31)) U F ((1 <= p0_9))))) : A ((p1_48 <= p1_30)) : A ((G ((p1_1 <= p3_25)) U (1 <= p0_5))) : A ((p1_6 <= p3_22)) : A (G (FALSE)) : A (G ((X ((flag_0_5 <= p0_46)) U G (FALSE)))) : A (F (FALSE)) : A (G (FALSE))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
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:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
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:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 39 rewrites
lola: closed formula file Dekker-PT-050-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 Dekker-PT-050-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 39 rewrites
lola: closed formula file Dekker-PT-050-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 Dekker-PT-050-LTLCardinality-2 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: (p3_45 <= p1_37)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p3_45 <= p1_37)
lola: processed formula length: 16
lola: 39 rewrites
lola: closed formula file Dekker-PT-050-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 Dekker-PT-050-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p1_48 <= p1_30)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1_48 <= p1_30)
lola: processed formula length: 16
lola: 39 rewrites
lola: closed formula file Dekker-PT-050-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: ========================================
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 Dekker-PT-050-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p1_6 <= p3_22)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1_6 <= p3_22)
lola: processed formula length: 15
lola: 39 rewrites
lola: closed formula file Dekker-PT-050-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 Dekker-PT-050-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 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: 39 rewrites
lola: closed formula file Dekker-PT-050-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 Dekker-PT-050-LTLCardinality-12 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 39 rewrites
lola: closed formula file Dekker-PT-050-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 Dekker-PT-050-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 39 rewrites
lola: closed formula file Dekker-PT-050-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 Dekker-PT-050-LTLCardinality-14 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 39 rewrites
lola: closed formula file Dekker-PT-050-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 Dekker-PT-050-LTLCardinality-15 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 (X (G ((p0_49 <= p3_29))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p0_49 <= p3_29))))
lola: processed formula length: 28
lola: 39 rewrites
lola: closed formula file Dekker-PT-050-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: 108696 markings, 6428301 edges, 21739 markings/sec, 0 secs
lola: 217700 markings, 12777030 edges, 21801 markings/sec, 5 secs
lola: 327737 markings, 19081404 edges, 22007 markings/sec, 10 secs
lola: 436074 markings, 25341898 edges, 21667 markings/sec, 15 secs
lola: 545638 markings, 31593561 edges, 21913 markings/sec, 20 secs
lola: 655609 markings, 37941832 edges, 21994 markings/sec, 25 secs
lola: 762651 markings, 44283592 edges, 21408 markings/sec, 30 secs
lola: 863477 markings, 50627857 edges, 20165 markings/sec, 35 secs
lola: 972138 markings, 56860293 edges, 21732 markings/sec, 40 secs
lola: 1070930 markings, 63129999 edges, 19758 markings/sec, 45 secs
lola: 1170906 markings, 69346559 edges, 19995 markings/sec, 50 secs
lola: 1270667 markings, 75589661 edges, 19952 markings/sec, 55 secs
lola: 1379491 markings, 81668336 edges, 21765 markings/sec, 60 secs
lola: 1478606 markings, 87897906 edges, 19823 markings/sec, 65 secs
lola: 1580847 markings, 94075146 edges, 20448 markings/sec, 70 secs
lola: 1684257 markings, 100193685 edges, 20682 markings/sec, 75 secs
lola: 1781944 markings, 106274613 edges, 19537 markings/sec, 80 secs
lola: 1878605 markings, 112422467 edges, 19332 markings/sec, 85 secs
lola: 1980304 markings, 118474870 edges, 20340 markings/sec, 90 secs
lola: 2079416 markings, 124552769 edges, 19822 markings/sec, 95 secs
lola: 2181211 markings, 130556732 edges, 20359 markings/sec, 100 secs
lola: 2277308 markings, 136543476 edges, 19219 markings/sec, 105 secs
lola: 2376340 markings, 142596664 edges, 19806 markings/sec, 110 secs
lola: 2470651 markings, 148569290 edges, 18862 markings/sec, 115 secs
lola: 2565538 markings, 154477394 edges, 18977 markings/sec, 120 secs
lola: 2668530 markings, 160609842 edges, 20598 markings/sec, 125 secs
lola: 2761523 markings, 166608090 edges, 18599 markings/sec, 130 secs
lola: 2857643 markings, 172596857 edges, 19224 markings/sec, 135 secs
lola: 2959325 markings, 178668990 edges, 20336 markings/sec, 140 secs
lola: 3063274 markings, 184737420 edges, 20790 markings/sec, 145 secs
lola: 3164480 markings, 190892311 edges, 20241 markings/sec, 150 secs
lola: 3263658 markings, 196982904 edges, 19836 markings/sec, 155 secs
lola: 3365083 markings, 203035746 edges, 20285 markings/sec, 160 secs
lola: 3462969 markings, 209057495 edges, 19577 markings/sec, 165 secs
lola: 3560727 markings, 214952099 edges, 19552 markings/sec, 170 secs
lola: 3658253 markings, 220861335 edges, 19505 markings/sec, 175 secs
lola: 3757743 markings, 226745533 edges, 19898 markings/sec, 180 secs
lola: 3859131 markings, 232625839 edges, 20278 markings/sec, 185 secs
lola: 3957145 markings, 238501836 edges, 19603 markings/sec, 190 secs
lola: 4055335 markings, 244435737 edges, 19638 markings/sec, 195 secs
lola: 4151438 markings, 250386914 edges, 19221 markings/sec, 200 secs
lola: 4242662 markings, 256381257 edges, 18245 markings/sec, 205 secs
lola: 4335471 markings, 261904539 edges, 18562 markings/sec, 210 secs
lola: 4338493 markings, 262037036 edges, 604 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((p1_34 <= flag_0_41)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((p1_34 <= flag_0_41)))))
lola: processed formula length: 36
lola: 39 rewrites
lola: closed formula file Dekker-PT-050-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 398 markings, 434 edges
lola: ========================================

FORMULA Dekker-PT-050-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 669 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((flag_1_17 <= p1_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((flag_1_17 <= p1_1))))
lola: processed formula length: 31
lola: 39 rewrites
lola: closed formula file Dekker-PT-050-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: 44 markings, 44 edges
lola: ========================================

FORMULA Dekker-PT-050-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 836 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p0_9)))
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: (p0_9 <= 0)
lola: processed formula length: 11
lola: 41 rewrites
lola: closed formula file Dekker-PT-050-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
lola: ========================================

FORMULA Dekker-PT-050-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1115 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((flag_0_42 <= p1_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((flag_0_42 <= p1_6))))
lola: processed formula length: 31
lola: 39 rewrites
lola: closed formula file Dekker-PT-050-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 2081
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: 13 markings, 21 edges
lola: ========================================

FORMULA Dekker-PT-050-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1672 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p0_5) OR (G ((p1_1 <= p3_25)) AND F ((1 <= p0_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= p0_5) OR (G ((p1_1 <= p3_25)) AND F ((1 <= p0_5)))))
lola: processed formula length: 62
lola: 39 rewrites
lola: closed formula file Dekker-PT-050-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: using ltl preserving stubborn set method (--stubborn)
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: 1 markings, 0 edges
lola: ========================================

FORMULA Dekker-PT-050-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3345 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((flag_0_43 <= p1_9)) U ((p3_32 <= p0_36) U (p3_44 <= flag_0_39))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((flag_0_43 <= p1_9)) U ((p3_32 <= p0_36) U (p3_44 <= flag_0_39))))
lola: processed formula length: 73
lola: 39 rewrites
lola: closed formula file Dekker-PT-050-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: using ltl preserving stubborn set method (--stubborn)
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: 1 markings, 0 edges
lola: ========================================

FORMULA Dekker-PT-050-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (G ((p0_49 <= p3_29))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p0_49 <= p3_29))))
lola: processed formula length: 28
lola: 39 rewrites
lola: closed formula file Dekker-PT-050-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: 107597 markings, 6366418 edges, 21519 markings/sec, 0 secs
lola: 215332 markings, 12628999 edges, 21547 markings/sec, 5 secs
lola: 325133 markings, 18928486 edges, 21960 markings/sec, 10 secs
lola: 434107 markings, 25232139 edges, 21795 markings/sec, 15 secs
lola: 544308 markings, 31514885 edges, 22040 markings/sec, 20 secs
lola: 654435 markings, 37871221 edges, 22025 markings/sec, 25 secs
lola: 762012 markings, 44223983 edges, 21515 markings/sec, 30 secs
lola: 862749 markings, 50590437 edges, 20147 markings/sec, 35 secs
lola: 972121 markings, 56859016 edges, 21874 markings/sec, 40 secs
lola: 1071079 markings, 63146414 edges, 19792 markings/sec, 45 secs
lola: 1171292 markings, 69385664 edges, 20043 markings/sec, 50 secs
lola: 1272226 markings, 75658494 edges, 20187 markings/sec, 55 secs
lola: 1381026 markings, 81759155 edges, 21760 markings/sec, 60 secs
lola: 1480600 markings, 87994084 edges, 19915 markings/sec, 65 secs
lola: 1582867 markings, 94186281 edges, 20453 markings/sec, 70 secs
lola: 1686879 markings, 100336642 edges, 20802 markings/sec, 75 secs
lola: 1786430 markings, 106487289 edges, 19910 markings/sec, 80 secs
lola: 1883355 markings, 112689502 edges, 19385 markings/sec, 85 secs
lola: 1984537 markings, 118808064 edges, 20236 markings/sec, 90 secs
lola: 2087372 markings, 125043274 edges, 20567 markings/sec, 95 secs
lola: 2191036 markings, 131272060 edges, 20733 markings/sec, 100 secs
lola: 2290394 markings, 137419581 edges, 19872 markings/sec, 105 secs
lola: 2392287 markings, 143541725 edges, 20379 markings/sec, 110 secs
lola: 2489127 markings, 149676477 edges, 19368 markings/sec, 115 secs
lola: 2587192 markings, 155780116 edges, 19613 markings/sec, 120 secs
lola: 2691124 markings, 161941196 edges, 20786 markings/sec, 125 secs
lola: 2784403 markings, 168095740 edges, 18656 markings/sec, 130 secs
lola: 2884343 markings, 174188197 edges, 19988 markings/sec, 135 secs
lola: 2986972 markings, 180284645 edges, 20526 markings/sec, 140 secs
lola: 3093032 markings, 186370176 edges, 21212 markings/sec, 145 secs
lola: 3194415 markings, 192560031 edges, 20277 markings/sec, 150 secs
lola: 3292138 markings, 198737084 edges, 19545 markings/sec, 155 secs
lola: 3395286 markings, 204796508 edges, 20630 markings/sec, 160 secs
lola: 3493115 markings, 210871627 edges, 19566 markings/sec, 165 secs
lola: 3594789 markings, 216805119 edges, 20335 markings/sec, 170 secs
lola: 3694376 markings, 222825446 edges, 19917 markings/sec, 175 secs
lola: 3790857 markings, 228775999 edges, 19296 markings/sec, 180 secs
lola: 3891765 markings, 234646640 edges, 20182 markings/sec, 185 secs
lola: 3985994 markings, 240546266 edges, 18846 markings/sec, 190 secs
lola: 4089305 markings, 246377056 edges, 20662 markings/sec, 195 secs
lola: 4177015 markings, 252344640 edges, 17542 markings/sec, 200 secs
lola: 4275475 markings, 258332420 edges, 19692 markings/sec, 205 secs
lola: 4336292 markings, 261940370 edges, 12163 markings/sec, 210 secs
lola: 4340231 markings, 262105455 edges, 788 markings/sec, 215 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA Dekker-PT-050-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no unknown no yes no yes yes yes yes yes no no no no
lola:
preliminary result: no no no unknown no yes no yes yes yes yes yes no no no no
lola: memory consumption: 24288 KB
lola: time consumption: 446 seconds

BK_STOP 1552710130975

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-050"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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-3954"
echo " Executing tool win2018"
echo " Input is Dekker-PT-050, 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 r055-oct2-155234418800293"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-050.tgz
mv Dekker-PT-050 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; 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
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 ;