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

About the Execution of 2018-Gold for PolyORBLF-COL-S06J04T04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
273.520 259337.00 304503.00 524.20 FFFTFFTFFTFFFFTF normal

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-155272326100065.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-S06J04T04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-smll-155272326100065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 4.4K Feb 12 09:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 12 09:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 8 09:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 8 09:50 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:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 4 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 4 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 1 08:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 1 08:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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-S06J04T04-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S06J04T04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552920628877

info: Time: 3600 - MCC
===========================================================================================
prep: translating PolyORBLF-COL-S06J04T04 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PolyORBLF-COL-S06J04T04 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ PolyORBLF-COL-S06J04T04 @ 3568 seconds
lola: LoLA will run for 3568 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7448/65536 symbol table entries, 2235 collisions
lola: preprocessing...
lola: Size of bit vector: 14528
lola: finding significant places
lola: 454 places, 6994 transitions, 404 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1823 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152)
lola: LP says that atomic proposition is always false: (2 <= p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41)
lola: LP says that atomic proposition is always false: (3 <= p43 + p44 + p45 + p46)
lola: LP says that atomic proposition is always false: (3 <= p92)
lola: LP says that atomic proposition is always false: (p405 <= p58 + p57 + p56 + p55)
lola: LP says that atomic proposition is always false: (3 <= p187 + p188 + p189 + p190 + p191)
lola: LP says that atomic proposition is always false: (3 <= p63)
lola: LP says that atomic proposition is always false: (2 <= p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152)
lola: LP says that atomic proposition is always false: (3 <= p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277)
lola: LP says that atomic proposition is always false: (2 <= p328 + p329 + p330 + p331)
lola: A ((F (G ((1 <= p7))) U F (X (FALSE)))) : A ((3 <= p196)) : A (G ((X ((p243 + p244 + p245 + p246 + p247 <= p197 + p198 + p199 + p200)) U (1 <= p16 + p15 + p14 + p13)))) : A ((G (G (FALSE)) U (1 <= p59 + p60 + p61 + p62))) : A (F (F (G (G ((p17 + p18 + p19 + p20 <= p186)))))) : A (X ((G (FALSE) U G (FALSE)))) : A ((p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 <= p362)) : A (F ((F (FALSE) U (p63 <= p326)))) : A (F (F ((3 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124)))) : A ((p328 + p329 + p330 + p331 <= p42)) : A (F ((X ((p210 <= p444 + p445 + p446 + p447)) U FALSE))) : A (FALSE) : A (F (X (G (F ((p248 + p249 + p250 + p251 + p252 + p253 <= p157 + p158 + p159 + p160)))))) : A (X (F (F (F (FALSE))))) : A ((G (G (FALSE)) U ((2 <= p343 + p344 + p345 + p346 + p347) U (p407 + p408 + p409 + p410 <= p182 + p183 + p184 + p185)))) : A ((FALSE U G ((p327 <= p435 + p436 + p437 + p438))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
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:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:185
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
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:163
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 212 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: 52 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: ========================================
check_solution: Constraint R1 = 0 is below its lower bound 1
check_solution: Constraint R6 = 0 is above its equality of -1
check_solution: Constraint R8 = 0 is above its equality of -1
check_solution: Constraint R73 = 0 is above its equality of -1
check_solution: Constraint R74 = 0 is above its equality of -1
check_solution: Constraint R75 = 0 is above its equality of -1
check_solution: Constraint R76 = 0 is above its equality of -1
check_solution: Constraint R77 = 0 is above its equality of -1
check_solution: Constraint R104 = 0 is above its equality of -1
check_solution: Constraint R108 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Constraint R6 = 0 is above its equality of -1
check_solution: Constraint R8 = 0 is above its equality of -1
check_solution: Constraint R73 = 0 is above its equality of -1
check_solution: Constraint R74 = 0 is above its equality of -1
check_solution: Constraint R75 = 0 is above its equality of -1
check_solution: Constraint R76 = 0 is above its equality of -1
check_solution: Constraint R77 = 0 is above its equality of -1
check_solution: Constraint R104 = 0 is above its equality of -1
check_solution: Constraint R108 = 0 is above its equality of -1
check_solution: Constraint R160 = 0 is above its equality of -1

Seriously low accuracy found ||*|| = 10 (rel. error 1)
check_solution: Constraint R1 = 6.94934789099e-310 is below its lower bound 1
check_solution: Constraint R4 = 0.936811884704 is above its equality of 0
check_solution: Constraint R5 = 0.983162749511 is above its equality of 0
check_solution: Constraint R6 = 0.936811884704 is above its equality of -1
check_solution: Constraint R7 = 0.936811884704 is above its equality of 0
check_solution: Constraint R8 = 0.983162749511 is above its equality of -1
check_solution: Constraint R9 = 0.983162749511 is above its equality of 0
check_solution: Constraint R10 = 0.983162749511 is above its equality of 0
check_solution: Constraint R11 = 0.983162749511 is above its equality of 0
check_solution: Constraint R12 = 0.983162749511 is above its equality of 0

Seriously low accuracy found ||*|| = 11.3243 (rel. error 1.12753)

FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p196)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p196)
lola: processed formula length: 11
lola: 52 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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-S06J04T04-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p59 + p60 + p61 + p62)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p59 + p60 + p61 + p62)
lola: processed formula length: 28
lola: 52 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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-S06J04T04-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 261 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: 52 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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-S06J04T04-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 <= p362)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 + p265 + p266 + p267 + p268 + p269 + p270 + p271 + p272 + p273 + p274 + p275 + p276 + p277 <= p362)
lola: processed formula length: 175
lola: 52 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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-S06J04T04-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 309 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p328 + p329 + p330 + p331 <= p42)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p328 + p329 + p330 + p331 <= p42)
lola: processed formula length: 34
lola: 52 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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-S06J04T04-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 340 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: 52 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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-S06J04T04-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 377 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: 52 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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-S06J04T04-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 425 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: 52 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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-S06J04T04-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((1 <= p16 + p15 + p14 + p13)))) AND A (G ((X ((p243 + p244 + p245 + p246 + p247 <= p197 + p198 + p199 + p200)) OR (1 <= p16 + p15 + p14 + p13)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 485 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= p16 + p15 + p14 + p13))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= p16 + p15 + p14 + p13))))
lola: processed formula length: 40
lola: 52 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: 7976 markings, 13399 edges, 1595 markings/sec, 0 secs
lola: 15492 markings, 27202 edges, 1503 markings/sec, 5 secs
lola: 23422 markings, 40578 edges, 1586 markings/sec, 10 secs
lola: 30906 markings, 54318 edges, 1497 markings/sec, 15 secs
lola: 38129 markings, 67644 edges, 1445 markings/sec, 20 secs
lola: 45240 markings, 80866 edges, 1422 markings/sec, 25 secs
lola: 53328 markings, 94735 edges, 1618 markings/sec, 30 secs
lola: 58657 markings, 109577 edges, 1066 markings/sec, 35 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: 59340 markings, 112575 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 560 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p327 <= p435 + p436 + p437 + p438)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p327 <= p435 + p436 + p437 + p438)))
lola: processed formula length: 43
lola: 54 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p435 + p436 + p437 + p438 + 1 <= p327)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-COL-S06J04T04-LTLCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-COL-S06J04T04-LTLCardinality-10-0.sara.
lola: sara is running 0 secs || 14168 markings, 14449 edges, 2834 markings/sec, 0 secs
lola: sara is running 5 secs || 28306 markings, 28903 edges, 2828 markings/sec, 5 secs
lola: sara is running 10 secs || 42527 markings, 43984 edges, 2844 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 15 secs || 56703 markings, 58968 edges, 2835 markings/sec, 15 secs
lola: sara is running 20 secs || 70901 markings, 74093 edges, 2840 markings/sec, 20 secs
lola: sara is running 25 secs || 85009 markings, 88667 edges, 2822 markings/sec, 25 secs

