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 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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.7K May 26 09:26 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-structural
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 r083-blw3-152649950400108
=====================================================================

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


BK_STOP 1527449079115

--------------------
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 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...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 stderr -----
----- Start make result stdout -----
CTLCardinality @ Dekker-PT-200 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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 || 489 markings, 1662 edges, 98 markings/sec, 0 secs
lola: sara is running 5 secs || 922 markings, 3326 edges, 87 markings/sec, 5 secs
lola: sara is running 10 secs || 1425 markings, 5458 edges, 101 markings/sec, 10 secs
lola: sara is running 15 secs || 2016 markings, 8039 edges, 118 markings/sec, 15 secs
lola: sara is running 20 secs || 2587 markings, 10702 edges, 114 markings/sec, 20 secs
lola: sara is running 25 secs || 3173 markings, 13364 edges, 117 markings/sec, 25 secs
lola: sara is running 30 secs || 3756 markings, 16068 edges, 117 markings/sec, 30 secs
lola: sara is running 35 secs || 4188 markings, 18025 edges, 86 markings/sec, 35 secs
lola: sara is running 40 secs || 4621 markings, 19944 edges, 87 markings/sec, 40 secs
lola: sara is running 45 secs || 5012 markings, 21972 edges, 78 markings/sec, 45 secs
lola: sara is running 50 secs || 5442 markings, 23752 edges, 86 markings/sec, 50 secs
lola: sara is running 55 secs || 5869 markings, 25532 edges, 85 markings/sec, 55 secs
lola: sara is running 60 secs || 6308 markings, 27582 edges, 88 markings/sec, 60 secs
lola: sara is running 65 secs || 6767 markings, 29840 edges, 92 markings/sec, 65 secs
lola: sara is running 70 secs || 7247 markings, 32309 edges, 96 markings/sec, 70 secs
lola: sara is running 75 secs || 7696 markings, 34634 edges, 90 markings/sec, 75 secs
lola: sara is running 80 secs || 8136 markings, 37071 edges, 88 markings/sec, 80 secs
lola: sara is running 85 secs || 8539 markings, 39192 edges, 81 markings/sec, 85 secs
lola: sara is running 90 secs || 9030 markings, 42009 edges, 98 markings/sec, 90 secs
lola: sara is running 95 secs || 9523 markings, 44511 edges, 99 markings/sec, 95 secs
lola: sara is running 100 secs || 10041 markings, 47185 edges, 104 markings/sec, 100 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 105 secs || 10548 markings, 49740 edges, 101 markings/sec, 105 secs

