About the Execution of Irma.struct for PolyORBLF-COL-S02J06T10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1438.880 | 71926.00 | 31291.00 | 796.50 | FFFFTFFTFFTFFFFF | 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 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 2.8K 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 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 irma4mcc-structural
Input is PolyORBLF-COL-S02J06T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-152732261900363
=====================================================================
--------------------
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-S02J06T10-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J06T10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527431934958
BK_STOP 1527432006884
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBLF-COL-S02J06T10 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 233832, 'Memory': 15946.59, 'Tool': 'lola'}, {'Time': 381754, 'Memory': 15927.5, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PolyORBLF-COL-S02J06T10...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBLF-COL-S02J06T10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBLF-COL-S02J06T10: translating COL formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ PolyORBLF-COL-S02J06T10 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 2656/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 844 places, 1812 transitions, 786 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2543 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: A (F (G (((3 <= p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606) U (2 <= p226))))) : A (G ((2 <= p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236))) : A (F ((2 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17))) : A ((G (G ((p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 <= p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128))) U G (G ((p759 + p758 <= p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502))))) : A ((X (G ((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257))) U F (X ((p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 <= p480))))) : A ((p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 <= p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19)) : A (G (F (G (G ((1 <= p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128)))))) : A (F ((F ((p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 <= p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p676)) U F ((p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 <= p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414))))) : A (G ((1 <= p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128))) : A (G (G (G (G ((p544 <= p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564)))))) : A ((F (X ((p843 <= p247))) U ((p842 <= p278) U (p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 <= p543)))) : A (G (X ((p543 <= p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358)))) : A (((p129 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192) U X (X ((2 <= p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202))))) : A (G ((1 <= p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236))) : A ((2 <= p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404)) : A (F (X ((2 <= p225))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((3 <= p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606) U (2 <= p226)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (((3 <= p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606) U (2 <= p226)))))
lola: processed formula: A (F (G (((3 <= p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606) U (2 <= p226)))))
lola: processed formula length: 102
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 bytes per marking, with 30 unused bits
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: 615 markings, 616 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))
lola: processed formula: A (F ((2 <= p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17)))
lola: processed formula length: 70
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 114178 markings, 175873 edges, 22836 markings/sec, 0 secs
lola: 225016 markings, 348146 edges, 22168 markings/sec, 5 secs
lola: 334876 markings, 520168 edges, 21972 markings/sec, 10 secs
lola: 445367 markings, 691943 edges, 22098 markings/sec, 15 secs
lola: 555765 markings, 863079 edges, 22080 markings/sec, 20 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: 587097 markings, 912128 edges
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 <= p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128))) U G (G ((p759 + p758 <= p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 <= p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128))) U G (G ((p759 + p758 <= p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502)))))
lola: processed formula: A ((G (G ((p597 + p598 + p599 + p600 + p601 + p602 + p603 + p604 + p605 + p606 <= p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128))) U G (G ((p759 + p758 <= p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502)))))
lola: processed formula length: 319
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 bytes per marking, with 29 unused bits
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: 473 markings, 473 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257))) U F (X ((p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 <= p480)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (G ((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257))) U F (X ((p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 <= p480)))))
lola: processed formula: A ((X (G ((p8 + p9 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 <= p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257))) U F (X ((p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 <= p480)))))
lola: processed formula length: 230
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 bytes per marking, with 30 unused bits
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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 <= p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 <= p28 + p27 + p26 + p25 + p24 + p23 + p22 + p21 + p20 + p19)
lola: processed formula length: 130
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-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: ========================================
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (G ((1 <= p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G ((1 <= p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128)))))
lola: processed formula: A (F (G (G ((1 <= p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128)))))
lola: processed formula length: 160
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 bytes per marking, with 30 unused bits
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: 513 markings, 514 edges
lola: ========================================
lola: subprocess 7 will run for 390 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 <= p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p65... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 <= p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p652 + p653 + p654 + p655 + p656 + p657 + p658 + p659 + p660 + p661 + p662 + p663 + p664 + p665 + p666 + p667 + p668 + p669 + p670 + p671 + p672 + p673 + p674 + p675 + p676)) U F ((p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 <= p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414)))))
lola: processed formula: A (F ((F ((p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358 <= p607 + p608 + p609 + p610 + p611 + p612 + p613 + p614 + p615 + p616 + p617 + p618 + p619 + p620 + p621 + p622 + p623 + p624 + p625 + p626 + p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636 + p637 + p638 + p639 + p640 + p641 + p642 + p643 + p644 + p645 + p646 + p647 + p648 + p649 + p650 + p651 + p65... (shortened)
lola: processed formula length: 721
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 439 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 501 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (G (G ((p544 <= p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (G (G ((p544 <= p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564))))))
lola: processed formula: A (G (G (G (G ((p544 <= p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564))))))
lola: processed formula length: 97
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 bytes per marking, with 30 unused bits
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: 181 markings, 181 edges
lola: ========================================
lola: subprocess 10 will run for 585 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((p843 <= p247))) U ((p842 <= p278) U (p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 <= p543))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((p843 <= p247))) U ((p842 <= p278) U (p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 <= p543))))
lola: processed formula: A ((F (X ((p843 <= p247))) U ((p842 <= p278) U (p832 + p833 + p834 + p835 + p836 + p837 + p838 + p839 + p840 + p841 <= p543))))
lola: processed formula length: 127
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 bytes per marking, with 30 unused bits
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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 702 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((p543 <= p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X ((p543 <= p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358))))
lola: processed formula: A (G (X ((p543 <= p349 + p350 + p351 + p352 + p353 + p354 + p355 + p356 + p357 + p358))))
lola: processed formula length: 89
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 bytes per marking, with 30 unused bits
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: 334 markings, 334 edges
lola: ========================================
lola: subprocess 12 will run for 878 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p129 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192) U X (X ((2 <= p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p129 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192) U X (X ((2 <= p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202)))))
lola: processed formula: A (((p129 <= p173 + p174 + p175 + p176 + p177 + p178 + p179 + p180 + p181 + p182 + p183 + p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192) U X (X ((2 <= p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202)))))
lola: processed formula length: 238
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 bytes per marking, with 29 unused bits
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: 334 markings, 334 edges
lola: ========================================
lola: subprocess 13 will run for 1171 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3144 bytes per marking, with 0 unused bits
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1756 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p395 + p396 + p397 + p398 + p399 + p400 + p401 + p402 + p403 + p404)
lola: processed formula length: 74
lola: 1 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-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: ========================================
lola: subprocess 15 will run for 3513 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((2 <= p225))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X ((2 <= p225))))
lola: processed formula: A (F (X ((2 <= p225))))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 844 places; total mentions: 0
lola: closed formula file PolyORBLF-COL-S02J06T10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3148 bytes per marking, with 30 unused bits
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: 334 markings, 334 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no yes no no yes no no yes no no no no no
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-COL-S02J06T10-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----
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-S02J06T10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-structural"
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-S02J06T10.tgz
mv PolyORBLF-COL-S02J06T10 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 irma4mcc-structural"
echo " Input is PolyORBLF-COL-S02J06T10, 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 r211-smll-152732261900363"
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 '
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 ;