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 irma4mcc-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 r078-blw3-152649945700108
=====================================================================

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


BK_STOP 1527056077483

--------------------
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 @ 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 || 651 markings, 2295 edges, 130 markings/sec, 0 secs
lola: sara is running 5 secs || 1312 markings, 5023 edges, 132 markings/sec, 5 secs
lola: sara is running 10 secs || 1966 markings, 7793 edges, 131 markings/sec, 10 secs
lola: sara is running 15 secs || 2624 markings, 10899 edges, 132 markings/sec, 15 secs
lola: sara is running 20 secs || 3231 markings, 13568 edges, 121 markings/sec, 20 secs
lola: sara is running 25 secs || 3780 markings, 16178 edges, 110 markings/sec, 25 secs
lola: sara is running 30 secs || 4425 markings, 19090 edges, 129 markings/sec, 30 secs
lola: sara is running 35 secs || 5037 markings, 22069 edges, 122 markings/sec, 35 secs
lola: sara is running 40 secs || 5598 markings, 24364 edges, 112 markings/sec, 40 secs
lola: sara is running 45 secs || 6200 markings, 27064 edges, 120 markings/sec, 45 secs
lola: sara is running 50 secs || 6752 markings, 29783 edges, 110 markings/sec, 50 secs
lola: sara is running 55 secs || 7310 markings, 32587 edges, 112 markings/sec, 55 secs
lola: sara is running 60 secs || 7926 markings, 35888 edges, 123 markings/sec, 60 secs
lola: sara is running 65 secs || 8556 markings, 39297 edges, 126 markings/sec, 65 secs
lola: sara is running 70 secs || 9198 markings, 42853 edges, 128 markings/sec, 70 secs
lola: sara is running 75 secs || 9802 markings, 46004 edges, 121 markings/sec, 75 secs
lola: sara is running 80 secs || 10424 markings, 49028 edges, 124 markings/sec, 80 secs
lola: sara is running 85 secs || 10994 markings, 51890 edges, 114 markings/sec, 85 secs
lola: sara is running 90 secs || 11549 markings, 55141 edges, 111 markings/sec, 90 secs
lola: sara is running 95 secs || 12129 markings, 58500 edges, 116 markings/sec, 95 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 100 secs || 12726 markings, 61911 edges, 119 markings/sec, 100 secs