lola: sara is running 30 secs || 99051 markings, 103150 edges, 2808 markings/sec, 30 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================

FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 664 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p63 <= p326)))
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: (p326 + 1 <= p63)
lola: processed formula length: 17
lola: 54 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: 5201 markings, 16269 edges, 1040 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 5240 markings, 16634 edges
lola: ========================================

FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 828 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124)))
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: (p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 <= 2)
lola: processed formula length: 172
lola: 54 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 37 markings, 36 edges

FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1105 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p17 + p18 + p19 + p20 <= p186))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p17 + p18 + p19 + p20 <= p186))))
lola: processed formula length: 43
lola: 52 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: 10064 markings, 15135 edges

FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1655 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p248 + p249 + p250 + p251 + p252 + p253 <= p157 + p158 + p159 + p160))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p248 + p249 + p250 + p251 + p252 + p253 <= p157 + p158 + p159 + p160))))
lola: processed formula length: 82
lola: 52 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-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: 726 markings, 777 edges

FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((2 <= p343 + p344 + p345 + p346 + p347) U (p407 + p408 + p409 + p410 <= p182 + p183 + p184 + p185)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((2 <= p343 + p344 + p345 + p346 + p347) U (p407 + p408 + p409 + p410 <= p182 + p183 + p184 + p185)))
lola: processed formula length: 104
lola: 56 rewrites
lola: closed formula file PolyORBLF-COL-S06J04T04-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges

FORMULA PolyORBLF-COL-S06J04T04-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no no yes no no yes no no no no yes no
lola:
preliminary result: no no no yes no no yes no no yes no no no no yes no
lola: ========================================
lola: memory consumption: 32676 KB
lola: time consumption: 258 seconds

BK_STOP 1552920888214

--------------------
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-S06J04T04"
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-S06J04T04, 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-155272326100065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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