Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r121-smll-155272326100068.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
Input is PolyORBLF-COL-S06J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-smll-155272326100068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 320K
-rw-r--r-- 1 mcc users 4.0K Feb 12 09:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 12 09:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 8 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 8 09:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.7K Feb 5 00:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K Feb 4 22:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 4 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 4 12:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 1 08:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 1 08:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_pt
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 154K 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 PolyORBLF-COL-S06J04T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S06J04T06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552923495841

info: Time: 3600 - MCC
===========================================================================================
prep: translating PolyORBLF-COL-S06J04T06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PolyORBLF-COL-S06J04T06 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ PolyORBLF-COL-S06J04T06 @ 3567 seconds
lola: LoLA will run for 3567 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 11132/65536 symbol table entries, 3572 collisions
lola: preprocessing...
lola: Size of bit vector: 20224
lola: finding significant places
lola: 632 places, 10500 transitions, 578 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2723 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p67 + p66 + p65 + p64 + p63 + p68)
lola: LP says that atomic proposition is always false: (3 <= p582 + p583 + p584 + p585 + p586 + p587)
lola: A ((3 <= p296 + p297 + p298 + p299 + p300 + p301)) : A ((1 <= p544)) : A ((p318 + p319 + p320 + p321 + p322 + p323 <= p582 + p583 + p584 + p585 + p586 + p587)) : A ((p178 <= p166 + p167 + p168 + p169 + p170 + p171)) : A ((X (F ((1 <= p173 + p174 + p175 + p176 + p177))) U X ((p73 + p72 + p71 + p70 + p69 + p74 <= p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214)))) : A ((X (X ((p229 + p230 + p231 + p232 + p233 + p234 <= p315))) U ((2 <= p122) U (1 <= p544)))) : A ((X (G ((p338 + p339 + p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 <= p607 + p608 + p609 + p610 + p611 + p612))) U ((1 <= p173 + p174 + p175 + p176 + p177) U FALSE))) : A ((X (G ((2 <= p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159))) U F (G ((1 <= p54 + p53 + p52 + p51 + p50 + p49))))) : A (X (G ((1 <= p614 + p615 + p616 + p617 + p618 + p619)))) : A (G (X (X (X ((p110 + p111 + p112 + p113 + p114 + p115 <= p544)))))) : A (X ((3 <= p411 + p412 + p413 + p414 + p415 + p416))) : A (X ((X ((p284 + p285 + p286 + p287 + p288 + p289 <= p411 + p412 + p413 + p414 + p415 + p416)) U X ((p48 <= p100 + p101 + p102 + p103 + p98 + p99))))) : A (X (G (G (FALSE)))) : A (F (X (F (X ((1 <= p221 + p222 + p223 + p224 + p225 + p226)))))) : A (X (X (X (G ((3 <= p284 + p285 + p286 + p287 + p288 + p289)))))) : A ((G (X ((p593 + p592 + p591 + p590 + p589 + p588 <= p626 + p627 + p628 + p629 + p630 + p631))) U G (F ((2 <= p110 + p111 + p112 + p113 + p114 + p115)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:410
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:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 208 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p296 + p297 + p298 + p299 + p300 + p301)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p296 + p297 + p298 + p299 + p300 + p301)
lola: processed formula length: 46
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
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: ========================================
check_solution: Constraint R16 = 0 is above its equality of -1
check_solution: Constraint R35 = 0 is above its equality of -1
check_solution: Constraint R139 = 0 is above its equality of -1
check_solution: Constraint R195 = 0 is above its equality of -1
check_solution: Constraint R197 = 0 is above its equality of -1
check_solution: Constraint R198 = 0 is above its equality of -1
check_solution: Constraint R199 = 0 is above its equality of -1
check_solution: Constraint R200 = 0 is above its equality of -1
check_solution: Constraint R201 = 0 is above its equality of -1
check_solution: Constraint R228 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 1)

FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p544)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p544)
lola: processed formula length: 11
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
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: ========================================

FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p318 + p319 + p320 + p321 + p322 + p323 <= p582 + p583 + p584 + p585 + p586 + p587)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p318 + p319 + p320 + p321 + p322 + p323 <= p582 + p583 + p584 + p585 + p586 + p587)
lola: processed formula length: 84
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T06-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
lola: ========================================

FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 257 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p178 <= p166 + p167 + p168 + p169 + p170 + p171)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p178 <= p166 + p167 + p168 + p169 + p170 + p171)
lola: processed formula length: 49
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T06-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

lola: FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 278 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: 25 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T06-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 PolyORBLF-COL-S06J04T06-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 303 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: 25 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T06-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 PolyORBLF-COL-S06J04T06-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 334 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((1 <= p173 + p174 + p175 + p176 + p177)) U (p73 + p72 + p71 + p70 + p69 + p74 <= p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((1 <= p173 + p174 + p175 + p176 + p177)) U (p73 + p72 + p71 + p70 + p69 + p74 <= p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214))))
lola: processed formula length: 344
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T06-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: 7 markings, 6 edges
lola: ========================================

FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((1 <= p614 + p615 + p616 + p617 + p618 + p619))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((1 <= p614 + p615 + p616 + p617 + p618 + p619))))
lola: processed formula length: 58
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T06-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: 9 markings, 9 edges
lola: ========================================

FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((p110 + p111 + p112 + p113 + p114 + p115 <= p544))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((p110 + p111 + p112 + p113 + p114 + p115 <= p544))))))
lola: processed formula length: 69
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T06-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: 522 markings, 539 edges
lola: ========================================

FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 477 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p411 + p412 + p413 + p414 + p415 + p416)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((3 <= p411 + p412 + p413 + p414 + p415 + p416)))
lola: processed formula length: 54
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T06-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: 9 markings, 9 edges
lola: ========================================

FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((p284 + p285 + p286 + p287 + p288 + p289 <= p411 + p412 + p413 + p414 + p415 + p416) U (p48 <= p100 + p101 + p102 + p103 + p98 + p99)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((p284 + p285 + p286 + p287 + p288 + p289 <= p411 + p412 + p413 + p414 + p415 + p416) U (p48 <= p100 + p101 + p102 + p103 + p98 + p99)))))
lola: processed formula length: 147
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T06-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: 9 markings, 9 edges
lola: ========================================

FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 668 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((p229 + p230 + p231 + p232 + p233 + p234 <= p315))) U ((2 <= p122) U (1 <= p544))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((p229 + p230 + p231 + p232 + p233 + p234 <= p315))) U ((2 <= p122) U (1 <= p544))))
lola: processed formula length: 93
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T06-LTLCardinality.task
lola: the resulting Büchi automaton has 7 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: 61 markings, 94 edges
lola: ========================================

FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 835 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((1 <= p221 + p222 + p223 + p224 + p225 + p226)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((1 <= p221 + p222 + p223 + p224 + p225 + p226)))))
lola: processed formula length: 62
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T06-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: 9 markings, 9 edges
lola: ========================================

FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1113 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((3 <= p284 + p285 + p286 + p287 + p288 + p289))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((3 <= p284 + p285 + p286 + p287 + p288 + p289))))))
lola: processed formula length: 66
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T06-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: 4915 markings, 5048 edges
lola: ========================================

FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1670 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= p54 + p53 + p52 + p51 + p50 + p49))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= p54 + p53 + p52 + p51 + p50 + p49))))
lola: processed formula length: 52
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T06-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: 438 markings, 439 edges
lola: ========================================

FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3340 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= p110 + p111 + p112 + p113 + p114 + p115))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= p110 + p111 + p112 + p113 + p114 + p115))))
lola: processed formula length: 58
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T06-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: 211 markings, 211 edges
lola: ========================================

FORMULA PolyORBLF-COL-S06J04T06-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes yes yes no no no no no no no no no no no
lola:
preliminary result: no no yes yes yes no no no no no no no no no no no
lola: memory consumption: 43052 KB
lola: time consumption: 227 seconds

BK_STOP 1552923725948

--------------------
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="PolyORBLF-COL-S06J04T06"
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-3957"
echo " Executing tool win2018"
echo " Input is PolyORBLF-COL-S06J04T06, 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 r121-smll-155272326100068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J04T06.tgz
mv PolyORBLF-COL-S06J04T06 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 ;