fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r208-smll-152732257600353
Last Updated
June 26, 2018

About the Execution of LoLA for PolyORBLF-COL-S02J04T06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
176.580 79781.00 80712.00 239.20 FTTFTFFFFFTTFTTF normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......................
/home/mcc/execution
total 328K
-rw-r--r-- 1 mcc users 5.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.7K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 154K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PolyORBLF-COL-S02J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732257600353
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527965057686

info: Time: 3600 - MCC
===========================================================================================
prep: translating PolyORBLF-COL-S02J04T06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PolyORBLF-COL-S02J04T06 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking LTLCardinality @ PolyORBLF-COL-S02J04T06 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1396/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 15232
lola: finding significant places
lola: 476 places, 920 transitions, 430 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1243 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J04T06-LTLCardinality.task
lola: LP says that atomic proposition is always true: (p26 + p25 + p24 + p23 + p22 + p21 <= p195)
lola: LP says that atomic proposition is always false: (3 <= p413 + p414 + p415 + p416 + p417 + p418)
lola: LP says that atomic proposition is always false: (2 <= p0 + p1 + p2 + p3 + p4 + p5)
lola: LP says that atomic proposition is always false: (2 <= p366 + p367 + p368 + p369 + p370 + p371)
lola: LP says that atomic proposition is always false: (3 <= p315 + p316 + p317 + p318 + p319 + p320)
lola: LP says that atomic proposition is always false: (3 <= p291 + p292 + p293 + p294 + p295 + p296)
lola: LP says that atomic proposition is always false: (2 <= p117)
lola: A (X ((3 <= p157 + p158 + p159 + p160 + p161 + p162))) : A ((p144 <= p99)) : A ((F (TRUE) U ((p321 + p322 <= p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142) U (1 <= p407 + p408 + p409 + p410 + p411 + p412)))) : A (FALSE) : A (F ((p297 + p298 + p299 + p300 + p301 + p302 <= p222 + p223 + p224 + p225 + p226 + p227))) : A (((p106 + p107 + p108 + p109 + p110 <= p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334) U G ((p117 <= p97 + p98)))) : A (X (X ((p130 <= p163)))) : A (FALSE) : A ((F (FALSE) U F (G ((p366 + p367 + p368 + p369 + p370 + p371 <= p27 + p28 + p29 + p30 + p31 + p32))))) : A (X (FALSE)) : A ((p100 + p101 + p102 + p103 + p104 + p105 <= p194)) : A ((((p321 + p322 <= p210 + p211 + p212 + p213 + p214 + p215) U (3 <= p124 + p125 + p126 + p127 + p128 + p129)) U ((p26 + p25 + p24 + p23 + p22 + p21 <= p261 + p262 + p263 + p264 + p265 + p266) U (1 <= p111 + p112 + p113 + p114 + p115 + p116)))) : A (((p27 + p28 + p29 + p30 + p31 + p32 <= p111 + p112 + p113 + p114 + p115 + p116) U FALSE)) : A ((p260 <= p384 + p385 + p386 + p387 + p388 + p389)) : A ((p291 + p292 + p293 + p294 + p295 + p296 <= p183 + p184 + p185 + p186 + p187)) : A ((((p89 + p88 + p87 + p86 + p85 + p90 <= p70) U (1 <= p194)) U ((p372 + p373 + p374 + p375 + p376 + p377 <= p144) U FALSE)))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:98
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:98
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:180
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: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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 218 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p144 <= p99)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p144 <= p99)
lola: processed formula length: 13
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T06-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: ========================================
check_solution: Variable C1192 = -6 is below its lower bound 0
check_solution: Variable C1252 = -6 is below its lower bound 0
check_solution: Variable C1312 = -6 is below its lower bound 0
check_solution: Constraint R4 = -42 is below its equality of 0
check_solution: Constraint R5 = -107 is below its equality of 0
check_solution: Constraint R6 = -182 is below its equality of 0
check_solution: Constraint R7 = -16 is below its equality of 0
check_solution: Constraint R8 = -499 is below its equality of -1
check_solution: Constraint R9 = -179 is below its equality of -1
check_solution: Constraint R10 = -204 is below its equality of 0