lola: sara is running 105 secs || 13302 markings, 65136 edges, 115 markings/sec, 105 secs
lola: sara is running 110 secs || 13914 markings, 68496 edges, 122 markings/sec, 110 secs
lola: sara is running 115 secs || 14501 markings, 71525 edges, 117 markings/sec, 115 secs
lola: sara is running 120 secs || 15092 markings, 74642 edges, 118 markings/sec, 120 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: 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 284 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 310 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: 22039 markings, 3859871 edges, 3689330178019819520 markings/sec, 0 secs
lola: 38988 markings, 7907787 edges, 3390 markings/sec, 5 secs
lola: 55412 markings, 11958594 edges, 3285 markings/sec, 10 secs
lola: 70687 markings, 16037728 edges, 3055 markings/sec, 15 secs
lola: 84656 markings, 20213400 edges, 2794 markings/sec, 20 secs
lola: 98253 markings, 24390832 edges, 2719 markings/sec, 25 secs
lola: 112200 markings, 28566268 edges, 2789 markings/sec, 30 secs
lola: 126373 markings, 32653768 edges, 2835 markings/sec, 35 secs
lola: 139216 markings, 36829793 edges, 2569 markings/sec, 40 secs
lola: 152655 markings, 40961772 edges, 2688 markings/sec, 45 secs
lola: 165924 markings, 45120186 edges, 2654 markings/sec, 50 secs
lola: 179930 markings, 49262198 edges, 2801 markings/sec, 55 secs
lola: 192273 markings, 53487609 edges, 2469 markings/sec, 60 secs
lola: 205071 markings, 57669395 edges, 2560 markings/sec, 65 secs
lola: 217958 markings, 61872657 edges, 2577 markings/sec, 70 secs
lola: 230067 markings, 66130629 edges, 2422 markings/sec, 75 secs
lola: 243020 markings, 70316679 edges, 2591 markings/sec, 80 secs
lola: 256298 markings, 74511163 edges, 2656 markings/sec, 85 secs
lola: 268164 markings, 78773120 edges, 2373 markings/sec, 90 secs
lola: 279191 markings, 83101378 edges, 2205 markings/sec, 95 secs
lola: 292787 markings, 87197394 edges, 2719 markings/sec, 100 secs
lola: 304657 markings, 91447720 edges, 2374 markings/sec, 105 secs
lola: 316008 markings, 95663654 edges, 2270 markings/sec, 110 secs
lola: 327445 markings, 99880802 edges, 2287 markings/sec, 115 secs
lola: 337704 markings, 104205475 edges, 2052 markings/sec, 120 secs
lola: 349940 markings, 108368383 edges, 2447 markings/sec, 125 secs
lola: 362727 markings, 112481686 edges, 2557 markings/sec, 130 secs
lola: 374644 markings, 116646637 edges, 2383 markings/sec, 135 secs
lola: 385972 markings, 120848058 edges, 2266 markings/sec, 140 secs
lola: 396335 markings, 125131254 edges, 2073 markings/sec, 145 secs
lola: 410033 markings, 129184781 edges, 2740 markings/sec, 150 secs
lola: 422420 markings, 133368867 edges, 2477 markings/sec, 155 secs
lola: 433943 markings, 137591143 edges, 2305 markings/sec, 160 secs
lola: 444774 markings, 141883148 edges, 2166 markings/sec, 165 secs
lola: 457774 markings, 145973855 edges, 2600 markings/sec, 170 secs
lola: 470257 markings, 150087918 edges, 2497 markings/sec, 175 secs
lola: 483953 markings, 154095376 edges, 2739 markings/sec, 180 secs
lola: 496771 markings, 158178763 edges, 2564 markings/sec, 185 secs
lola: 508356 markings, 162340094 edges, 2317 markings/sec, 190 secs
lola: 519755 markings, 166531070 edges, 2280 markings/sec, 195 secs
lola: 531619 markings, 170756843 edges, 2373 markings/sec, 200 secs
lola: 544474 markings, 174897179 edges, 2571 markings/sec, 205 secs
lola: 555878 markings, 179166640 edges, 2281 markings/sec, 210 secs
lola: 567686 markings, 183385506 edges, 2362 markings/sec, 215 secs
lola: 578242 markings, 187670751 edges, 2111 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 || 609 markings, 2325 edges, 122 markings/sec, 0 secs
lola: sara is running 5 secs || 1212 markings, 6384 edges, 121 markings/sec, 5 secs
lola: sara is running 10 secs || 1767 markings, 8968 edges, 111 markings/sec, 10 secs
lola: sara is running 15 secs || 2292 markings, 12809 edges, 105 markings/sec, 15 secs
lola: sara is running 20 secs || 2813 markings, 15897 edges, 104 markings/sec, 20 secs
lola: sara is running 25 secs || 3410 markings, 20621 edges, 119 markings/sec, 25 secs
lola: sara is running 30 secs || 3985 markings, 23414 edges, 115 markings/sec, 30 secs
lola: sara is running 35 secs || 4531 markings, 27881 edges, 109 markings/sec, 35 secs
lola: sara is running 40 secs || 5032 markings, 30913 edges, 100 markings/sec, 40 secs
lola: sara is running 45 secs || 5571 markings, 35200 edges, 108 markings/sec, 45 secs
lola: sara is running 50 secs || 6124 markings, 38947 edges, 111 markings/sec, 50 secs
lola: sara is running 55 secs || 6700 markings, 42609 edges, 115 markings/sec, 55 secs
lola: sara is running 60 secs || 7306 markings, 45493 edges, 121 markings/sec, 60 secs
lola: sara is running 65 secs || 7916 markings, 50159 edges, 122 markings/sec, 65 secs
lola: sara is running 70 secs || 8559 markings, 53040 edges, 129 markings/sec, 70 secs
lola: sara is running 75 secs || 9202 markings, 57196 edges, 129 markings/sec, 75 secs
lola: sara is running 80 secs || 9825 markings, 62112 edges, 125 markings/sec, 80 secs
lola: sara is running 85 secs || 10473 markings, 67698 edges, 130 markings/sec, 85 secs
lola: sara is running 90 secs || 11105 markings, 73041 edges, 126 markings/sec, 90 secs
lola: sara is running 95 secs || 11743 markings, 78450 edges, 128 markings/sec, 95 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 100 secs || 12372 markings, 81175 edges, 126 markings/sec, 100 secs
lola: sara is running 105 secs || 12968 markings, 84160 edges, 119 markings/sec, 105 secs
lola: sara is running 110 secs || 13598 markings, 88908 edges, 126 markings/sec, 110 secs
lola: sara is running 115 secs || 14229 markings, 94097 edges, 126 markings/sec, 115 secs
lola: sara is running 120 secs || 14866 markings, 98281 edges, 127 markings/sec, 120 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 254 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 254 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: 21877 markings, 3858392 edges, 3689330178019819520 markings/sec, 0 secs
lola: 38934 markings, 7930631 edges, 3411 markings/sec, 5 secs
lola: 55329 markings, 11994535 edges, 3279 markings/sec, 10 secs
lola: 70705 markings, 16112954 edges, 3075 markings/sec, 15 secs
lola: 84754 markings, 20333046 edges, 2810 markings/sec, 20 secs
lola: 98437 markings, 24541316 edges, 2737 markings/sec, 25 secs
lola: 112407 markings, 28747354 edges, 2794 markings/sec, 30 secs
lola: 126670 markings, 32872941 edges, 2853 markings/sec, 35 secs
lola: 139557 markings, 37106017 edges, 2577 markings/sec, 40 secs
lola: 153203 markings, 41271738 edges, 2729 markings/sec, 45 secs
lola: 166709 markings, 45459153 edges, 2701 markings/sec, 50 secs
lola: 180699 markings, 49648768 edges, 2798 markings/sec, 55 secs
lola: 192813 markings, 53899545 edges, 2423 markings/sec, 60 secs
lola: 205629 markings, 58015251 edges, 2563 markings/sec, 65 secs
lola: 218519 markings, 62261624 edges, 2578 markings/sec, 70 secs
lola: 230630 markings, 66579822 edges, 2422 markings/sec, 75 secs
lola: 243663 markings, 70761810 edges, 2607 markings/sec, 80 secs
lola: 256946 markings, 75010307 edges, 2657 markings/sec, 85 secs
lola: 268967 markings, 79327198 edges, 2404 markings/sec, 90 secs
lola: 279996 markings, 83707178 edges, 2206 markings/sec, 95 secs
lola: 293823 markings, 87845415 edges, 2765 markings/sec, 100 secs
lola: 305590 markings, 92162625 edges, 2353 markings/sec, 105 secs
lola: 317257 markings, 96451003 edges, 2333 markings/sec, 110 secs
lola: 328700 markings, 100728391 edges, 2289 markings/sec, 115 secs
lola: 339067 markings, 105103249 edges, 2073 markings/sec, 120 secs
lola: 351720 markings, 109299145 edges, 2531 markings/sec, 125 secs
lola: 364397 markings, 113424119 edges, 2535 markings/sec, 130 secs
lola: 375935 markings, 117469387 edges, 2308 markings/sec, 135 secs
lola: 386547 markings, 121429637 edges, 2122 markings/sec, 140 secs
lola: 397046 markings, 125815706 edges, 2100 markings/sec, 145 secs
lola: 410476 markings, 129759110 edges, 2686 markings/sec, 150 secs
lola: 422939 markings, 133938825 edges, 2493 markings/sec, 155 secs
lola: 434449 markings, 138222456 edges, 2302 markings/sec, 160 secs
lola: 445601 markings, 142642501 edges, 2230 markings/sec, 165 secs
lola: 458629 markings, 146647180 edges, 2606 markings/sec, 170 secs
lola: 470634 markings, 150684267 edges, 2401 markings/sec, 175 secs
lola: 484048 markings, 154603274 edges, 2683 markings/sec, 180 secs
lola: 496538 markings, 158592168 edges, 2498 markings/sec, 185 secs
lola: 507815 markings, 162654140 edges, 2255 markings/sec, 190 secs
lola: 519015 markings, 166727395 edges, 2240 markings/sec, 195 secs
lola: 530298 markings, 170861647 edges, 2257 markings/sec, 200 secs
lola: 542809 markings, 174877001 edges, 2502 markings/sec, 205 secs
lola: 553922 markings, 179027324 edges, 2223 markings/sec, 210 secs
lola: 565602 markings, 183142010 edges, 2336 markings/sec, 215 secs
lola: 576034 markings, 187313809 edges, 2086 markings/sec, 220 secs
lola: 587487 markings, 191379632 edges, 2291 markings/sec, 225 secs
lola: 599871 markings, 195373312 edges, 2477 markings/sec, 230 secs
lola: 611674 markings, 199373538 edges, 2361 markings/sec, 235 secs
lola: 622186 markings, 203209299 edges, 2102 markings/sec, 240 secs
lola: 635227 markings, 207159894 edges, 2608 markings/sec, 245 secs
lola: Child process aborted or communication problem between parent and child process
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 254 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: 282 markings, 6842 edges, 3689330178019819520 markings/sec, 0 secs
lola: 446 markings, 14375 edges, 33 markings/sec, 5 secs
lola: 593 markings, 22775 edges, 29 markings/sec, 10 secs
lola: 723 markings, 31123 edges, 26 markings/sec, 15 secs
lola: 845 markings, 39852 edges, 24 markings/sec, 20 secs
lola: 962 markings, 48455 edges, 23 markings/sec, 25 secs
lola: 1074 markings, 56766 edges, 22 markings/sec, 30 secs
lola: 1180 markings, 65392 edges, 21 markings/sec, 35 secs
lola: 1283 markings, 72446 edges, 21 markings/sec, 40 secs
lola: 1380 markings, 79885 edges, 19 markings/sec, 45 secs
lola: 1474 markings, 88789 edges, 19 markings/sec, 50 secs
lola: 1565 markings, 98666 edges, 18 markings/sec, 55 secs
lola: 1656 markings, 105928 edges, 18 markings/sec, 60 secs
lola: 1746 markings, 114932 edges, 18 markings/sec, 65 secs
lola: 1834 markings, 121809 edges, 18 markings/sec, 70 secs
lola: 1920 markings, 129844 edges, 17 markings/sec, 75 secs
lola: 2001 markings, 140213 edges, 16 markings/sec, 80 secs
lola: 2085 markings, 146687 edges, 17 markings/sec, 85 secs
lola: 2166 markings, 155085 edges, 16 markings/sec, 90 secs
lola: 2246 markings, 164994 edges, 16 markings/sec, 95 secs
lola: 2326 markings, 172261 edges, 16 markings/sec, 100 secs
lola: 2404 markings, 179266 edges, 16 markings/sec, 105 secs
lola: 2480 markings, 188484 edges, 15 markings/sec, 110 secs
lola: 2555 markings, 195096 edges, 15 markings/sec, 115 secs
lola: 2630 markings, 201968 edges, 15 markings/sec, 120 secs
lola: 2703 markings, 210726 edges, 15 markings/sec, 125 secs
lola: 2776 markings, 217627 edges, 15 markings/sec, 130 secs
lola: 2849 markings, 224828 edges, 15 markings/sec, 135 secs
lola: 2923 markings, 233448 edges, 15 markings/sec, 140 secs
lola: 2994 markings, 242169 edges, 14 markings/sec, 145 secs
lola: 3067 markings, 248505 edges, 15 markings/sec, 150 secs
lola: 3137 markings, 256116 edges, 14 markings/sec, 155 secs
lola: 3206 markings, 265035 edges, 14 markings/sec, 160 secs
lola: 3274 markings, 272731 edges, 14 markings/sec, 165 secs
lola: 3342 markings, 279244 edges, 14 markings/sec, 170 secs
lola: 3411 markings, 287114 edges, 14 markings/sec, 175 secs
lola: 3473 markings, 296187 edges, 12 markings/sec, 180 secs
lola: 3535 markings, 301152 edges, 12 markings/sec, 185 secs
lola: 3594 markings, 307264 edges, 12 markings/sec, 190 secs
lola: 3654 markings, 314275 edges, 12 markings/sec, 195 secs
lola: 3711 markings, 322259 edges, 11 markings/sec, 200 secs
lola: 3769 markings, 326792 edges, 12 markings/sec, 205 secs
lola: 3827 markings, 333137 edges, 12 markings/sec, 210 secs
lola: 3882 markings, 339313 edges, 11 markings/sec, 215 secs
lola: 3938 markings, 347574 edges, 11 markings/sec, 220 secs
lola: 3996 markings, 353791 edges, 12 markings/sec, 225 secs
lola: 4050 markings, 359194 edges, 11 markings/sec, 230 secs
lola: 4105 markings, 365557 edges, 11 markings/sec, 235 secs
lola: 4157 markings, 372082 edges, 10 markings/sec, 240 secs
lola: 4206 markings, 381278 edges, 10 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 318 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 363 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 363 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 424 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 424 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 508 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 636 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 848 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 848 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 1271 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 2542 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 stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-200"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-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 irma4mcc-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 r078-blw3-152649945700108"
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 ;