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 mcc4mcc-full
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 r214-smll-152732265500363
=====================================================================

--------------------
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 1527460523076


BK_STOP 1527460604455

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-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 stderr -----
----- Start make prepare stdout -----
===========================================================================================
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 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 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 <= p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303) U (2 <= p50))))) : A (G ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))) : A (F ((2 <= p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240))) : A ((G (G ((p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 <= p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760))) U G (G ((p328 + p329 <= p707 + p708 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716))))) : A ((X (G ((p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 <= p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483))) U F (X ((p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769 + p770 <= p831))))) : A ((p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 <= p842 + p841 + p840 + p839 + p838 + p837 + p836 + p835 + p834 + p833)) : A (G (F (G (G ((1 <= p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760)))))) : A (F ((F ((p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 <= 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 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706)) U F ((p707 + p708 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716 <= p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636))))) : A (G ((1 <= p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760))) : A (G (G (G (G ((p241 <= p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261)))))) : A ((F (X ((p304 <= p584))) U ((p820 <= p602) U (p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769 + p770 <= p801)))) : A (G (X ((p801 <= p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573)))) : A (((p307 <= p47 + p46 + p45 + p44 + p43 + p42 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p48 + p49) U X (X ((2 <= p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800))))) : A (G ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9))) : A ((2 <= p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p789 + p790)) : A (F (X ((2 <= p272))))
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 <= p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303) U (2 <= p50)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (((3 <= p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303) U (2 <= p50)))))
lola: processed formula: A (F (G (((3 <= p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303) U (2 <= p50)))))
lola: processed formula length: 101
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: 353 markings, 354 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))
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 <= p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240)))
lola: processed formula: A (F ((2 <= p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240)))
lola: processed formula length: 82
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: 62009 markings, 94210 edges, 12402 markings/sec, 0 secs
lola: 126351 markings, 195365 edges, 12868 markings/sec, 5 secs
lola: 190111 markings, 295834 edges, 12752 markings/sec, 10 secs
lola: 252265 markings, 393773 edges, 12431 markings/sec, 15 secs
lola: 316761 markings, 495290 edges, 12899 markings/sec, 20 secs
lola: 379576 markings, 594239 edges, 12563 markings/sec, 25 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: 439987 markings, 689655 edges
lola: ========================================
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (G ((p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 <= p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760))) U G (G ((p328 + p329 <= p707 + p708 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (G ((p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 <= p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760))) U G (G ((p328 + p329 <= p707 + p708 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716)))))
lola: processed formula: A ((G (G ((p294 + p295 + p296 + p297 + p298 + p299 + p300 + p301 + p302 + p303 <= p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760))) U G (G ((p328 + p329 <= p707 + p708 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716)))))
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: 352 markings, 352 edges
lola: ========================================
lola: subprocess 4 will run for 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 <= p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483))) U F (X ((p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769 + p770 <= p831)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (G ((p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 <= p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483))) U F (X ((p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769 + p770 <= p831)))))
lola: processed formula: A ((X (G ((p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 <= p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483))) U F (X ((p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769 + p770 <= p831)))))
lola: processed formula length: 242
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 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 <= p842 + p841 + p840 + p839 + p838 + p837 + p836 + p835 + p834 + p833))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p340 + p341 + p342 + p343 + p344 + p345 + p346 + p347 + p348 + p349 <= p842 + p841 + p840 + p839 + p838 + p837 + p836 + p835 + p834 + p833)
lola: processed formula length: 140
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 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (G (G ((1 <= p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G ((1 <= p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760)))))
lola: processed formula: A (F (G (G ((1 <= p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760)))))
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: 353 markings, 354 edges
lola: ========================================
lola: subprocess 7 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 <= 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 + p677 + p678 + p679 + p680 + p681 + p68... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 <= 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 + p677 + p678 + p679 + p680 + p681 + p682 + p683 + p684 + p685 + p686 + p687 + p688 + p689 + p690 + p691 + p692 + p693 + p694 + p695 + p696 + p697 + p698 + p699 + p700 + p701 + p702 + p703 + p704 + p705 + p706)) U F ((p707 + p708 + p709 + p710 + p711 + p712 + p713 + p714 + p715 + p716 <= p627 + p628 + p629 + p630 + p631 + p632 + p633 + p634 + p635 + p636)))))
lola: processed formula: A (F ((F ((p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 <= 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 + p677 + p678 + p679 + p680 + p681 + p68... (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 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p741 + p742 + p743 + p744 + p745 + p746 + p747 + p748 + p749 + p750 + p751 + p752 + p753 + p754 + p755 + p756 + p757 + p758 + p759 + p760)))
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 500 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (G (G ((p241 <= p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (G (G ((p241 <= p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261))))))
lola: processed formula: A (G (G (G (G ((p241 <= p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261))))))
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: 3669 markings, 3732 edges
lola: ========================================
lola: subprocess 10 will run for 584 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((p304 <= p584))) U ((p820 <= p602) U (p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769 + p770 <= p801))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((p304 <= p584))) U ((p820 <= p602) U (p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769 + p770 <= p801))))
lola: processed formula: A ((F (X ((p304 <= p584))) U ((p820 <= p602) U (p761 + p762 + p763 + p764 + p765 + p766 + p767 + p768 + p769 + p770 <= p801))))
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 700 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((p801 <= p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X ((p801 <= p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573))))
lola: processed formula: A (G (X ((p801 <= p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573))))
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: 544 markings, 544 edges
lola: ========================================
lola: subprocess 12 will run for 876 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p307 <= p47 + p46 + p45 + p44 + p43 + p42 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p48 + p49) U X (X ((2 <= p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p307 <= p47 + p46 + p45 + p44 + p43 + p42 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p48 + p49) U X (X ((2 <= p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800)))))
lola: processed formula: A (((p307 <= p47 + p46 + p45 + p44 + p43 + p42 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 + p39 + p40 + p41 + p48 + p49) U X (X ((2 <= p791 + p792 + p793 + p794 + p795 + p796 + p797 + p798 + p799 + p800)))))
lola: processed formula length: 218
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: 544 markings, 544 edges
lola: ========================================
lola: subprocess 13 will run for 1168 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9)))
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 1752 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p789 + p790))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p781 + p782 + p783 + p784 + p785 + p786 + p787 + p788 + p789 + p790)
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 3504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((2 <= p272))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X ((2 <= p272))))
lola: processed formula: A (F (X ((2 <= p272))))
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: 544 markings, 544 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 stdout -----
----- Kill lola and sara stderr -----
----- 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="mcc4mcc-full"
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 mcc4mcc-full"
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 r214-smll-152732265500363"
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 ;