Seriously low accuracy found ||*|| = 1740 (rel. error 498)

FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 232 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-S02J04T06-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-S02J04T06-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 249 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-S02J04T06-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-S02J04T06-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 268 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-S02J04T06-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-S02J04T06-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p100 + p101 + p102 + p103 + p104 + p105 <= p194)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p100 + p101 + p102 + p103 + p104 + p105 <= p194)
lola: processed formula length: 49
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T06-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-S02J04T06-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 317 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-S02J04T06-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-S02J04T06-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 6 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p260 <= p384 + p385 + p386 + p387 + p388 + p389)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p260 <= p384 + p385 + p386 + p387 + p388 + p389)
lola: processed formula length: 49
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T06-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-S02J04T06-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p291 + p292 + p293 + p294 + p295 + p296 <= p183 + p184 + p185 + p186 + p187)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p291 + p292 + p293 + p294 + p295 + p296 <= p183 + p184 + p185 + p186 + p187)
lola: processed formula length: 77
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T06-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-S02J04T06-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 436 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-S02J04T06-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-S02J04T06-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 499 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((p130 <= p163))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((p130 <= p163))))
lola: processed formula length: 26
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T06-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: 347 markings, 347 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 582 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p157 + p158 + p159 + p160 + p161 + p162)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((3 <= p157 + p158 + p159 + p160 + p161 + p162)))
lola: processed formula length: 54
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T06-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: 347 markings, 347 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 698 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p407 + p408 + p409 + p410 + p411 + p412)))
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: (p407 + p408 + p409 + p410 + p411 + p412 <= 0)
lola: processed formula length: 46
lola: 27 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T06-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: 8475 markings, 10917 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 873 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p297 + p298 + p299 + p300 + p301 + p302 <= p222 + p223 + p224 + p225 + p226 + p227)))
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: (p222 + p223 + p224 + p225 + p226 + p227 + 1 <= p297 + p298 + p299 + p300 + p301 + p302)
lola: processed formula length: 88
lola: 27 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T06-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 PolyORBLF-COL-S02J04T06-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1164 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p366 + p367 + p368 + p369 + p370 + p371 <= p27 + p28 + p29 + p30 + p31 + p32))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p366 + p367 + p368 + p369 + p370 + p371 <= p27 + p28 + p29 + p30 + p31 + p32))))
lola: processed formula length: 90
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T06-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: 3411 markings, 3473 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1746 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p106 + p107 + p108 + p109 + p110 <= p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334) U G ((p117 <= p97 + p98))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p106 + p107 + p108 + p109 + p110 <= p323 + p324 + p325 + p326 + p327 + p328 + p329 + p330 + p331 + p332 + p333 + p334) U G ((p117 <= p97 + p98))))
lola: processed formula length: 151
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T06-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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 381 markings, 381 edges

FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3492 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p321 + p322 <= p210 + p211 + p212 + p213 + p214 + p215) U (3 <= p124 + p125 + p126 + p127 + p128 + p129)) U ((p26 + p25 + p24 + p23 + p22 + p21 <= p261 + p262 + p263 + p264 + p265 + p266) U (1 <= p111 + p112 + p113 + p114 + p115 + p116))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p321 + p322 <= p210 + p211 + p212 + p213 + p214 + p215) U (3 <= p124 + p125 + p126 + p127 + p128 + p129)) U ((p26 + p25 + p24 + p23 + p22 + p21 <= p261 + p262 + p263 + p264 + p265 + p266) U (1 <= p111 + p112 + p113 + p114 + p115 + p116))))
lola: processed formula length: 245
lola: 25 rewrites
lola: closed formula file PolyORBLF-COL-S02J04T06-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: 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: 34203 markings, 40601 edges
lola: ========================================

FORMULA PolyORBLF-COL-S02J04T06-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no yes no no no no no yes yes no yes yes no
lola:
preliminary result: no yes yes no yes no no no no no yes yes no yes yes no
lola: memory consumption: 22132 KB
lola: time consumption: 79 seconds

BK_STOP 1527965137467

--------------------
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-S02J04T06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S02J04T06.tgz
mv PolyORBLF-COL-S02J04T06 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is PolyORBLF-COL-S02J04T06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r208-smll-152732257600353"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;