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 348K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.2K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 174K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is HexagonalGrid-PT-226, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r214-smll-152732265300267
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527450181928


BK_STOP 1527450464464

--------------------
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 HexagonalGrid-PT-226 as instance name.
Using HexagonalGrid 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': 204594, 'Memory': 4424.99, 'Tool': 'itstools'}, {'Time': 707386, 'Memory': 5823.95, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 3.4575109729513085x far from the best tool itstools.
LTLCardinality lola HexagonalGrid-PT-226...

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


checking for too many tokens
===========================================================================================
HexagonalGrid-PT-226: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ HexagonalGrid-PT-226 @ 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: 439/65536 symbol table entries, 9 collisions
lola: preprocessing...
lola: finding significant places
lola: 169 places, 270 transitions, 101 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 337 transition conflict sets
lola: TASK
lola: reading formula from HexagonalGrid-PT-226-LTLCardinality.task
lola: A (G (X (X (G ((1 <= po1_3_2)))))) : A (X ((G ((pi3_3_1 <= pb4_2_2)) U (1 <= pil1_3_2)))) : A (X ((G ((po1_1_1 <= pi3_1_2)) U F ((3 <= pil1_1_2))))) : A ((3 <= pb5_2_2)) : A (F ((pil4_2_1 <= po5_1_1))) : A ((pi5_1_1 <= po4_3_1)) : A ((pb3_3_1 <= pb1_2_1)) : A (G ((1 <= pil6_2_1))) : A (F (F (F (G ((3 <= po6_2_1)))))) : A (F (F (G (X ((1 <= pb5_2_3)))))) : A (G (F ((pi2_2_3 <= pol5_2_1)))) : A (X ((F ((pil3_2_1 <= pi2_3_1)) U G ((1 <= pol2_2_1))))) : A ((pol2_1_1 <= pb3_1_2)) : A ((3 <= pil1_3_1)) : A ((po1_3_2 <= po2_2_2)) : A (X (((pol3_2_1 <= pb5_1_1) U (pil1_2_1 <= pi2_2_3))))
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 (G (X (X (G ((1 <= po1_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (X (G ((1 <= po1_3_2))))))
lola: processed formula: A (G (X (X (G ((1 <= po1_3_2))))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 586 markings, 586 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((pi3_3_1 <= pb4_2_2)) U (1 <= pil1_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G ((pi3_3_1 <= pb4_2_2)) U (1 <= pil1_3_2))))
lola: processed formula: A (X ((G ((pi3_3_1 <= pb4_2_2)) U (1 <= pil1_3_2))))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 417062 markings, 2290321 edges, 83412 markings/sec, 0 secs
lola: 813189 markings, 4232911 edges, 79225 markings/sec, 5 secs
lola: 884901 markings, 6252997 edges, 14342 markings/sec, 10 secs
lola: 936550 markings, 8433372 edges, 10330 markings/sec, 15 secs
lola: 1451043 markings, 10968405 edges, 102899 markings/sec, 20 secs
lola: 1715568 markings, 13071548 edges, 52905 markings/sec, 25 secs
lola: 1721295 markings, 14976442 edges, 1145 markings/sec, 30 secs
lola: 1931216 markings, 17458479 edges, 41984 markings/sec, 35 secs
lola: 2199837 markings, 20053691 edges, 53724 markings/sec, 40 secs
lola: 2715604 markings, 22337606 edges, 103153 markings/sec, 45 secs
lola: 2885333 markings, 24620447 edges, 33946 markings/sec, 50 secs
lola: 2888616 markings, 26728997 edges, 657 markings/sec, 55 secs
lola: 3286029 markings, 28610219 edges, 79483 markings/sec, 60 secs
lola: 3585414 markings, 30435940 edges, 59877 markings/sec, 65 secs
lola: 3595847 markings, 32154622 edges, 2087 markings/sec, 70 secs
lola: 3598005 markings, 33751938 edges, 432 markings/sec, 75 secs
lola: 3916171 markings, 35757018 edges, 63633 markings/sec, 80 secs
lola: 4356919 markings, 37460303 edges, 88150 markings/sec, 85 secs
lola: 4760360 markings, 39022453 edges, 80688 markings/sec, 90 secs
lola: 5132045 markings, 40550989 edges, 74337 markings/sec, 95 secs
lola: 5482263 markings, 42062378 edges, 70044 markings/sec, 100 secs
lola: 5818380 markings, 43566625 edges, 67223 markings/sec, 105 secs
lola: 6140615 markings, 45055454 edges, 64447 markings/sec, 110 secs
lola: 6452339 markings, 46531009 edges, 62345 markings/sec, 115 secs
lola: 6756113 markings, 48002248 edges, 60755 markings/sec, 120 secs
lola: 7018465 markings, 49299168 edges, 52470 markings/sec, 125 secs
lola: 7267126 markings, 50550195 edges, 49732 markings/sec, 130 secs
lola: 7523917 markings, 51873811 edges, 51358 markings/sec, 135 secs
lola: 7779998 markings, 53213133 edges, 51216 markings/sec, 140 secs
lola: 8031659 markings, 54557437 edges, 50332 markings/sec, 145 secs
lola: 8283280 markings, 55912683 edges, 50324 markings/sec, 150 secs
lola: 8529095 markings, 57268743 edges, 49163 markings/sec, 155 secs
lola: 8771891 markings, 58630781 edges, 48559 markings/sec, 160 secs
lola: 9011421 markings, 60000899 edges, 47906 markings/sec, 165 secs
lola: 9238647 markings, 61323605 edges, 45445 markings/sec, 170 secs
lola: 9475836 markings, 62735079 edges, 47438 markings/sec, 175 secs
lola: 9707117 markings, 64145653 edges, 46256 markings/sec, 180 secs
lola: 9933248 markings, 65554278 edges, 45226 markings/sec, 185 secs
lola: 10157619 markings, 66990098 edges, 44874 markings/sec, 190 secs
lola: 10377797 markings, 68428578 edges, 44036 markings/sec, 195 secs
lola: 10593166 markings, 69888375 edges, 43074 markings/sec, 200 secs
lola: 10805220 markings, 71365042 edges, 42411 markings/sec, 205 secs
lola: 11012267 markings, 72859847 edges, 41409 markings/sec, 210 secs
lola: 11211539 markings, 74359331 edges, 39854 markings/sec, 215 secs
lola: 11407658 markings, 75881591 edges, 39224 markings/sec, 220 secs
lola: 11595487 markings, 77423477 edges, 37566 markings/sec, 225 secs
lola: 11742245 markings, 79021916 edges, 29352 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((po1_1_1 <= pi3_1_2)) U F ((3 <= pil1_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G ((po1_1_1 <= pi3_1_2)) U F ((3 <= pil1_1_2)))))
lola: processed formula: A (X ((G ((po1_1_1 <= pi3_1_2)) U F ((3 <= pil1_1_2)))))
lola: processed formula length: 56
lola: 0 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 586 markings, 586 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= pb5_2_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= pb5_2_2)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-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 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pil4_2_1 <= po5_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((pil4_2_1 <= po5_1_1)))
lola: processed formula: A (F ((pil4_2_1 <= po5_1_1)))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 672 markings, 673 edges
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pi5_1_1 <= po4_3_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pi5_1_1 <= po4_3_1)
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-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 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pb3_3_1 <= pb1_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pb3_3_1 <= pb1_2_1)
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-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 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= pil6_2_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 404 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (G ((3 <= po6_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((3 <= po6_2_1))))
lola: processed formula: A (F (G ((3 <= po6_2_1))))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 635 markings, 636 edges
lola: ========================================
lola: subprocess 9 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (X ((1 <= pb5_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((1 <= pb5_2_3)))))
lola: processed formula: A (F (G (X ((1 <= pb5_2_3)))))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 587 markings, 588 edges
lola: ========================================
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((pi2_2_3 <= pol5_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((pi2_2_3 <= pol5_2_1))))
lola: processed formula: A (G (F ((pi2_2_3 <= pol5_2_1))))
lola: processed formula length: 33
lola: 0 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 2032 markings, 4458 edges
lola: ========================================
lola: subprocess 11 will run for 660 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((pil3_2_1 <= pi2_3_1)) U G ((1 <= pol2_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((F ((pil3_2_1 <= pi2_3_1)) U G ((1 <= pol2_2_1)))))
lola: processed formula: A (X ((F ((pil3_2_1 <= pi2_3_1)) U G ((1 <= pol2_2_1)))))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 1403 markings, 1404 edges
lola: ========================================
lola: subprocess 12 will run for 825 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pol2_1_1 <= pb3_1_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pol2_1_1 <= pb3_1_2)
lola: processed formula length: 21
lola: 1 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-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 13 will run for 1101 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= pil1_3_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= pil1_3_1)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-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 14 will run for 1651 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((po1_3_2 <= po2_2_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (po1_3_2 <= po2_2_2)
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-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 15 will run for 3303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((pol3_2_1 <= pb5_1_1) U (pil1_2_1 <= pi2_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((pol3_2_1 <= pb5_1_1) U (pil1_2_1 <= pi2_2_3))))
lola: processed formula: A (X (((pol3_2_1 <= pb5_1_1) U (pil1_2_1 <= pi2_2_3))))
lola: processed formula length: 55
lola: 0 rewrites
lola: formula mentions 0 of 169 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-226-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 408 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: 862 markings, 862 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no no no yes yes no no no no no yes no yes no
FORMULA HexagonalGrid-PT-226-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-226-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="HexagonalGrid-PT-226"
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/HexagonalGrid-PT-226.tgz
mv HexagonalGrid-PT-226 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 HexagonalGrid-PT-226, 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-152732265300267"
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 ;