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 25M
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 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 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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
-rw-r--r-- 1 mcc users 25M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Dekker-PT-200, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-blw3-152649949300108
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527404847004


BK_STOP 1527405895413

--------------------
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 Dekker-PT-200 as instance name.
Using Dekker as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1849053, 'Memory': 15936.07, 'Tool': 'lola'}, {'Time': 2302877, 'Memory': 13010.23, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola Dekker-PT-200...

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


checking for too many tokens
===========================================================================================
Dekker-PT-200: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ Dekker-PT-200 @ 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: 41400/65536 symbol table entries, 18535 collisions
lola: preprocessing...
lola: finding significant places
lola: 1000 places, 40400 transitions, 400 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 80600 transition conflict sets
lola: TASK
lola: reading formula from Dekker-PT-200-CTLCardinality.task
lola: (A (F (E (F ((p3_29 <= flag_1_97))))) AND A (G (((p0_75 <= p1_192) OR (flag_0_37 <= 1))))) : (((E (F ((1 <= p3_194))) AND A (X ((2 <= p0_97)))) OR (((p1_13 <= flag_0_34) OR (1 <= flag_0_157) OR ((1 <= p3_129) AND (p0_153 <= p3_189))) OR E (G ((p0_95 <= flag_0_117))))) AND ((p0_145 <= flag_0_85) AND E (((1 <= p0_139) U (3 <= p3_154))))) : E (G (E (X (((1 <= p0_9) AND (flag_1_56 <= p3_65)))))) : E (F (E (F (((3 <= p0_39) AND (3 <= flag_0_41)))))) : (A (G (A (F ((flag_1_175 <= p0_16))))) OR (E (X (((3 <= flag_1_121) OR (3 <= flag_1_90)))) OR NOT(E (F ((2 <= flag_0_133)))))) : A (G (A (X (((1 <= flag_0_183) OR (flag_1_66 <= p0_172)))))) : A (F (((flag_0_29 + 1 <= p0_32) OR (flag_0_123 + 1 <= p3_22)))) : E (G ((((p1_120 <= 1) AND ((1 <= flag_0_50) OR (p1_22 <= p3_57))) OR (2 <= p0_40)))) : E (X (A (((1 <= flag_0_102) U (3 <= flag_1_46))))) : (A (F (((flag_1_178 <= 0) OR (flag_0_14 <= 1)))) AND E (G (E (G ((p1_111 <= p3_182)))))) : E (X (NOT(E (X ((p3_127 <= p0_135)))))) : E (F (E (G ((1 <= flag_0_5))))) : E (G (NOT(A (X ((2 <= p3_79)))))) : (A (F (((flag_0_168 + 1 <= p1_36) AND (2 <= p0_8)))) AND (p1_53 <= flag_0_161)) : A (F (A (G (((p0_16 <= p1_158) AND (3 <= flag_1_88)))))) : A (F (E (X ((p0_157 + 1 <= flag_1_197)))))
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 (E (F ((p3_29 <= flag_1_97))))) AND A (G (((p0_75 <= p1_192) OR (flag_0_37 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F ((p3_29 <= flag_1_97)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (p3_29 <= flag_1_97)))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p0_75 <= p1_192) OR (flag_0_37 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-CTLCardinality.sara.
lola: sara is running 0 secs || 490 markings, 1663 edges, 98 markings/sec, 0 secs
lola: sara is running 5 secs || 981 markings, 3574 edges, 98 markings/sec, 5 secs
lola: sara is running 10 secs || 1453 markings, 5561 edges, 94 markings/sec, 10 secs
lola: sara is running 15 secs || 1908 markings, 7577 edges, 91 markings/sec, 15 secs
lola: sara is running 20 secs || 2350 markings, 9650 edges, 88 markings/sec, 20 secs
lola: sara is running 25 secs || 2804 markings, 11782 edges, 91 markings/sec, 25 secs
lola: sara is running 30 secs || 3261 markings, 13700 edges, 91 markings/sec, 30 secs
lola: sara is running 35 secs || 3730 markings, 15934 edges, 94 markings/sec, 35 secs
lola: sara is running 40 secs || 4190 markings, 18037 edges, 92 markings/sec, 40 secs
lola: sara is running 45 secs || 4660 markings, 20171 edges, 94 markings/sec, 45 secs
lola: sara is running 50 secs || 5138 markings, 22588 edges, 96 markings/sec, 50 secs
lola: sara is running 55 secs || 5612 markings, 24410 edges, 95 markings/sec, 55 secs
lola: sara is running 60 secs || 6090 markings, 26618 edges, 96 markings/sec, 60 secs
lola: sara is running 65 secs || 6585 markings, 28928 edges, 99 markings/sec, 65 secs
lola: sara is running 70 secs || 7043 markings, 31249 edges, 92 markings/sec, 70 secs
lola: sara is running 75 secs || 7492 markings, 33678 edges, 90 markings/sec, 75 secs
lola: sara is running 80 secs || 7940 markings, 35953 edges, 90 markings/sec, 80 secs
lola: sara is running 85 secs || 8385 markings, 38335 edges, 89 markings/sec, 85 secs
lola: sara is running 90 secs || 8833 markings, 40859 edges, 90 markings/sec, 90 secs
lola: sara is running 95 secs || 9282 markings, 43284 edges, 90 markings/sec, 95 secs
lola: sara is running 100 secs || 9762 markings, 45841 edges, 96 markings/sec, 100 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 105 secs || 10237 markings, 48077 edges, 95 markings/sec, 105 secs
lola: sara is running 110 secs || 10700 markings, 50637 edges, 93 markings/sec, 110 secs
lola: sara is running 115 secs || 11171 markings, 52799 edges, 94 markings/sec, 115 secs
lola: sara is running 120 secs || 11640 markings, 55734 edges, 94 markings/sec, 120 secs
lola: sara is running 125 secs || 12125 markings, 58460 edges, 97 markings/sec, 125 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 1 will run for 227 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (F ((1 <= p3_194))) AND A (X ((2 <= p0_97)))) OR (((p1_13 <= flag_0_34) OR (1 <= flag_0_157) OR ((1 <= p3_129) AND (p0_153 <= p3_189))) OR E (G ((p0_95 <= flag_0_117))))) AND ((p0_145 <= flag_0_85) AND E (((1 <= p0_139) U (3 <= p3_154)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 227 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p3_194)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-CTLCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 2 will run for 243 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= p0_97)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((2 <= p0_97)))
lola: processed formula: A (X ((2 <= p0_97)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 14 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p1_13 <= flag_0_34) OR (1 <= flag_0_157) OR ((1 <= p3_129) AND (p0_153 <= p3_189)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p1_13 <= flag_0_34) OR (1 <= flag_0_157) OR ((1 <= p3_129) AND (p0_153 <= p3_189)))
lola: processed formula length: 87
lola: 0 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: processed formula with 4 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 4 will run for 283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p0_145 <= flag_0_85)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0_145 <= flag_0_85)
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.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 5 will run for 309 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((1 <= p0_139) U (3 <= p3_154)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((1 <= p0_139) U (3 <= p3_154))
lola: processed formula length: 32
lola: 1 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 21329 markings, 3734355 edges, 3689329903141912576 markings/sec, 0 secs
lola: 38024 markings, 7635693 edges, 3339 markings/sec, 5 secs
lola: 53799 markings, 11556962 edges, 3155 markings/sec, 10 secs
lola: 68845 markings, 15477927 edges, 3009 markings/sec, 15 secs
lola: 82523 markings, 19532801 edges, 2736 markings/sec, 20 secs
lola: 95329 markings, 23608935 edges, 2561 markings/sec, 25 secs
lola: 109280 markings, 27614985 edges, 2790 markings/sec, 30 secs
lola: 122840 markings, 31623002 edges, 2712 markings/sec, 35 secs
lola: 135773 markings, 35612839 edges, 2587 markings/sec, 40 secs
lola: 147835 markings, 39695069 edges, 2412 markings/sec, 45 secs
lola: 161027 markings, 43644191 edges, 2638 markings/sec, 50 secs
lola: 175133 markings, 47608980 edges, 2821 markings/sec, 55 secs
lola: 187251 markings, 51699466 edges, 2424 markings/sec, 60 secs
lola: 198851 markings, 55795872 edges, 2320 markings/sec, 65 secs
lola: 211674 markings, 59817478 edges, 2565 markings/sec, 70 secs
lola: 224339 markings, 63896579 edges, 2533 markings/sec, 75 secs
lola: 235350 markings, 68086841 edges, 2202 markings/sec, 80 secs
lola: 248700 markings, 72086707 edges, 2670 markings/sec, 85 secs
lola: 260819 markings, 76202273 edges, 2424 markings/sec, 90 secs
lola: 272430 markings, 80309416 edges, 2322 markings/sec, 95 secs
lola: 283405 markings, 84463357 edges, 2195 markings/sec, 100 secs
lola: 296613 markings, 88411586 edges, 2642 markings/sec, 105 secs
lola: 307193 markings, 92573406 edges, 2116 markings/sec, 110 secs
lola: 318605 markings, 96640664 edges, 2282 markings/sec, 115 secs
lola: 329462 markings, 100714407 edges, 2171 markings/sec, 120 secs
lola: 339381 markings, 104893355 edges, 1984 markings/sec, 125 secs
lola: 351580 markings, 108905211 edges, 2440 markings/sec, 130 secs
lola: 363927 markings, 112900831 edges, 2469 markings/sec, 135 secs
lola: 375510 markings, 116943232 edges, 2317 markings/sec, 140 secs
lola: 386432 markings, 121002026 edges, 2184 markings/sec, 145 secs
lola: 396401 markings, 125166835 edges, 1994 markings/sec, 150 secs
lola: 409852 markings, 129119232 edges, 2690 markings/sec, 155 secs
lola: 421709 markings, 133180488 edges, 2371 markings/sec, 160 secs
lola: 433013 markings, 137259013 edges, 2261 markings/sec, 165 secs
lola: 443595 markings, 141403816 edges, 2116 markings/sec, 170 secs
lola: 455696 markings, 145414139 edges, 2420 markings/sec, 175 secs
lola: 468209 markings, 149363054 edges, 2503 markings/sec, 180 secs
lola: 481149 markings, 153247282 edges, 2588 markings/sec, 185 secs
lola: 493814 markings, 157173097 edges, 2533 markings/sec, 190 secs
lola: 504678 markings, 161215205 edges, 2173 markings/sec, 195 secs
lola: 516364 markings, 165200805 edges, 2337 markings/sec, 200 secs
lola: 526716 markings, 169333459 edges, 2070 markings/sec, 205 secs
lola: 539519 markings, 173302927 edges, 2561 markings/sec, 210 secs
lola: 551212 markings, 177379202 edges, 2339 markings/sec, 215 secs
lola: 562504 markings, 181492097 edges, 2258 markings/sec, 220 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 227 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (((1 <= p0_9) AND (flag_1_56 <= p3_65))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX(((1 <= p0_9) AND (flag_1_56 <= p3_65))))))
lola: processed formula length: 62
lola: 2 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 244 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (((3 <= p0_39) AND (3 <= flag_0_41))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-CTLCardinality-3.sara.
lola: sara is running 0 secs || 453 markings, 1521 edges, 91 markings/sec, 0 secs
lola: sara is running 5 secs || 909 markings, 4135 edges, 91 markings/sec, 5 secs
lola: sara is running 10 secs || 1382 markings, 7145 edges, 95 markings/sec, 10 secs
lola: sara is running 15 secs || 1846 markings, 9509 edges, 93 markings/sec, 15 secs
lola: sara is running 20 secs || 2313 markings, 12960 edges, 93 markings/sec, 20 secs
lola: sara is running 25 secs || 2802 markings, 15813 edges, 98 markings/sec, 25 secs
lola: sara is running 30 secs || 3278 markings, 19506 edges, 95 markings/sec, 30 secs
lola: sara is running 35 secs || 3751 markings, 22169 edges, 95 markings/sec, 35 secs
lola: sara is running 40 secs || 4208 markings, 25103 edges, 91 markings/sec, 40 secs
lola: sara is running 45 secs || 4650 markings, 28697 edges, 88 markings/sec, 45 secs
lola: sara is running 50 secs || 5092 markings, 31328 edges, 88 markings/sec, 50 secs
lola: sara is running 55 secs || 5535 markings, 35019 edges, 89 markings/sec, 55 secs
lola: sara is running 60 secs || 6004 markings, 38114 edges, 94 markings/sec, 60 secs
lola: sara is running 65 secs || 6503 markings, 41828 edges, 100 markings/sec, 65 secs
lola: sara is running 70 secs || 6987 markings, 43767 edges, 97 markings/sec, 70 secs
lola: sara is running 75 secs || 7450 markings, 46464 edges, 93 markings/sec, 75 secs
lola: sara is running 80 secs || 7909 markings, 50078 edges, 92 markings/sec, 80 secs
lola: sara is running 85 secs || 8348 markings, 52193 edges, 88 markings/sec, 85 secs
lola: sara is running 90 secs || 8801 markings, 54362 edges, 91 markings/sec, 90 secs
lola: sara is running 95 secs || 9275 markings, 57776 edges, 95 markings/sec, 95 secs
lola: sara is running 100 secs || 9755 markings, 61587 edges, 96 markings/sec, 100 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 105 secs || 10204 markings, 65425 edges, 90 markings/sec, 105 secs
lola: sara is running 110 secs || 10654 markings, 69100 edges, 90 markings/sec, 110 secs
lola: sara is running 115 secs || 11113 markings, 73111 edges, 92 markings/sec, 115 secs
lola: sara is running 120 secs || 11589 markings, 77184 edges, 95 markings/sec, 120 secs
lola: sara is running 125 secs || 12075 markings, 80111 edges, 97 markings/sec, 125 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((flag_1_175 <= p0_16))))) OR (E (X (((3 <= flag_1_121) OR (3 <= flag_1_90)))) OR NOT(E (F ((2 <= flag_0_133))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((flag_1_175 <= p0_16)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (flag_1_175 <= p0_16)))))
lola: processed formula length: 51
lola: 5 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 21279 markings, 3738720 edges, 3689329903141912576 markings/sec, 0 secs
lola: 37972 markings, 7663283 edges, 3339 markings/sec, 5 secs
lola: 53723 markings, 11593446 edges, 3150 markings/sec, 10 secs
lola: 68918 markings, 15565559 edges, 3039 markings/sec, 15 secs
lola: 82695 markings, 19664319 edges, 2755 markings/sec, 20 secs
lola: 95648 markings, 23783337 edges, 2591 markings/sec, 25 secs
lola: 109614 markings, 27837802 edges, 2793 markings/sec, 30 secs
lola: 123268 markings, 31892555 edges, 2731 markings/sec, 35 secs
lola: 136282 markings, 35918053 edges, 2603 markings/sec, 40 secs
lola: 148620 markings, 40033174 edges, 2468 markings/sec, 45 secs
lola: 162268 markings, 44151301 edges, 2730 markings/sec, 50 secs
lola: 176770 markings, 48316195 edges, 2900 markings/sec, 55 secs
lola: 188999 markings, 52447832 edges, 2446 markings/sec, 60 secs
lola: 200930 markings, 56584702 edges, 2386 markings/sec, 65 secs
lola: 213728 markings, 60634453 edges, 2560 markings/sec, 70 secs
lola: 226119 markings, 64756098 edges, 2478 markings/sec, 75 secs
lola: 237235 markings, 68962830 edges, 2223 markings/sec, 80 secs
lola: 250906 markings, 72978175 edges, 2734 markings/sec, 85 secs
lola: 262656 markings, 77153185 edges, 2350 markings/sec, 90 secs
lola: 274254 markings, 81289610 edges, 2320 markings/sec, 95 secs
lola: 285933 markings, 85423139 edges, 2336 markings/sec, 100 secs
lola: 298807 markings, 89441899 edges, 2575 markings/sec, 105 secs
lola: 309074 markings, 93689589 edges, 2053 markings/sec, 110 secs
lola: 320972 markings, 97741256 edges, 2380 markings/sec, 115 secs
lola: 331356 markings, 101905090 edges, 2077 markings/sec, 120 secs
lola: 341521 markings, 106107484 edges, 2033 markings/sec, 125 secs
lola: 354444 markings, 110093780 edges, 2585 markings/sec, 130 secs
lola: 366483 markings, 114159826 edges, 2408 markings/sec, 135 secs
lola: 377876 markings, 118198326 edges, 2279 markings/sec, 140 secs
lola: 388678 markings, 122285322 edges, 2160 markings/sec, 145 secs
lola: 399609 markings, 126421207 edges, 2186 markings/sec, 150 secs
lola: 412548 markings, 130438546 edges, 2588 markings/sec, 155 secs
lola: 424662 markings, 134495644 edges, 2423 markings/sec, 160 secs
lola: 435504 markings, 138643666 edges, 2168 markings/sec, 165 secs
lola: 446019 markings, 142820752 edges, 2103 markings/sec, 170 secs
lola: 459054 markings, 146774346 edges, 2607 markings/sec, 175 secs
lola: 470983 markings, 150798928 edges, 2386 markings/sec, 180 secs
lola: 484275 markings, 154656970 edges, 2658 markings/sec, 185 secs
lola: 496696 markings, 158649341 edges, 2484 markings/sec, 190 secs
lola: 507921 markings, 162694964 edges, 2245 markings/sec, 195 secs
lola: 519076 markings, 166752693 edges, 2231 markings/sec, 200 secs
lola: 530350 markings, 170878812 edges, 2255 markings/sec, 205 secs
lola: 542842 markings, 174889064 edges, 2498 markings/sec, 210 secs
lola: 553968 markings, 179046884 edges, 2225 markings/sec, 215 secs
lola: 565617 markings, 183148463 edges, 2330 markings/sec, 220 secs
lola: 575896 markings, 187265292 edges, 2056 markings/sec, 225 secs
lola: 586686 markings, 191157148 edges, 2158 markings/sec, 230 secs
lola: 598352 markings, 194951367 edges, 2333 markings/sec, 235 secs
lola: 610316 markings, 198878667 edges, 2393 markings/sec, 240 secs
lola: 621291 markings, 202955727 edges, 2195 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X (((1 <= flag_0_183) OR (flag_1_66 <= p0_172))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX(((1 <= flag_0_183) OR (flag_1_66 <= p0_172))))))
lola: processed formula length: 69
lola: 2 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 290 markings, 7051 edges, 3689329903141912576 markings/sec, 0 secs
lola: 452 markings, 14728 edges, 32 markings/sec, 5 secs
lola: 590 markings, 22452 edges, 28 markings/sec, 10 secs
lola: 714 markings, 30653 edges, 25 markings/sec, 15 secs
lola: 832 markings, 39058 edges, 24 markings/sec, 20 secs
lola: 944 markings, 47290 edges, 22 markings/sec, 25 secs
lola: 1050 markings, 55467 edges, 21 markings/sec, 30 secs
lola: 1153 markings, 62514 edges, 21 markings/sec, 35 secs
lola: 1253 markings, 69752 edges, 20 markings/sec, 40 secs
lola: 1347 markings, 77173 edges, 19 markings/sec, 45 secs
lola: 1437 markings, 85474 edges, 18 markings/sec, 50 secs
lola: 1526 markings, 94878 edges, 18 markings/sec, 55 secs
lola: 1614 markings, 102151 edges, 18 markings/sec, 60 secs
lola: 1700 markings, 110199 edges, 17 markings/sec, 65 secs
lola: 1786 markings, 117991 edges, 17 markings/sec, 70 secs
lola: 1870 markings, 125018 edges, 17 markings/sec, 75 secs
lola: 1951 markings, 133687 edges, 16 markings/sec, 80 secs
lola: 2031 markings, 142330 edges, 16 markings/sec, 85 secs
lola: 2111 markings, 148993 edges, 16 markings/sec, 90 secs
lola: 2189 markings, 157564 edges, 16 markings/sec, 95 secs
lola: 2264 markings, 167704 edges, 15 markings/sec, 100 secs
lola: 2342 markings, 173241 edges, 16 markings/sec, 105 secs
lola: 2417 markings, 180755 edges, 15 markings/sec, 110 secs
lola: 2490 markings, 189991 edges, 15 markings/sec, 115 secs
lola: 2564 markings, 195545 edges, 15 markings/sec, 120 secs
lola: 2637 markings, 202654 edges, 15 markings/sec, 125 secs
lola: 2707 markings, 211008 edges, 14 markings/sec, 130 secs
lola: 2778 markings, 217811 edges, 14 markings/sec, 135 secs
lola: 2848 markings, 224639 edges, 14 markings/sec, 140 secs
lola: 2916 markings, 232534 edges, 14 markings/sec, 145 secs
lola: 2982 markings, 241883 edges, 13 markings/sec, 150 secs
lola: 3050 markings, 247167 edges, 14 markings/sec, 155 secs
lola: 3116 markings, 253718 edges, 13 markings/sec, 160 secs
lola: 3182 markings, 261333 edges, 13 markings/sec, 165 secs
lola: 3245 markings, 270525 edges, 13 markings/sec, 170 secs
lola: 3310 markings, 276207 edges, 13 markings/sec, 175 secs
lola: 3373 markings, 282666 edges, 13 markings/sec, 180 secs
lola: 3436 markings, 290309 edges, 13 markings/sec, 185 secs
lola: 3497 markings, 297529 edges, 12 markings/sec, 190 secs
lola: 3559 markings, 303283 edges, 12 markings/sec, 195 secs
lola: 3620 markings, 309927 edges, 12 markings/sec, 200 secs
lola: 3680 markings, 317636 edges, 12 markings/sec, 205 secs
lola: 3740 markings, 323921 edges, 12 markings/sec, 210 secs
lola: 3799 markings, 329533 edges, 12 markings/sec, 215 secs
lola: 3857 markings, 336455 edges, 12 markings/sec, 220 secs
lola: 3915 markings, 344058 edges, 12 markings/sec, 225 secs
lola: 3971 markings, 351701 edges, 11 markings/sec, 230 secs
lola: 4027 markings, 357015 edges, 11 markings/sec, 235 secs
lola: 4082 markings, 363540 edges, 11 markings/sec, 240 secs
lola: 4138 markings, 369616 edges, 11 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((flag_0_29 + 1 <= p0_32) OR (flag_0_123 + 1 <= p3_22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((flag_0_29 + 1 <= p0_32) OR (flag_0_123 + 1 <= p3_22))))
lola: processed formula: A (F (((flag_0_29 + 1 <= p0_32) OR (flag_0_123 + 1 <= p3_22))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 15 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 7 will run for 282 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((p1_120 <= 1) AND ((1 <= flag_0_50) OR (p1_22 <= p3_57))) OR (2 <= p0_40))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((2 <= p1_120) OR ((flag_0_50 <= 0) AND (p3_57 + 1 <= p1_22))) AND (p0_40 <= 1))))
lola: processed formula length: 97
lola: 2 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 317 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (((1 <= flag_0_102) U (3 <= flag_1_46)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A((1 <= flag_0_102) U (3 <= flag_1_46)))
lola: processed formula length: 43
lola: 2 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 836 markings, 1034 edges
lola: ========================================
lola: subprocess 9 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((flag_1_178 <= 0) OR (flag_0_14 <= 1)))) AND E (G (E (G ((p1_111 <= p3_182))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((flag_1_178 <= 0) OR (flag_0_14 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((flag_1_178 <= 0) OR (flag_0_14 <= 1))))
lola: processed formula: A (F (((flag_1_178 <= 0) OR (flag_0_14 <= 1))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 15 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 10 will run for 423 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((p1_111 <= p3_182)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (p3_182 + 1 <= p1_111))))
lola: processed formula length: 47
lola: 4 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 422 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(E (X ((p3_127 <= p0_135))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX((p0_135 + 1 <= p3_127)))
lola: processed formula length: 30
lola: 5 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 507 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((1 <= flag_0_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (flag_0_5 <= 0))))
lola: processed formula length: 40
lola: 3 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 6 edges
lola: ========================================
lola: subprocess 12 will run for 634 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (X ((2 <= p3_79))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((p3_79 <= 1)))))
lola: processed formula length: 36
lola: 5 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 13 will run for 845 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((flag_0_168 + 1 <= p1_36) AND (2 <= p0_8)))) AND (p1_53 <= flag_0_161))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 845 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((flag_0_168 + 1 <= p1_36) AND (2 <= p0_8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((flag_0_168 + 1 <= p1_36) AND (2 <= p0_8))))
lola: processed formula: A (F (((flag_0_168 + 1 <= p1_36) AND (2 <= p0_8))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 15 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: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((p0_16 <= p1_158) AND (3 <= flag_1_88))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (((p0_16 <= p1_158) AND (3 <= flag_1_88))))))
lola: processed formula: A (F (A (G (((p0_16 <= p1_158) AND (3 <= flag_1_88))))))
lola: processed formula length: 56
lola: 0 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 14 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: 6 markings, 7 edges
lola: ========================================
lola: subprocess 15 will run for 2535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((p0_157 + 1 <= flag_1_197)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((p0_157 + 1 <= flag_1_197)))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5 markings, 5 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown yes no unknown unknown no yes no yes no yes yes no no no
FORMULA Dekker-PT-200-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-200"
export BK_EXAMINATION="CTLCardinality"
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/Dekker-PT-200.tgz
mv Dekker-PT-200 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 Dekker-PT-200, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r082-blw3-152649949300108"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;