lola: sara is running 110 secs || 11009 markings, 51945 edges, 92 markings/sec, 110 secs
lola: sara is running 115 secs || 11520 markings, 54990 edges, 102 markings/sec, 115 secs
lola: sara is running 120 secs || 12022 markings, 57894 edges, 100 markings/sec, 120 secs
lola: sara is running 125 secs || 12530 markings, 60809 edges, 102 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
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 261 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: 21238 markings, 3704832 edges, 3689329903141912576 markings/sec, 0 secs
lola: 37883 markings, 7597439 edges, 3329 markings/sec, 5 secs
lola: 53684 markings, 11527344 edges, 3160 markings/sec, 10 secs
lola: 68742 markings, 15455367 edges, 3012 markings/sec, 15 secs
lola: 82413 markings, 19500548 edges, 2734 markings/sec, 20 secs
lola: 95177 markings, 23567104 edges, 2553 markings/sec, 25 secs
lola: 109210 markings, 27593334 edges, 2807 markings/sec, 30 secs
lola: 122820 markings, 31616384 edges, 2722 markings/sec, 35 secs
lola: 135846 markings, 35634354 edges, 2605 markings/sec, 40 secs
lola: 148014 markings, 39744303 edges, 2434 markings/sec, 45 secs
lola: 161303 markings, 43737086 edges, 2658 markings/sec, 50 secs
lola: 175528 markings, 47723293 edges, 2845 markings/sec, 55 secs
lola: 187720 markings, 51852097 edges, 2438 markings/sec, 60 secs
lola: 199519 markings, 55979698 edges, 2360 markings/sec, 65 secs
lola: 212324 markings, 60008458 edges, 2561 markings/sec, 70 secs
lola: 224972 markings, 64110647 edges, 2530 markings/sec, 75 secs
lola: 236081 markings, 68329712 edges, 2222 markings/sec, 80 secs
lola: 249647 markings, 72351988 edges, 2713 markings/sec, 85 secs
lola: 261631 markings, 76495827 edges, 2397 markings/sec, 90 secs
lola: 273236 markings, 80647293 edges, 2321 markings/sec, 95 secs
lola: 284694 markings, 84798568 edges, 2292 markings/sec, 100 secs
lola: 297788 markings, 88792761 edges, 2619 markings/sec, 105 secs
lola: 308125 markings, 93020371 edges, 2067 markings/sec, 110 secs
lola: 320046 markings, 97098748 edges, 2384 markings/sec, 115 secs
lola: 330594 markings, 101239588 edges, 2110 markings/sec, 120 secs
lola: 340928 markings, 105552243 edges, 2067 markings/sec, 125 secs
lola: 353697 markings, 109522611 edges, 2554 markings/sec, 130 secs
lola: 365894 markings, 113588713 edges, 2439 markings/sec, 135 secs
lola: 377476 markings, 117648244 edges, 2316 markings/sec, 140 secs
lola: 388336 markings, 121746142 edges, 2172 markings/sec, 145 secs
lola: 399074 markings, 125876129 edges, 2148 markings/sec, 150 secs
lola: 411995 markings, 129864022 edges, 2584 markings/sec, 155 secs
lola: 424127 markings, 133888901 edges, 2426 markings/sec, 160 secs
lola: 434981 markings, 138002415 edges, 2171 markings/sec, 165 secs
lola: 445396 markings, 142112204 edges, 2083 markings/sec, 170 secs
lola: 457731 markings, 145964016 edges, 2467 markings/sec, 175 secs
lola: 469502 markings, 149852703 edges, 2354 markings/sec, 180 secs
lola: 482331 markings, 153616994 edges, 2566 markings/sec, 185 secs
lola: 494430 markings, 157418335 edges, 2420 markings/sec, 190 secs
lola: 505194 markings, 161339525 edges, 2153 markings/sec, 195 secs
lola: 516538 markings, 165256615 edges, 2269 markings/sec, 200 secs
lola: 526554 markings, 169292390 edges, 2003 markings/sec, 205 secs
lola: 539208 markings, 173175216 edges, 2531 markings/sec, 210 secs
lola: 550580 markings, 177122469 edges, 2274 markings/sec, 215 secs
lola: 561638 markings, 181132866 edges, 2212 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 || 493 markings, 1721 edges, 99 markings/sec, 0 secs
lola: sara is running 5 secs || 986 markings, 4682 edges, 99 markings/sec, 5 secs
lola: sara is running 10 secs || 1506 markings, 7571 edges, 104 markings/sec, 10 secs
lola: sara is running 15 secs || 2039 markings, 10828 edges, 107 markings/sec, 15 secs
lola: sara is running 20 secs || 2550 markings, 14384 edges, 102 markings/sec, 20 secs
lola: sara is running 25 secs || 3082 markings, 17959 edges, 106 markings/sec, 25 secs
lola: sara is running 30 secs || 3640 markings, 21805 edges, 112 markings/sec, 30 secs
lola: sara is running 35 secs || 4154 markings, 24654 edges, 103 markings/sec, 35 secs
lola: sara is running 40 secs || 4633 markings, 28611 edges, 96 markings/sec, 40 secs
lola: sara is running 45 secs || 5142 markings, 31682 edges, 102 markings/sec, 45 secs
lola: sara is running 50 secs || 5697 markings, 36031 edges, 111 markings/sec, 50 secs
lola: sara is running 55 secs || 6206 markings, 39610 edges, 102 markings/sec, 55 secs
lola: sara is running 60 secs || 6768 markings, 42891 edges, 112 markings/sec, 60 secs
lola: sara is running 65 secs || 7341 markings, 45697 edges, 115 markings/sec, 65 secs
lola: sara is running 70 secs || 7864 markings, 49723 edges, 105 markings/sec, 70 secs
lola: sara is running 75 secs || 8404 markings, 52443 edges, 108 markings/sec, 75 secs
lola: sara is running 80 secs || 8941 markings, 55273 edges, 107 markings/sec, 80 secs
lola: sara is running 85 secs || 9428 markings, 59048 edges, 97 markings/sec, 85 secs
lola: sara is running 90 secs || 9963 markings, 63305 edges, 107 markings/sec, 90 secs
lola: sara is running 95 secs || 10537 markings, 68180 edges, 115 markings/sec, 95 secs
lola: sara is running 100 secs || 11120 markings, 73166 edges, 117 markings/sec, 100 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 105 secs || 11623 markings, 77425 edges, 101 markings/sec, 105 secs
lola: sara is running 110 secs || 12153 markings, 80348 edges, 106 markings/sec, 110 secs
lola: sara is running 115 secs || 12687 markings, 82531 edges, 107 markings/sec, 115 secs
lola: sara is running 120 secs || 13200 markings, 85881 edges, 103 markings/sec, 120 secs
lola: sara is running 125 secs || 13737 markings, 89877 edges, 107 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: 21282 markings, 3739521 edges, 3689329903141912576 markings/sec, 0 secs
lola: 37983 markings, 7664793 edges, 3340 markings/sec, 5 secs
lola: 53812 markings, 11614297 edges, 3166 markings/sec, 10 secs
lola: 68910 markings, 15562959 edges, 3020 markings/sec, 15 secs
lola: 82603 markings, 19640083 edges, 2739 markings/sec, 20 secs
lola: 95494 markings, 23742276 edges, 2578 markings/sec, 25 secs
lola: 109498 markings, 27796938 edges, 2801 markings/sec, 30 secs
lola: 123098 markings, 31832376 edges, 2720 markings/sec, 35 secs
lola: 136137 markings, 35866424 edges, 2608 markings/sec, 40 secs
lola: 148419 markings, 39986233 edges, 2456 markings/sec, 45 secs
lola: 161796 markings, 44019694 edges, 2675 markings/sec, 50 secs
lola: 175899 markings, 48026786 edges, 2821 markings/sec, 55 secs
lola: 188052 markings, 52137984 edges, 2431 markings/sec, 60 secs
lola: 199820 markings, 56259652 edges, 2354 markings/sec, 65 secs
lola: 212595 markings, 60297390 edges, 2555 markings/sec, 70 secs
lola: 225147 markings, 64395213 edges, 2510 markings/sec, 75 secs
lola: 236433 markings, 68677172 edges, 2257 markings/sec, 80 secs
lola: 250010 markings, 72711962 edges, 2715 markings/sec, 85 secs
lola: 261940 markings, 76876146 edges, 2386 markings/sec, 90 secs
lola: 273514 markings, 81036414 edges, 2315 markings/sec, 95 secs
lola: 285125 markings, 85191051 edges, 2322 markings/sec, 100 secs
lola: 298102 markings, 89195604 edges, 2595 markings/sec, 105 secs
lola: 308375 markings, 93418233 edges, 2055 markings/sec, 110 secs
lola: 320254 markings, 97486964 edges, 2376 markings/sec, 115 secs
lola: 330786 markings, 101648286 edges, 2106 markings/sec, 120 secs
lola: 340851 markings, 105867315 edges, 2013 markings/sec, 125 secs
lola: 353656 markings, 109865852 edges, 2561 markings/sec, 130 secs
lola: 365118 markings, 113676242 edges, 2292 markings/sec, 135 secs
lola: 375653 markings, 117365850 edges, 2107 markings/sec, 140 secs
lola: 385960 markings, 121229270 edges, 2061 markings/sec, 145 secs
lola: 395606 markings, 125175589 edges, 1929 markings/sec, 150 secs
lola: 407932 markings, 128911504 edges, 2465 markings/sec, 155 secs
lola: 419948 markings, 132932656 edges, 2403 markings/sec, 160 secs
lola: 431179 markings, 137000803 edges, 2246 markings/sec, 165 secs
lola: 441596 markings, 140988314 edges, 2083 markings/sec, 170 secs
lola: 452473 markings, 144842687 edges, 2175 markings/sec, 175 secs
lola: 464693 markings, 148586228 edges, 2444 markings/sec, 180 secs
lola: 476101 markings, 152417810 edges, 2282 markings/sec, 185 secs
lola: 489503 markings, 156232823 edges, 2680 markings/sec, 190 secs
lola: 500770 markings, 160185941 edges, 2253 markings/sec, 195 secs
lola: 511538 markings, 163994087 edges, 2154 markings/sec, 200 secs
lola: 521384 markings, 167806030 edges, 1969 markings/sec, 205 secs
lola: 532567 markings, 171634937 edges, 2237 markings/sec, 210 secs
lola: 544062 markings, 175310531 edges, 2299 markings/sec, 215 secs
lola: 554184 markings, 179135243 edges, 2024 markings/sec, 220 secs
lola: 564937 markings, 182883593 edges, 2151 markings/sec, 225 secs
lola: 574360 markings, 186627922 edges, 1885 markings/sec, 230 secs
lola: 583915 markings, 190424451 edges, 1911 markings/sec, 235 secs
lola: 596037 markings, 194052286 edges, 2424 markings/sec, 240 secs
lola: 607365 markings, 197778895 edges, 2266 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: 275 markings, 6497 edges, 3689329903141912576 markings/sec, 0 secs
lola: 432 markings, 13953 edges, 31 markings/sec, 5 secs
lola: 564 markings, 21127 edges, 26 markings/sec, 10 secs
lola: 681 markings, 29073 edges, 23 markings/sec, 15 secs
lola: 796 markings, 36925 edges, 23 markings/sec, 20 secs
lola: 903 markings, 44027 edges, 21 markings/sec, 25 secs
lola: 1004 markings, 51271 edges, 20 markings/sec, 30 secs
lola: 1103 markings, 58604 edges, 20 markings/sec, 35 secs
lola: 1195 markings, 65948 edges, 18 markings/sec, 40 secs
lola: 1283 markings, 72446 edges, 18 markings/sec, 45 secs
lola: 1372 markings, 79437 edges, 18 markings/sec, 50 secs
lola: 1463 markings, 87590 edges, 18 markings/sec, 55 secs
lola: 1547 markings, 97800 edges, 17 markings/sec, 60 secs
lola: 1637 markings, 104013 edges, 18 markings/sec, 65 secs
lola: 1723 markings, 112602 edges, 17 markings/sec, 70 secs
lola: 1804 markings, 119300 edges, 16 markings/sec, 75 secs
lola: 1893 markings, 127334 edges, 18 markings/sec, 80 secs
lola: 1981 markings, 137506 edges, 18 markings/sec, 85 secs
lola: 2068 markings, 145329 edges, 17 markings/sec, 90 secs
lola: 2153 markings, 153205 edges, 17 markings/sec, 95 secs
lola: 2236 markings, 163808 edges, 17 markings/sec, 100 secs
lola: 2319 markings, 171446 edges, 17 markings/sec, 105 secs
lola: 2394 markings, 178231 edges, 15 markings/sec, 110 secs
lola: 2468 markings, 186705 edges, 15 markings/sec, 115 secs
lola: 2538 markings, 193233 edges, 14 markings/sec, 120 secs
lola: 2612 markings, 200398 edges, 15 markings/sec, 125 secs
lola: 2677 markings, 207484 edges, 13 markings/sec, 130 secs
lola: 2742 markings, 215274 edges, 13 markings/sec, 135 secs
lola: 2808 markings, 220527 edges, 13 markings/sec, 140 secs
lola: 2871 markings, 227006 edges, 13 markings/sec, 145 secs
lola: 2934 markings, 234723 edges, 13 markings/sec, 150 secs
lola: 2995 markings, 242311 edges, 12 markings/sec, 155 secs
lola: 3058 markings, 247597 edges, 13 markings/sec, 160 secs
lola: 3119 markings, 254054 edges, 12 markings/sec, 165 secs
lola: 3180 markings, 260998 edges, 12 markings/sec, 170 secs
lola: 3238 markings, 270378 edges, 12 markings/sec, 175 secs
lola: 3305 markings, 276014 edges, 13 markings/sec, 180 secs
lola: 3373 markings, 282666 edges, 14 markings/sec, 185 secs
lola: 3435 markings, 290308 edges, 12 markings/sec, 190 secs
lola: 3496 markings, 297479 edges, 12 markings/sec, 195 secs
lola: 3556 markings, 302988 edges, 12 markings/sec, 200 secs
lola: 3613 markings, 309129 edges, 11 markings/sec, 205 secs
lola: 3674 markings, 316727 edges, 12 markings/sec, 210 secs
lola: 3731 markings, 323316 edges, 11 markings/sec, 215 secs
lola: 3790 markings, 328666 edges, 12 markings/sec, 220 secs
lola: 3846 markings, 335033 edges, 11 markings/sec, 225 secs
lola: 3903 markings, 342469 edges, 11 markings/sec, 230 secs
lola: 3956 markings, 351235 edges, 11 markings/sec, 235 secs
lola: 4012 markings, 355079 edges, 11 markings/sec, 240 secs
lola: 4067 markings, 361078 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 254 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 423 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-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/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-structural"
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 r083-blw3-152649950400108"
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 ;