fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r070-smll-152649743100318
Last Updated
June 26, 2018

About the Execution of M4M.full for DNAwalker-PT-14ringLRLarge

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4747.500 1085888.00 1579923.00 3603.10 TTTFTFT?TT?TFFFF normal

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 304K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 14 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 135K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DNAwalker-PT-14ringLRLarge, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-152649743100318
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526766957394


BK_STOP 1526768043282

--------------------
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 DNAwalker-PT-14ringLRLarge as instance name.
Using DNAwalker 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': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': None, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 106551, 'Memory': 9315.71, 'Tool': 'marcie'}, {'Time': 107924, 'Memory': 9315.71, 'Tool': 'marcie'}, {'Time': 579061, 'Memory': 3653.06, 'Tool': 'itstools'}, {'Time': 582713, 'Memory': 3651.28, 'Tool': 'itstools'}, {'Time': 1245549, 'Memory': 6552.77, 'Tool': 'lola'}, {'Time': 1245633, 'Memory': 6789.11, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 11.689697891150717x far from the best tool marcie.
CTLCardinality lola DNAwalker-PT-14ringLRLarge...

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


checking for too many tokens
===========================================================================================
DNAwalker-PT-14ringLRLarge: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ DNAwalker-PT-14ringLRLarge @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 345/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 33 places, 312 transitions, 33 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 197 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: NOT(NOT(E (G (((1 <= B3) OR (1 <= A5)))))) : NOT(NOT(E (G (((1 <= A20) OR (1 <= A12)))))) : (E (G (((1 <= A16) OR (A9 <= A23)))) OR (3 <= B3)) : (A (X ((A26 <= B26))) OR ((A (F ((2 <= A15))) OR ((A8 + 1 <= A15) OR (B26 <= 0))) AND (((B27 <= 0) AND (A6 <= 1)) OR E (G ((A19 <= A11)))))) : A ((((A10 <= A19) OR (A20 + 1 <= A24)) U ((A1 <= 2) AND (A1 + 1 <= A4)))) : A (G (E (F ((A8 <= A13))))) : E (X (E (G (((2 <= A25) OR (A4 <= A10)))))) : E (((A14 <= 1) U E (G ((3 <= A27))))) : E (G (NOT(A (X ((A12 <= A16)))))) : E (G ((A (G ((2 <= A19))) OR (((A1 <= A6) OR (A26 <= A7)) AND (A16 <= B26))))) : E (F (((A15 <= B26) AND ((3 <= A25) OR (3 <= A24)) AND (1 <= A7)))) : ((NOT(A (F ((3 <= A21)))) AND E (F (((A21 <= A7) AND (2 <= A27))))) AND (A (X ((A15 + 1 <= A10))) OR (E (F ((A27 <= A21))) OR A (G ((A25 <= B2)))))) : E (F (((A24 <= 2) AND (A22 <= 0)))) : ((B13 <= A3) OR A (F (((1 <= A8) AND (3 <= A13) AND (B27 <= 0))))) : A (G ((A (G ((3 <= A16))) OR E (F ((1 <= A2)))))) : A (F (A (G ((A9 <= A8)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (G (((1 <= B3) OR (1 <= A5))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((B3 <= 0) AND (A5 <= 0))))
lola: processed formula length: 40
lola: 8 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (G (((1 <= A20) OR (1 <= A12))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((A20 <= 0) AND (A12 <= 0))))
lola: processed formula length: 42
lola: 8 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((1 <= A16) OR (A9 <= A23)))) OR (3 <= B3))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= A16) OR (A9 <= A23))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((A16 <= 0) AND (A23 + 1 <= A9))))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 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: 13 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X ((A26 <= B26))) OR ((A (F ((2 <= A15))) OR ((A8 + 1 <= A15) OR (B26 <= 0))) AND (((B27 <= 0) AND (A6 <= 1)) OR E (G ((A19 <= A11))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((A26 <= B26)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((A26 <= B26)))
lola: processed formula: A (X ((A26 <= B26)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 34 markings, 34 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= A15)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= A15)))
lola: processed formula: A (F ((2 <= A15)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 9 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A8 + 1 <= A15) OR (B26 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((A8 + 1 <= A15) OR (B26 <= 0))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((A10 <= A19) OR (A20 + 1 <= A24)) U ((A1 <= 2) AND (A1 + 1 <= A4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((A10 <= A19) OR (A20 + 1 <= A24)) U ((A1 <= 2) AND (A1 + 1 <= A4))))
lola: processed formula: A ((((A10 <= A19) OR (A20 + 1 <= A24)) U ((A1 <= 2) AND (A1 + 1 <= A4))))
lola: processed formula length: 74
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1471 markings, 1470 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((A8 <= A13)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (A8 <= A13)))))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 152591 markings, 686229 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (((2 <= A25) OR (A4 <= A10))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U ((A25 <= 1) AND (A10 + 1 <= A4)))))
lola: processed formula length: 51
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 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: 12 markings, 12 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((A14 <= 1) U E (G ((3 <= A27)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((A14 <= 1) U NOT(A(TRUE U (A27 <= 2))))
lola: processed formula length: 41
lola: 3 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 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: 881309 markings, 3873126 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1622960 markings, 7361562 edges, 148330 markings/sec, 5 secs
lola: 2301930 markings, 11101315 edges, 135794 markings/sec, 10 secs
lola: 3110472 markings, 14600799 edges, 161708 markings/sec, 15 secs
lola: 3791727 markings, 18257540 edges, 136251 markings/sec, 20 secs
lola: 4358365 markings, 21909209 edges, 113328 markings/sec, 25 secs
lola: 4902374 markings, 25279194 edges, 108802 markings/sec, 30 secs
lola: 5473163 markings, 29085182 edges, 114158 markings/sec, 35 secs
lola: 5932175 markings, 32707112 edges, 91802 markings/sec, 40 secs
lola: 6548453 markings, 36405273 edges, 123256 markings/sec, 45 secs
lola: 7039984 markings, 39934980 edges, 98306 markings/sec, 50 secs
lola: 7611106 markings, 43401684 edges, 114224 markings/sec, 55 secs
lola: 8119128 markings, 47086772 edges, 101604 markings/sec, 60 secs
lola: 8506946 markings, 50270157 edges, 77564 markings/sec, 65 secs
lola: 8941876 markings, 53882902 edges, 86986 markings/sec, 70 secs
lola: 9438386 markings, 57685320 edges, 99302 markings/sec, 75 secs
lola: 9962204 markings, 61214753 edges, 104764 markings/sec, 80 secs
lola: 10532112 markings, 64741018 edges, 113982 markings/sec, 85 secs
lola: 10973502 markings, 68347492 edges, 88278 markings/sec, 90 secs
lola: 11402549 markings, 72025902 edges, 85809 markings/sec, 95 secs
lola: 11849392 markings, 75431603 edges, 89369 markings/sec, 100 secs
lola: 12291565 markings, 78826787 edges, 88435 markings/sec, 105 secs
lola: 12691844 markings, 82214267 edges, 80056 markings/sec, 110 secs
lola: 13043342 markings, 85581934 edges, 70300 markings/sec, 115 secs
lola: 13624821 markings, 89382895 edges, 116296 markings/sec, 120 secs
lola: 14294940 markings, 92870245 edges, 134024 markings/sec, 125 secs
lola: 14934307 markings, 96172113 edges, 127873 markings/sec, 130 secs
lola: 15488425 markings, 99199147 edges, 110824 markings/sec, 135 secs
lola: 16121430 markings, 102994741 edges, 126601 markings/sec, 140 secs
lola: 16682667 markings, 106511923 edges, 112247 markings/sec, 145 secs
lola: 17200150 markings, 109789980 edges, 103497 markings/sec, 150 secs
lola: 17760802 markings, 113511036 edges, 112130 markings/sec, 155 secs
lola: 18223516 markings, 116820921 edges, 92543 markings/sec, 160 secs
lola: 18701200 markings, 120520465 edges, 95537 markings/sec, 165 secs
lola: 19324265 markings, 123926348 edges, 124613 markings/sec, 170 secs
lola: 19968879 markings, 127277973 edges, 128923 markings/sec, 175 secs
lola: 20563225 markings, 130352505 edges, 118869 markings/sec, 180 secs
lola: 21121543 markings, 133510079 edges, 111664 markings/sec, 185 secs
lola: 21645878 markings, 137184744 edges, 104867 markings/sec, 190 secs
lola: 22133027 markings, 140688147 edges, 97430 markings/sec, 195 secs
lola: 22588323 markings, 143919606 edges, 91059 markings/sec, 200 secs
lola: 22991851 markings, 146883928 edges, 80706 markings/sec, 205 secs
lola: 23498617 markings, 150315267 edges, 101353 markings/sec, 210 secs
lola: 24047435 markings, 153830981 edges, 109764 markings/sec, 215 secs
lola: 24517403 markings, 156791534 edges, 93994 markings/sec, 220 secs
lola: 24978544 markings, 160537661 edges, 92228 markings/sec, 225 secs
lola: 25394235 markings, 164056982 edges, 83138 markings/sec, 230 secs
lola: 25751859 markings, 167014052 edges, 71525 markings/sec, 235 secs
lola: 26234666 markings, 170455476 edges, 96561 markings/sec, 240 secs
lola: 26709050 markings, 173751264 edges, 94877 markings/sec, 245 secs
lola: 27150721 markings, 177292385 edges, 88334 markings/sec, 250 secs
lola: 27559729 markings, 180942886 edges, 81802 markings/sec, 255 secs
lola: 27901347 markings, 184071334 edges, 68324 markings/sec, 260 secs
lola: 28348529 markings, 187708551 edges, 89436 markings/sec, 265 secs
lola: 28735167 markings, 191304631 edges, 77328 markings/sec, 270 secs
lola: 29064040 markings, 194637437 edges, 65775 markings/sec, 275 secs
lola: 29594183 markings, 198150148 edges, 106029 markings/sec, 280 secs
lola: 30075898 markings, 201544244 edges, 96343 markings/sec, 285 secs
lola: 30499386 markings, 204547152 edges, 84698 markings/sec, 290 secs
lola: 30968331 markings, 208225056 edges, 93789 markings/sec, 295 secs
lola: 31346247 markings, 211222845 edges, 75583 markings/sec, 300 secs
lola: 31754482 markings, 214735098 edges, 81647 markings/sec, 305 secs
lola: 32125773 markings, 218131778 edges, 74258 markings/sec, 310 secs
lola: 32495232 markings, 220832222 edges, 73892 markings/sec, 315 secs
lola: 33030387 markings, 224571045 edges, 107031 markings/sec, 320 secs
lola: 33431867 markings, 227475148 edges, 80296 markings/sec, 325 secs
lola: 33863834 markings, 231054373 edges, 86393 markings/sec, 330 secs
lola: 34242095 markings, 234503986 edges, 75652 markings/sec, 335 secs
lola: 34550766 markings, 237359720 edges, 61734 markings/sec, 340 secs
lola: 34881740 markings, 240085332 edges, 66195 markings/sec, 345 secs
lola: 35303159 markings, 243586796 edges, 84284 markings/sec, 350 secs
lola: 35655630 markings, 246734143 edges, 70494 markings/sec, 355 secs
lola: 35977634 markings, 250102042 edges, 64401 markings/sec, 360 secs
lola: 36268059 markings, 252827798 edges, 58085 markings/sec, 365 secs
lola: 36657169 markings, 256251328 edges, 77822 markings/sec, 370 secs
lola: 37019284 markings, 259913987 edges, 72423 markings/sec, 375 secs
lola: 37298042 markings, 262979042 edges, 55752 markings/sec, 380 secs
lola: 37617874 markings, 266136377 edges, 63966 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (X ((A12 <= A16))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((A16 + 1 <= A12)))))
lola: processed formula length: 40
lola: 5 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (G ((2 <= A19))) OR (((A1 <= A6) OR (A26 <= A7)) AND (A16 <= B26)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (E(TRUE U (A19 <= 1)) AND (((A6 + 1 <= A1) AND (A7 + 1 <= A26)) OR (B26 + 1 <= A16)))))
lola: processed formula length: 101
lola: 6 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 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: 16 markings, 32 edges
lola: ========================================
lola: subprocess 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((A15 <= B26) AND ((3 <= A25) OR (3 <= A24)) AND (1 <= A7))))
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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-14ringLRLarge-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-14ringLRLarge-CTLCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 417782 markings, 847078 edges, 83556 markings/sec, 0 secs
lola: sara is running 5 secs || 798929 markings, 2079131 edges, 76229 markings/sec, 5 secs
lola: sara is running 10 secs || 1173276 markings, 3220467 edges, 74869 markings/sec, 10 secs
lola: sara is running 15 secs || 1508107 markings, 4441417 edges, 66966 markings/sec, 15 secs
lola: sara is running 20 secs || 1901312 markings, 5586815 edges, 78641 markings/sec, 20 secs
lola: sara is running 25 secs || 2227560 markings, 6861083 edges, 65250 markings/sec, 25 secs
lola: sara is running 30 secs || 2542308 markings, 8035562 edges, 62950 markings/sec, 30 secs
lola: sara is running 35 secs || 2893490 markings, 9024042 edges, 70236 markings/sec, 35 secs
lola: sara is running 40 secs || 3219898 markings, 10319811 edges, 65282 markings/sec, 40 secs
lola: sara is running 45 secs || 3544971 markings, 11651072 edges, 65015 markings/sec, 45 secs
lola: sara is running 50 secs || 3906519 markings, 12692187 edges, 72310 markings/sec, 50 secs
lola: sara is running 55 secs || 4249570 markings, 14021385 edges, 68610 markings/sec, 55 secs
lola: sara is running 60 secs || 4537862 markings, 15285552 edges, 57658 markings/sec, 60 secs
lola: sara is running 65 secs || 4871340 markings, 16394436 edges, 66696 markings/sec, 65 secs
lola: sara is running 70 secs || 5246614 markings, 17362174 edges, 75055 markings/sec, 70 secs
lola: sara is running 75 secs || 5617862 markings, 18632408 edges, 74250 markings/sec, 75 secs
lola: sara is running 80 secs || 5976112 markings, 19870369 edges, 71650 markings/sec, 80 secs
lola: sara is running 85 secs || 6309049 markings, 20945780 edges, 66587 markings/sec, 85 secs
lola: sara is running 90 secs || 6669257 markings, 22165675 edges, 72042 markings/sec, 90 secs
lola: sara is running 95 secs || 7010907 markings, 23427673 edges, 68330 markings/sec, 95 secs
lola: sara is running 100 secs || 7316728 markings, 24713474 edges, 61164 markings/sec, 100 secs
lola: sara is running 105 secs || 7612627 markings, 25954400 edges, 59180 markings/sec, 105 secs
lola: sara is running 110 secs || 7950793 markings, 26952095 edges, 67633 markings/sec, 110 secs
lola: sara is running 115 secs || 8267081 markings, 28194229 edges, 63258 markings/sec, 115 secs
lola: sara is running 120 secs || 8575087 markings, 29588464 edges, 61601 markings/sec, 120 secs
lola: sara is running 125 secs || 8859527 markings, 30836358 edges, 56888 markings/sec, 125 secs
lola: sara is running 130 secs || 9143393 markings, 31997453 edges, 56773 markings/sec, 130 secs
lola: sara is running 135 secs || 9411010 markings, 33368751 edges, 53523 markings/sec, 135 secs
lola: sara is running 140 secs || 9679807 markings, 34684834 edges, 53759 markings/sec, 140 secs
lola: sara is running 145 secs || 9962407 markings, 35876213 edges, 56520 markings/sec, 145 secs
lola: sara is running 150 secs || 10240249 markings, 37168929 edges, 55568 markings/sec, 150 secs
lola: sara is running 155 secs || 10505266 markings, 38542820 edges, 53003 markings/sec, 155 secs
lola: sara is running 160 secs || 10799051 markings, 39644488 edges, 58757 markings/sec, 160 secs
lola: sara is running 165 secs || 11062991 markings, 41016380 edges, 52788 markings/sec, 165 secs
lola: sara is running 170 secs || 11339487 markings, 42207286 edges, 55299 markings/sec, 170 secs
lola: sara is running 175 secs || 11616107 markings, 43421347 edges, 55324 markings/sec, 175 secs
lola: sara is running 180 secs || 11964746 markings, 44495134 edges, 69728 markings/sec, 180 secs
lola: sara is running 185 secs || 12335166 markings, 45517846 edges, 74084 markings/sec, 185 secs
lola: sara is running 190 secs || 12691480 markings, 46771428 edges, 71263 markings/sec, 190 secs
lola: sara is running 195 secs || 13031607 markings, 48127422 edges, 68025 markings/sec, 195 secs
lola: sara is running 200 secs || 13371943 markings, 49483917 edges, 68067 markings/sec, 200 secs
lola: sara is running 205 secs || 13718676 markings, 50621533 edges, 69347 markings/sec, 205 secs
lola: sara is running 210 secs || 14043043 markings, 51902111 edges, 64873 markings/sec, 210 secs
lola: sara is running 215 secs || 14352447 markings, 53151600 edges, 61881 markings/sec, 215 secs
lola: sara is running 220 secs || 14690061 markings, 54342866 edges, 67523 markings/sec, 220 secs
lola: sara is running 225 secs || 15012699 markings, 55655857 edges, 64528 markings/sec, 225 secs
lola: sara is running 230 secs || 15303131 markings, 56964334 edges, 58086 markings/sec, 230 secs
lola: sara is running 235 secs || 15614100 markings, 58152439 edges, 62194 markings/sec, 235 secs
lola: sara is running 240 secs || 15932023 markings, 59328340 edges, 63585 markings/sec, 240 secs
lola: sara is running 245 secs || 16255867 markings, 60534277 edges, 64769 markings/sec, 245 secs
lola: sara is running 250 secs || 16542690 markings, 61756759 edges, 57365 markings/sec, 250 secs
lola: sara is running 255 secs || 16827105 markings, 62918709 edges, 56883 markings/sec, 255 secs
lola: sara is running 260 secs || 17102782 markings, 64155860 edges, 55135 markings/sec, 260 secs
lola: sara is running 265 secs || 17395702 markings, 65395602 edges, 58584 markings/sec, 265 secs
lola: sara is running 270 secs || 17676453 markings, 66569840 edges, 56150 markings/sec, 270 secs
lola: sara is running 275 secs || 17987852 markings, 67774836 edges, 62280 markings/sec, 275 secs
lola: sara is running 280 secs || 18281232 markings, 69006232 edges, 58676 markings/sec, 280 secs
lola: sara is running 285 secs || 18554726 markings, 70215542 edges, 54699 markings/sec, 285 secs
lola: sara is running 290 secs || 18861749 markings, 71429165 edges, 61405 markings/sec, 290 secs
lola: sara is running 295 secs || 19178755 markings, 72597217 edges, 63401 markings/sec, 295 secs
lola: sara is running 300 secs || 19460194 markings, 73662926 edges, 56288 markings/sec, 300 secs
lola: sara is running 305 secs || 19727426 markings, 74854189 edges, 53446 markings/sec, 305 secs
lola: sara is running 310 secs || 19984093 markings, 76182501 edges, 51333 markings/sec, 310 secs
lola: sara is running 315 secs || 20233441 markings, 77651021 edges, 49870 markings/sec, 315 secs
lola: sara is running 320 secs || 20508558 markings, 79084395 edges, 55023 markings/sec, 320 secs
lola: sara is running 325 secs || 20796759 markings, 80474368 edges, 57640 markings/sec, 325 secs
lola: sara is running 330 secs || 21064214 markings, 81904682 edges, 53491 markings/sec, 330 secs
lola: sara is running 335 secs || 21359929 markings, 83283034 edges, 59143 markings/sec, 335 secs
lola: sara is running 340 secs || 21626478 markings, 84634065 edges, 53310 markings/sec, 340 secs
lola: sara is running 345 secs || 21877434 markings, 86144543 edges, 50191 markings/sec, 345 secs
lola: sara is running 350 secs || 22139031 markings, 87680027 edges, 52319 markings/sec, 350 secs
lola: sara is running 355 secs || 22428815 markings, 88970243 edges, 57957 markings/sec, 355 secs
lola: sara is running 360 secs || 22718077 markings, 90252927 edges, 57852 markings/sec, 360 secs
lola: sara is running 365 secs || 23022365 markings, 91516325 edges, 60858 markings/sec, 365 secs
lola: sara is running 370 secs || 23322075 markings, 92753806 edges, 59942 markings/sec, 370 secs
lola: sara is running 375 secs || 23609711 markings, 93961081 edges, 57527 markings/sec, 375 secs
lola: sara is running 380 secs || 23882803 markings, 95194477 edges, 54618 markings/sec, 380 secs
lola: sara is running 385 secs || 24178143 markings, 96370219 edges, 59068 markings/sec, 385 secs
lola: sara is running 390 secs || 24478903 markings, 97604879 edges, 60152 markings/sec, 390 secs
lola: sara is running 395 secs || 24763613 markings, 98814544 edges, 56942 markings/sec, 395 secs
lola: sara is running 400 secs || 25048110 markings, 100025923 edges, 56899 markings/sec, 400 secs
lola: sara is running 405 secs || 25337544 markings, 101226229 edges, 57887 markings/sec, 405 secs
lola: sara is running 410 secs || 25605026 markings, 102498525 edges, 53496 markings/sec, 410 secs
lola: sara is running 415 secs || 25865691 markings, 103923587 edges, 52133 markings/sec, 415 secs
lola: sara is running 420 secs || 26134836 markings, 105364675 edges, 53829 markings/sec, 420 secs
lola: sara is running 425 secs || 26411820 markings, 106785349 edges, 55397 markings/sec, 425 secs
lola: sara is running 430 secs || 26679671 markings, 108188816 edges, 53570 markings/sec, 430 secs
lola: sara is running 435 secs || 26943810 markings, 109587232 edges, 52828 markings/sec, 435 secs
lola: sara is running 440 secs || 27215714 markings, 110958262 edges, 54381 markings/sec, 440 secs
lola: sara is running 445 secs || 27503512 markings, 112215114 edges, 57560 markings/sec, 445 secs
lola: sara is running 450 secs || 27799199 markings, 113470738 edges, 59137 markings/sec, 450 secs
lola: sara is running 455 secs || 28070496 markings, 114674435 edges, 54259 markings/sec, 455 secs
lola: sara is running 460 secs || 28374436 markings, 115795683 edges, 60788 markings/sec, 460 secs
lola: sara is running 465 secs || 28656425 markings, 116945883 edges, 56398 markings/sec, 465 secs
lola: sara is running 470 secs || 28953894 markings, 118192990 edges, 59494 markings/sec, 470 secs
lola: sara is running 475 secs || 29254351 markings, 119443949 edges, 60091 markings/sec, 475 secs
lola: sara is running 480 secs || 29504367 markings, 120860931 edges, 50003 markings/sec, 480 secs
lola: sara is running 485 secs || 29758471 markings, 122226787 edges, 50821 markings/sec, 485 secs
lola: sara is running 490 secs || 30027967 markings, 123628460 edges, 53899 markings/sec, 490 secs
lola: sara is running 495 secs || 30313994 markings, 124986624 edges, 57205 markings/sec, 495 secs
lola: sara is running 500 secs || 30602706 markings, 126221604 edges, 57742 markings/sec, 500 secs
lola: sara is running 505 secs || 30893628 markings, 127460400 edges, 58184 markings/sec, 505 secs
lola: sara is running 510 secs || 31167014 markings, 128686328 edges, 54677 markings/sec, 510 secs
lola: sara is running 515 secs || 31431530 markings, 129895902 edges, 52903 markings/sec, 515 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(A (F ((3 <= A21)))) AND E (F (((A21 <= A7) AND (2 <= A27))))) AND (A (X ((A15 + 1 <= A10))) OR (E (F ((A27 <= A21))) OR A (G ((A25 <= B2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A21 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= A21)))
lola: processed formula length: 25
lola: 6 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 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: 13 markings, 13 edges
lola: ========================================
lola: subprocess 12 will run for 655 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((A21 <= A7) AND (2 <= A27))))
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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-14ringLRLarge-CTLCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 13 will run for 874 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((A15 + 1 <= A10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((A15 + 1 <= A10)))
lola: processed formula: A (X ((A15 + 1 <= A10)))
lola: processed formula length: 24
lola: 4 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13 markings, 13 edges
lola: ========================================
lola: subprocess 14 will run for 1311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A27 <= A21)))
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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
state equation: write sara problem file to DNAwalker-PT-14ringLRLarge-CTLCardinality-14.sara
lola: ========================================
lola: subprocess 12 will run for 655 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((A24 <= 2) AND (A22 <= 0))))
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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to DNAwalker-PT-14ringLRLarge-CTLCardinality-12.sara
lola: ========================================
lola: subprocess 13 will run for 874 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((B13 <= A3) OR A (F (((1 <= A8) AND (3 <= A13) AND (B27 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 874 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (B13 <= A3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (B13 <= A3)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= A8) AND (3 <= A13) AND (B27 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((1 <= A8) AND (3 <= A13) AND (B27 <= 0))))
lola: processed formula: A (F (((1 <= A8) AND (3 <= A13) AND (B27 <= 0))))
lola: processed formula length: 49
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 9 markings, 9 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((3 <= A16))) OR E (F ((1 <= A2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (E(TRUE U (A16 <= 2)) AND NOT(E(TRUE U (1 <= A2))))))
lola: processed formula length: 66
lola: 6 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 965834 markings, 3411911 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1807347 markings, 6646461 edges, 168303 markings/sec, 5 secs
lola: 2616360 markings, 9497050 edges, 161803 markings/sec, 10 secs
lola: 3371955 markings, 12835177 edges, 151119 markings/sec, 15 secs
lola: 4007557 markings, 16339405 edges, 127120 markings/sec, 20 secs
lola: 4645146 markings, 19698263 edges, 127518 markings/sec, 25 secs
lola: 5277836 markings, 23122222 edges, 126538 markings/sec, 30 secs
lola: 5842324 markings, 26381897 edges, 112898 markings/sec, 35 secs
lola: 6343322 markings, 29701470 edges, 100200 markings/sec, 40 secs
lola: 7039134 markings, 33336275 edges, 139162 markings/sec, 45 secs
lola: 7610766 markings, 36535465 edges, 114326 markings/sec, 50 secs
lola: 8130589 markings, 39636515 edges, 103965 markings/sec, 55 secs
lola: 8578676 markings, 42984240 edges, 89617 markings/sec, 60 secs
lola: 9077468 markings, 46451974 edges, 99758 markings/sec, 65 secs
lola: 9486284 markings, 49554950 edges, 81763 markings/sec, 70 secs
lola: 10012814 markings, 53123653 edges, 105306 markings/sec, 75 secs
lola: 10628605 markings, 56471936 edges, 123158 markings/sec, 80 secs
lola: 11173050 markings, 59945937 edges, 108889 markings/sec, 85 secs
lola: 11641310 markings, 63279291 edges, 93652 markings/sec, 90 secs
lola: 12073436 markings, 66557460 edges, 86425 markings/sec, 95 secs
lola: 12552195 markings, 69601607 edges, 95752 markings/sec, 100 secs
lola: 12992305 markings, 72839099 edges, 88022 markings/sec, 105 secs
lola: 13383120 markings, 76074278 edges, 78163 markings/sec, 110 secs
lola: 13765816 markings, 79251318 edges, 76539 markings/sec, 115 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 13952265 markings, 81110465 edges
lola: ========================================
lola: subprocess 15 will run for 2499 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((A9 <= A8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((A9 <= A8)))))
lola: processed formula: A (F (A (G ((A9 <= A8)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 33 places; total mentions: 0
lola: closed formula file DNAwalker-PT-14ringLRLarge-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 16 markings, 20 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes no yes unknown yes yes unknown yes no no no no
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-14ringLRLarge-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="DNAwalker-PT-14ringLRLarge"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-14ringLRLarge.tgz
mv DNAwalker-PT-14ringLRLarge execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is DNAwalker-PT-14ringLRLarge, 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 r070-smll-152649743100318"
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 ;