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 360K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.2K 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 9.1K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 185K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is TriangularGrid-PT-5046, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-152732267200735
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527522887175


BK_STOP 1527523342496

--------------------
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 TriangularGrid-PT-5046 as instance name.
Using TriangularGrid as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, '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': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 648, 'Memory': 106.66, 'Tool': 'lola'}, {'Time': 739, 'Memory': 106.26, 'Tool': 'lola'}, {'Time': 1122953, 'Memory': 15943.03, 'Tool': 'itstools'}, {'Time': 1154975, 'Memory': 15952.15, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola TriangularGrid-PT-5046...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
TriangularGrid-PT-5046: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
TriangularGrid-PT-5046: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ TriangularGrid-PT-5046 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 520/65536 symbol table entries, 4 collisions
lola: preprocessing...
lola: finding significant places
lola: 280 places, 240 transitions, 164 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 355 transition conflict sets
lola: TASK
lola: reading formula from TriangularGrid-PT-5046-LTLCardinality.task
lola: A (X ((1 <= pbl_4_3))) : A ((X (X ((3 <= pil1_2_3))) U G ((pbl_5_7 <= po3_5_9)))) : A ((2 <= pol1_2_3)) : A ((((2 <= po3_4_3) U (pi2_4_7 <= pil1_3_3)) U ((2 <= pol2_4_7) U (pi1_3_3 <= pil1_4_5)))) : A (X (G ((po3_5_1 <= pb3_2_3)))) : A (X (F (X (X ((1 <= po2_5_7)))))) : A (F ((pil1_2_3 <= pol1_3_1))) : A ((pb1_5_5 <= pil2_5_9)) : A (G ((po3_5_5 <= pb1_5_9))) : A (F (F (G ((pol3_3_1 <= po2_5_7))))) : A ((1 <= pb2_3_2)) : A ((pil3_5_1 <= pil2_3_5)) : A (G ((3 <= pb1_3_1))) : A (F (X (F ((pb3_5_1 <= pil1_5_9))))) : A (X (G (G (F ((pil1_5_1 <= pil3_5_5)))))) : A (F ((pi3_1_1 <= po3_4_5)))
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 (X ((1 <= pbl_4_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((1 <= pbl_4_3)))
lola: processed formula: A (X ((1 <= pbl_4_3)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 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: 76 markings, 75 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((3 <= pil1_2_3))) U G ((pbl_5_7 <= po3_5_9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (X ((3 <= pil1_2_3))) U G ((pbl_5_7 <= po3_5_9))))
lola: processed formula: A ((X (X ((3 <= pil1_2_3))) U G ((pbl_5_7 <= po3_5_9))))
lola: processed formula length: 56
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 8 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 bytes per marking, with 28 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: 654 markings, 654 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= pol1_2_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= pol1_2_3)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= po3_4_3) U (pi2_4_7 <= pil1_3_3)) U ((2 <= pol2_4_7) U (pi1_3_3 <= pil1_4_5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((2 <= po3_4_3) U (pi2_4_7 <= pil1_3_3)) U ((2 <= pol2_4_7) U (pi1_3_3 <= pil1_4_5))))
lola: processed formula: A ((((2 <= po3_4_3) U (pi2_4_7 <= pil1_3_3)) U ((2 <= pol2_4_7) U (pi1_3_3 <= pil1_4_5))))
lola: processed formula length: 90
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 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: 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G ((po3_5_1 <= pb3_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G ((po3_5_1 <= pb3_2_3))))
lola: processed formula: A (X (G ((po3_5_1 <= pb3_2_3))))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 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: 3129 markings, 3740 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X (X ((1 <= po2_5_7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (X (X ((1 <= po2_5_7))))))
lola: processed formula: A (X (F (X (X ((1 <= po2_5_7))))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 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: 869 markings, 869 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pil1_2_3 <= pol1_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((pil1_2_3 <= pol1_3_1)))
lola: processed formula: A (F ((pil1_2_3 <= pol1_3_1)))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pb1_5_5 <= pil2_5_9))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pb1_5_5 <= pil2_5_9)
lola: processed formula length: 21
lola: 1 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((po3_5_5 <= pb1_5_9)))
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 656 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: 9 markings, 8 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G ((pol3_3_1 <= po2_5_7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((pol3_3_1 <= po2_5_7))))
lola: processed formula: A (F (G ((pol3_3_1 <= po2_5_7))))
lola: processed formula length: 33
lola: 1 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 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: 1240101 markings, 1992596 edges, 248020 markings/sec, 0 secs
lola: 2378724 markings, 3830559 edges, 227725 markings/sec, 5 secs
lola: 3482610 markings, 5598795 edges, 220777 markings/sec, 10 secs
lola: 4565985 markings, 7373019 edges, 216675 markings/sec, 15 secs
lola: 5629249 markings, 9071560 edges, 212653 markings/sec, 20 secs
lola: 6633204 markings, 10718296 edges, 200791 markings/sec, 25 secs
lola: 7607384 markings, 12264110 edges, 194836 markings/sec, 30 secs
lola: 8615197 markings, 13941583 edges, 201563 markings/sec, 35 secs
lola: 9669312 markings, 15640953 edges, 210823 markings/sec, 40 secs
lola: 10678087 markings, 17268662 edges, 201755 markings/sec, 45 secs
lola: 11661242 markings, 18851014 edges, 196631 markings/sec, 50 secs
lola: 12698622 markings, 20498546 edges, 207476 markings/sec, 55 secs
lola: 13704654 markings, 22156925 edges, 201206 markings/sec, 60 secs
lola: 14700442 markings, 23726979 edges, 199158 markings/sec, 65 secs
lola: 15693374 markings, 25376847 edges, 198586 markings/sec, 70 secs
lola: 16719212 markings, 26945480 edges, 205168 markings/sec, 75 secs
lola: 17680032 markings, 28591627 edges, 192164 markings/sec, 80 secs
lola: 18686799 markings, 30237928 edges, 201353 markings/sec, 85 secs
lola: 19699375 markings, 31854366 edges, 202515 markings/sec, 90 secs
lola: 20678459 markings, 33443661 edges, 195817 markings/sec, 95 secs
lola: 21653835 markings, 34982090 edges, 195075 markings/sec, 100 secs
lola: 22622410 markings, 36585039 edges, 193715 markings/sec, 105 secs
lola: 23581848 markings, 38133736 edges, 191888 markings/sec, 110 secs
lola: 24489359 markings, 39609068 edges, 181502 markings/sec, 115 secs
lola: 25509487 markings, 41172130 edges, 204026 markings/sec, 120 secs
lola: 26481208 markings, 42790345 edges, 194344 markings/sec, 125 secs
lola: 27416263 markings, 44359787 edges, 187011 markings/sec, 130 secs
lola: 28414675 markings, 45943885 edges, 199682 markings/sec, 135 secs
lola: 29338676 markings, 47462160 edges, 184800 markings/sec, 140 secs
lola: 30317588 markings, 48951287 edges, 195782 markings/sec, 145 secs
lola: 31228536 markings, 50506211 edges, 182190 markings/sec, 150 secs
lola: 32257005 markings, 52149729 edges, 205694 markings/sec, 155 secs
lola: 33233232 markings, 53616724 edges, 195245 markings/sec, 160 secs
lola: 34206157 markings, 55196057 edges, 194585 markings/sec, 165 secs
lola: 35161988 markings, 56822719 edges, 191166 markings/sec, 170 secs
lola: 35991519 markings, 58284329 edges, 165906 markings/sec, 175 secs
lola: 37017897 markings, 59939940 edges, 205276 markings/sec, 180 secs
lola: 37975139 markings, 61473888 edges, 191448 markings/sec, 185 secs
lola: 38927652 markings, 62988433 edges, 190503 markings/sec, 190 secs
lola: 39885088 markings, 64505606 edges, 191487 markings/sec, 195 secs
lola: 40791613 markings, 66020507 edges, 181305 markings/sec, 200 secs
lola: 41719491 markings, 67490792 edges, 185576 markings/sec, 205 secs
lola: 42586597 markings, 68910249 edges, 173421 markings/sec, 210 secs
lola: 43555175 markings, 70386555 edges, 193716 markings/sec, 215 secs
lola: 44468589 markings, 71920231 edges, 182683 markings/sec, 220 secs
lola: 45385052 markings, 73418414 edges, 183293 markings/sec, 225 secs
lola: 46296022 markings, 74856827 edges, 182194 markings/sec, 230 secs
lola: 47168837 markings, 76300053 edges, 174563 markings/sec, 235 secs
lola: 48067545 markings, 77660162 edges, 179742 markings/sec, 240 secs
lola: 48912250 markings, 79109539 edges, 168941 markings/sec, 245 secs
lola: 49914549 markings, 80689236 edges, 200460 markings/sec, 250 secs
lola: 50840228 markings, 82084341 edges, 185136 markings/sec, 255 secs
lola: 51783046 markings, 83606928 edges, 188564 markings/sec, 260 secs
lola: 52678896 markings, 85160687 edges, 179170 markings/sec, 265 secs
lola: 53508477 markings, 86592058 edges, 165916 markings/sec, 270 secs
lola: 54444928 markings, 88107362 edges, 187290 markings/sec, 275 secs
lola: 55379855 markings, 89588673 edges, 186985 markings/sec, 280 secs
lola: 56318973 markings, 91067445 edges, 187824 markings/sec, 285 secs
lola: 57198475 markings, 92481942 edges, 175900 markings/sec, 290 secs
lola: 58071506 markings, 93948587 edges, 174606 markings/sec, 295 secs
lola: 59021944 markings, 95382135 edges, 190088 markings/sec, 300 secs
lola: 59907262 markings, 96749210 edges, 177064 markings/sec, 305 secs
lola: 60798664 markings, 98268155 edges, 178280 markings/sec, 310 secs
lola: 61578541 markings, 99642438 edges, 155975 markings/sec, 315 secs
lola: 62622629 markings, 101303586 edges, 208818 markings/sec, 320 secs
lola: 63620175 markings, 102800605 edges, 199509 markings/sec, 325 secs
lola: 64539667 markings, 104188078 edges, 183898 markings/sec, 330 secs
lola: 65449112 markings, 105598765 edges, 181889 markings/sec, 335 secs
lola: 66380754 markings, 107156017 edges, 186328 markings/sec, 340 secs
lola: 66980510 markings, 108162415 edges, 119951 markings/sec, 345 secs
lola: 66985606 markings, 108171128 edges, 1019 markings/sec, 350 secs
lola: 66986741 markings, 108173000 edges, 227 markings/sec, 355 secs
lola: 66989157 markings, 108176919 edges, 483 markings/sec, 360 secs
lola: 66989180 markings, 108176955 edges, 5 markings/sec, 365 secs
lola: 66991842 markings, 108181376 edges, 532 markings/sec, 370 secs
lola: 66991847 markings, 108181383 edges, 1 markings/sec, 375 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 521 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= pb2_3_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= pb2_3_2)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-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: ========================================
lola: subprocess 11 will run for 626 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pil3_5_1 <= pil2_3_5))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pil3_5_1 <= pil2_3_5)
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-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: ========================================
lola: subprocess 12 will run for 782 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= pb1_3_1)))
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 656 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 13 will run for 1043 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F ((pb3_5_1 <= pil1_5_9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (F ((pb3_5_1 <= pil1_5_9)))))
lola: processed formula: A (F (X (F ((pb3_5_1 <= pil1_5_9)))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 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: 1214 markings, 1214 edges
lola: ========================================
lola: subprocess 14 will run for 1565 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G (F ((pil1_5_1 <= pil3_5_5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (G (F ((pil1_5_1 <= pil3_5_5))))))
lola: processed formula: A (X (G (G (F ((pil1_5_1 <= pil3_5_5))))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 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: 1395 markings, 1395 edges
lola: ========================================
lola: subprocess 15 will run for 3130 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pi3_1_1 <= po3_4_5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((pi3_1_1 <= po3_4_5)))
lola: processed formula: A (F ((pi3_1_1 <= po3_4_5)))
lola: processed formula length: 28
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5046-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 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: RESULT
lola:
SUMMARY: yes no no yes no no yes no no unknown yes yes no no no yes
FORMULA TriangularGrid-PT-5046-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5046-LTLCardinality-15 TRUE 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="TriangularGrid-PT-5046"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-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/TriangularGrid-PT-5046.tgz
mv TriangularGrid-PT-5046 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-structural"
echo " Input is TriangularGrid-PT-5046, 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 r215-smll-152732267200735"
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 ;