About the Execution of M4M.struct for DNAwalker-PT-11ringRR
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4804.200 | 1118642.00 | 1083838.00 | 4104.40 | FFTF?FFFTTFFTFT? | 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 284K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.6K 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 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 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.7K 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 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 112K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is DNAwalker-PT-11ringRR, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-152649744200298
=====================================================================
--------------------
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-11ringRR-CTLFireability-00
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-01
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-02
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-03
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-04
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-05
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-06
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-07
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-08
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-09
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-10
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-11
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-12
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-13
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-14
FORMULA_NAME DNAwalker-PT-11ringRR-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1526753100536
BK_STOP 1526754219178
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DNAwalker-PT-11ringRR as instance name.
Using DNAwalker as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLFireability', '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': 10376, 'Memory': 7547.88, 'Tool': 'marcie'}, {'Time': 11661, 'Memory': 7547.88, 'Tool': 'marcie'}, {'Time': 31921, 'Memory': 879.62, 'Tool': 'itstools'}, {'Time': 33118, 'Memory': 899.52, 'Tool': 'itstools'}, {'Time': 1581782, 'Memory': 4518.41, 'Tool': 'lola'}, {'Time': 1612989, 'Memory': 4517.45, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 152.44622205088666x far from the best tool marcie.
CTLFireability lola DNAwalker-PT-11ringRR...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
DNAwalker-PT-11ringRR: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
DNAwalker-PT-11ringRR: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ DNAwalker-PT-11ringRR @ 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: 287/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 27 places, 260 transitions, 27 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 163 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-11ringRR-CTLFireability.task
lola: (A ((A (F (FIREABLE(t21_17))) U ((FIREABLE(t9_11) OR FIREABLE(t1_21)) AND (FIREABLE(t2_18) OR FIREABLE(t6_2))))) AND ((NOT(E (X (FIREABLE(t19_13)))) OR (FIREABLE(t18_2) AND FIREABLE(t2_12))) OR (FIREABLE(t9_6) OR FIREABLE(t11_12) OR FIREABLE(t18_20) OR FIREABLE(t21_3) OR FIREABLE(t12_11) OR FIREABLE(tAb20) OR (FIREABLE(t9_1) AND FIREABLE(t3_5)) OR FIREABLE(t13_3)))) : (A (F (FIREABLE(t11_1))) AND A (X (((NOT FIREABLE(t21_6) OR NOT FIREABLE(t21_4)) OR A (F (FIREABLE(tAb13))))))) : E (G ((NOT FIREABLE(t10_1) OR NOT FIREABLE(tb21) OR FIREABLE(t14_12) OR ((NOT FIREABLE(t20_4) OR NOT FIREABLE(t10_13)) AND FIREABLE(t6_1))))) : (A (F ((FIREABLE(t12_13) OR A (G (FIREABLE(t1_2)))))) OR FIREABLE(t6_9)) : ((A (X ((FIREABLE(t9_11) OR FIREABLE(t13_5) OR (FIREABLE(t21_3) AND FIREABLE(t13_4))))) OR FIREABLE(t3_17)) OR A (G (A (F (NOT FIREABLE(t1_15)))))) : (A (F (A (F (FIREABLE(t2_6))))) AND E (G ((NOT FIREABLE(t13_2) AND NOT FIREABLE(t4_1))))) : A (F (NOT(A (F (NOT FIREABLE(t3_13)))))) : A (F (A (((FIREABLE(t6_21)) U (FIREABLE(t21_2) AND FIREABLE(t14_15)))))) : A (((A (G (FIREABLE(t8_11))) OR (NOT FIREABLE(t4_5) OR NOT FIREABLE(t10_11))) U NOT(E (F (FIREABLE(t15_13)))))) : NOT(((FIREABLE(t2_11) OR A (F (FIREABLE(t3_6)))) OR FIREABLE(t18_13))) : E (G (E (F (A (X (FIREABLE(t13_17))))))) : (NOT(A (F (A (G (FIREABLE(t18_20)))))) AND E (X ((FIREABLE(t21_2) OR A (F (FIREABLE(t21_20))))))) : NOT(((NOT FIREABLE(t2_12) OR E (F (NOT FIREABLE(t9_14)))) AND E (G ((FIREABLE(t1_3) OR FIREABLE(t14_1) OR FIREABLE(t3_4)))))) : NOT(NOT(A (G (E (F (FIREABLE(t9_12))))))) : (A (F (A (G (NOT FIREABLE(t13_7))))) OR ((A (X (FIREABLE(t1_2))) OR E (G ((FIREABLE(t10_2) AND FIREABLE(t5_4))))) AND FIREABLE(t13_4))) : ((NOT(((FIREABLE(t15_13) OR FIREABLE(t19_17) OR NOT FIREABLE(t10_13)) AND A (F (FIREABLE(t2_21))))) AND ((NOT FIREABLE(t14_12) AND NOT FIREABLE(t12_16) AND NOT FIREABLE(t9_6)) OR NOT FIREABLE(t20_4))) OR FIREABLE(t5_7))
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 ((A (F (FIREABLE(t21_17))) U ((FIREABLE(t9_11) OR FIREABLE(t1_21)) AND (FIREABLE(t2_18) OR FIREABLE(t6_2))))) AND ((NOT(E (X (FIREABLE(t19_13)))) OR (FIREABLE(t18_2) AND FIREABLE(t2_12))) OR (FIREABLE(t9_6) OR FIREABLE(t11_12) OR FIREABLE(t18_20) OR FIREABLE(t21_3) OR FIREABLE(t12_11) OR FIREABLE(tAb20) OR (FIREABLE(t9_1) AND FIREABLE(t3_5)) OR FIREABLE(t13_3))))
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 ((A (F (FIREABLE(t21_17))) U ((FIREABLE(t9_11) OR FIREABLE(t1_21)) AND (FIREABLE(t2_18) OR FIREABLE(t6_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U FIREABLE(t21_17)) U ((FIREABLE(t9_11) OR FIREABLE(t1_21)) AND (FIREABLE(t2_18) OR FIREABLE(t6_2))))
lola: processed formula length: 112
lola: 6 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: 19 markings, 20 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (FIREABLE(t11_1))) AND A (X (((NOT FIREABLE(t21_6) OR NOT FIREABLE(t21_4)) OR A (F (FIREABLE(tAb13)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t11_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t11_1)))
lola: processed formula: A (F (FIREABLE(t11_1)))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: 15 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(t10_1) OR NOT FIREABLE(tb21) OR FIREABLE(t14_12) OR ((NOT FIREABLE(t20_4) OR NOT FIREABLE(t10_13)) AND FIREABLE(t6_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FIREABLE(t10_1) AND FIREABLE(tb21) AND NOT FIREABLE(t14_12) AND ((FIREABLE(t20_4) AND FIREABLE(t10_13)) OR NOT FIREABLE(t6_1)))))
lola: processed formula length: 144
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((FIREABLE(t12_13) OR A (G (FIREABLE(t1_2)))))) OR FIREABLE(t6_9))
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 (F ((FIREABLE(t12_13) OR A (G (FIREABLE(t1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(t12_13) OR A (G (FIREABLE(t1_2))))))
lola: processed formula: A (F ((FIREABLE(t12_13) OR A (G (FIREABLE(t1_2))))))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t6_9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t6_9)
lola: processed formula length: 14
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: processed formula with 0 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 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (X ((FIREABLE(t9_11) OR FIREABLE(t13_5) OR (FIREABLE(t21_3) AND FIREABLE(t13_4))))) OR FIREABLE(t3_17)) OR A (G (A (F (NOT FIREABLE(t1_15))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(t9_11) OR FIREABLE(t13_5) OR (FIREABLE(t21_3) AND FIREABLE(t13_4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((FIREABLE(t9_11) OR FIREABLE(t13_5) OR (FIREABLE(t21_3) AND FIREABLE(t13_4)))))
lola: processed formula: A (X ((FIREABLE(t9_11) OR FIREABLE(t13_5) OR (FIREABLE(t21_3) AND FIREABLE(t13_4)))))
lola: processed formula length: 87
lola: 1 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t3_17)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t3_17)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: processed formula with 0 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (NOT FIREABLE(t1_15)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U NOT FIREABLE(t1_15)))))
lola: processed formula length: 49
lola: 3 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: 713853 markings, 4022514 edges, 142771 markings/sec, 0 secs
lola: 1343190 markings, 8125103 edges, 125867 markings/sec, 5 secs
lola: 1912647 markings, 12583993 edges, 113891 markings/sec, 10 secs
lola: 2465795 markings, 16900165 edges, 110630 markings/sec, 15 secs
lola: 2998239 markings, 21461462 edges, 106489 markings/sec, 20 secs
lola: 3481990 markings, 25433436 edges, 96750 markings/sec, 25 secs
lola: 3944085 markings, 29854822 edges, 92419 markings/sec, 30 secs
lola: 4481468 markings, 34243819 edges, 107477 markings/sec, 35 secs
lola: 4978311 markings, 38528190 edges, 99369 markings/sec, 40 secs
lola: 5437819 markings, 42904564 edges, 91902 markings/sec, 45 secs
lola: 5857826 markings, 47303515 edges, 84001 markings/sec, 50 secs
lola: 6421959 markings, 51757319 edges, 112827 markings/sec, 55 secs
lola: 6896224 markings, 56222890 edges, 94853 markings/sec, 60 secs
lola: 7337935 markings, 60654054 edges, 88342 markings/sec, 65 secs
lola: 7737156 markings, 65015399 edges, 79844 markings/sec, 70 secs
lola: 8176924 markings, 69419843 edges, 87954 markings/sec, 75 secs
lola: 8561393 markings, 73852933 edges, 76894 markings/sec, 80 secs
lola: 9107481 markings, 78270997 edges, 109218 markings/sec, 85 secs
lola: 9576683 markings, 82663392 edges, 93840 markings/sec, 90 secs
lola: 10012791 markings, 87064312 edges, 87222 markings/sec, 95 secs
lola: 10420483 markings, 91352105 edges, 81538 markings/sec, 100 secs
lola: 10853476 markings, 95757006 edges, 86599 markings/sec, 105 secs
lola: 11242215 markings, 100137403 edges, 77748 markings/sec, 110 secs
lola: 11659531 markings, 104561756 edges, 83463 markings/sec, 115 secs
lola: 12047054 markings, 109062699 edges, 77505 markings/sec, 120 secs
lola: 12412359 markings, 113518951 edges, 73061 markings/sec, 125 secs
lola: 12867567 markings, 117831704 edges, 91042 markings/sec, 130 secs
lola: 13390199 markings, 121820968 edges, 104526 markings/sec, 135 secs
lola: 13847433 markings, 125804230 edges, 91447 markings/sec, 140 secs
lola: 14283288 markings, 129754153 edges, 87171 markings/sec, 145 secs
lola: 14688097 markings, 133640815 edges, 80962 markings/sec, 150 secs
lola: 15070816 markings, 137368029 edges, 76544 markings/sec, 155 secs
lola: 15406357 markings, 141052278 edges, 67108 markings/sec, 160 secs
lola: 15880679 markings, 144951778 edges, 94864 markings/sec, 165 secs
lola: 16329536 markings, 148954634 edges, 89771 markings/sec, 170 secs
lola: 16719380 markings, 152753410 edges, 77969 markings/sec, 175 secs
lola: 17058961 markings, 156376839 edges, 67916 markings/sec, 180 secs
lola: 17511523 markings, 160318372 edges, 90512 markings/sec, 185 secs
lola: 17857175 markings, 164001947 edges, 69130 markings/sec, 190 secs
lola: 18283630 markings, 167997146 edges, 85291 markings/sec, 195 secs
lola: 18649039 markings, 171398844 edges, 73082 markings/sec, 200 secs
lola: 18974034 markings, 174898937 edges, 64999 markings/sec, 205 secs
lola: 19442928 markings, 178650751 edges, 93779 markings/sec, 210 secs
lola: 19901537 markings, 182578052 edges, 91722 markings/sec, 215 secs
lola: 20321043 markings, 186445564 edges, 83901 markings/sec, 220 secs
lola: 20703325 markings, 190301271 edges, 76456 markings/sec, 225 secs
lola: 21104435 markings, 194144167 edges, 80222 markings/sec, 230 secs
lola: 21446131 markings, 197965806 edges, 68339 markings/sec, 235 secs
lola: 21830438 markings, 201693141 edges, 76861 markings/sec, 240 secs
lola: 22164291 markings, 205305140 edges, 66771 markings/sec, 245 secs
lola: 22477212 markings, 208919000 edges, 62584 markings/sec, 250 secs
lola: 22840833 markings, 212595919 edges, 72724 markings/sec, 255 secs
lola: 23274505 markings, 216600729 edges, 86734 markings/sec, 260 secs
lola: 23683197 markings, 220526522 edges, 81738 markings/sec, 265 secs
lola: 24027368 markings, 224240965 edges, 68834 markings/sec, 270 secs
lola: 24369101 markings, 227912602 edges, 68347 markings/sec, 275 secs
lola: 24684950 markings, 231422337 edges, 63170 markings/sec, 280 secs
lola: 25107844 markings, 235401275 edges, 84579 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (F (FIREABLE(t2_6))))) AND E (G ((NOT FIREABLE(t13_2) AND NOT FIREABLE(t4_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t2_6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t2_6)))
lola: processed formula: A (F (FIREABLE(t2_6)))
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: 19 markings, 19 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(A (F (NOT FIREABLE(t3_13))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U NOT FIREABLE(t3_13))))
lola: processed formula length: 44
lola: 6 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: 19 markings, 38 edges
lola: ========================================
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (((FIREABLE(t6_21)) U (FIREABLE(t21_2) AND FIREABLE(t14_15))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A((FIREABLE(t6_21)) U (FIREABLE(t21_2) AND FIREABLE(t14_15))))
lola: processed formula length: 71
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: 19 markings, 38 edges
lola: ========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((A (G (FIREABLE(t8_11))) OR (NOT FIREABLE(t4_5) OR NOT FIREABLE(t10_11))) U NOT(E (F (FIREABLE(t15_13))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((A (G (FIREABLE(t8_11))) OR (NOT FIREABLE(t4_5) OR NOT FIREABLE(t10_11))) U A (G (NOT FIREABLE(t15_13)))))
lola: processed formula: A (((A (G (FIREABLE(t8_11))) OR (NOT FIREABLE(t4_5) OR NOT FIREABLE(t10_11))) U A (G (NOT FIREABLE(t15_13)))))
lola: processed formula length: 111
lola: 3 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 215602 markings, 943847 edges, 43120 markings/sec, 0 secs
lola: 420655 markings, 2179017 edges, 41011 markings/sec, 5 secs
lola: 618584 markings, 3544717 edges, 39586 markings/sec, 10 secs
lola: 841968 markings, 5143939 edges, 44677 markings/sec, 15 secs
lola: 1055230 markings, 6537554 edges, 42652 markings/sec, 20 secs
lola: 1241853 markings, 7702617 edges, 37325 markings/sec, 25 secs
lola: 1434280 markings, 9092036 edges, 38485 markings/sec, 30 secs
lola: 1610652 markings, 10358643 edges, 35274 markings/sec, 35 secs
lola: 1802714 markings, 11691621 edges, 38412 markings/sec, 40 secs
lola: 1994305 markings, 13089594 edges, 38318 markings/sec, 45 secs
lola: 2200519 markings, 14260442 edges, 41243 markings/sec, 50 secs
lola: 2398423 markings, 15588316 edges, 39581 markings/sec, 55 secs
lola: 2608360 markings, 16995712 edges, 41987 markings/sec, 60 secs
lola: 2789450 markings, 18237755 edges, 36218 markings/sec, 65 secs
lola: 2971537 markings, 19559470 edges, 36417 markings/sec, 70 secs
lola: 3172096 markings, 20979652 edges, 40112 markings/sec, 75 secs
lola: 3375480 markings, 22278637 edges, 40677 markings/sec, 80 secs
lola: 3586624 markings, 23761731 edges, 42229 markings/sec, 85 secs
lola: 3790607 markings, 25200520 edges, 40797 markings/sec, 90 secs
lola: 4013450 markings, 26827778 edges, 44569 markings/sec, 95 secs
lola: 4223166 markings, 28268353 edges, 41943 markings/sec, 100 secs
lola: 4417534 markings, 29894537 edges, 38874 markings/sec, 105 secs
lola: 4606950 markings, 30884104 edges, 37883 markings/sec, 110 secs
lola: 4781562 markings, 32170867 edges, 34922 markings/sec, 115 secs
lola: 4971608 markings, 33392402 edges, 38009 markings/sec, 120 secs
lola: 5138764 markings, 34552136 edges, 33431 markings/sec, 125 secs
lola: 5313386 markings, 35810209 edges, 34924 markings/sec, 130 secs
lola: 5492406 markings, 37055646 edges, 35804 markings/sec, 135 secs
lola: 5674297 markings, 38225418 edges, 36378 markings/sec, 140 secs
lola: 5868176 markings, 39602423 edges, 38776 markings/sec, 145 secs
lola: 6064153 markings, 40931334 edges, 39195 markings/sec, 150 secs
lola: 6272939 markings, 42411320 edges, 41757 markings/sec, 155 secs
lola: 6469217 markings, 43801010 edges, 39256 markings/sec, 160 secs
lola: 6644715 markings, 45213331 edges, 35100 markings/sec, 165 secs
lola: 6822474 markings, 46331018 edges, 35552 markings/sec, 170 secs
lola: 7010022 markings, 47372548 edges, 37510 markings/sec, 175 secs
lola: 7180036 markings, 48565688 edges, 34003 markings/sec, 180 secs
lola: 7347928 markings, 49816498 edges, 33578 markings/sec, 185 secs
lola: 7513819 markings, 51217230 edges, 33178 markings/sec, 190 secs
lola: 7711786 markings, 52646011 edges, 39593 markings/sec, 195 secs
lola: 7895668 markings, 54179689 edges, 36776 markings/sec, 200 secs
lola: 8071100 markings, 55375338 edges, 35086 markings/sec, 205 secs
lola: 8230756 markings, 56531237 edges, 31931 markings/sec, 210 secs
lola: 8384747 markings, 57691126 edges, 30798 markings/sec, 215 secs
lola: 8553566 markings, 58877927 edges, 33764 markings/sec, 220 secs
lola: 8715729 markings, 60222390 edges, 32433 markings/sec, 225 secs
lola: 8881735 markings, 61558418 edges, 33201 markings/sec, 230 secs
lola: 9038277 markings, 62889485 edges, 31308 markings/sec, 235 secs
lola: 9204508 markings, 64299299 edges, 33246 markings/sec, 240 secs
lola: 9367461 markings, 65679728 edges, 32591 markings/sec, 245 secs
lola: 9534862 markings, 67175573 edges, 33480 markings/sec, 250 secs
lola: 9701735 markings, 68594127 edges, 33375 markings/sec, 255 secs
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: 9778596 markings, 69314066 edges
lola: ========================================
lola: subprocess 9 will run for 426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((FIREABLE(t2_11) OR A (F (FIREABLE(t3_6)))) OR FIREABLE(t18_13)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t2_11)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t2_11)
lola: processed formula length: 19
lola: 8 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: processed formula with 0 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 10 will run for 497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(t3_6)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(t3_6)))
lola: processed formula length: 29
lola: 10 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 11 will run for 596 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t18_13)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t18_13)
lola: processed formula length: 20
lola: 8 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: processed formula with 0 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (A (X (FIREABLE(t13_17)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U AX(FIREABLE(t13_17))))))
lola: processed formula length: 50
lola: 3 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 719243 markings, 3400397 edges, 3687031648961953792 markings/sec, 0 secs
lola: 1320186 markings, 6710812 edges, 120189 markings/sec, 5 secs
lola: 1858336 markings, 10395001 edges, 107630 markings/sec, 10 secs
lola: 2402519 markings, 14023521 edges, 108837 markings/sec, 15 secs
lola: 2878304 markings, 17759571 edges, 95157 markings/sec, 20 secs
lola: 3390269 markings, 21302910 edges, 102393 markings/sec, 25 secs
lola: 3842093 markings, 25090774 edges, 90365 markings/sec, 30 secs
lola: 4318084 markings, 28818826 edges, 95198 markings/sec, 35 secs
lola: 4817675 markings, 32339325 edges, 99918 markings/sec, 40 secs
lola: 5251211 markings, 36019220 edges, 86707 markings/sec, 45 secs
lola: 5674713 markings, 39717965 edges, 84700 markings/sec, 50 secs
lola: 6144816 markings, 43510654 edges, 94021 markings/sec, 55 secs
lola: 6602158 markings, 46911163 edges, 91468 markings/sec, 60 secs
lola: 7027810 markings, 50603449 edges, 85130 markings/sec, 65 secs
lola: 7447350 markings, 54405743 edges, 83908 markings/sec, 70 secs
lola: 7834724 markings, 58293727 edges, 77475 markings/sec, 75 secs
lola: 8249758 markings, 62076230 edges, 83007 markings/sec, 80 secs
lola: 8624342 markings, 65987356 edges, 74917 markings/sec, 85 secs
lola: 9151563 markings, 69600320 edges, 105444 markings/sec, 90 secs
lola: 9593284 markings, 73332852 edges, 88344 markings/sec, 95 secs
lola: 10006739 markings, 77100013 edges, 82691 markings/sec, 100 secs
lola: 10400252 markings, 80847928 edges, 78703 markings/sec, 105 secs
lola: 10814154 markings, 84635558 edges, 82780 markings/sec, 110 secs
lola: 11192476 markings, 88473064 edges, 75664 markings/sec, 115 secs
lola: 11594934 markings, 92396350 edges, 80492 markings/sec, 120 secs
lola: 11964243 markings, 96296350 edges, 73862 markings/sec, 125 secs
lola: 12317777 markings, 100211323 edges, 70707 markings/sec, 130 secs
lola: 12685867 markings, 104140712 edges, 73618 markings/sec, 135 secs
lola: 13221538 markings, 107323632 edges, 107134 markings/sec, 140 secs
lola: 13670803 markings, 110640628 edges, 89853 markings/sec, 145 secs
lola: 14101710 markings, 113999849 edges, 86181 markings/sec, 150 secs
lola: 14478315 markings, 117385315 edges, 75321 markings/sec, 155 secs
lola: 14879331 markings, 120656167 edges, 80203 markings/sec, 160 secs
lola: 15225944 markings, 123899144 edges, 69323 markings/sec, 165 secs
lola: 15574870 markings, 127117791 edges, 69785 markings/sec, 170 secs
lola: 16052167 markings, 130475269 edges, 95459 markings/sec, 175 secs
lola: 16450769 markings, 133836789 edges, 79720 markings/sec, 180 secs
lola: 16821644 markings, 137129014 edges, 74175 markings/sec, 185 secs
lola: 17185925 markings, 140215335 edges, 72856 markings/sec, 190 secs
lola: 17567010 markings, 143475365 edges, 76217 markings/sec, 195 secs
lola: 17903922 markings, 146587577 edges, 67382 markings/sec, 200 secs
lola: 18294624 markings, 149889175 edges, 78140 markings/sec, 205 secs
lola: 18634970 markings, 152723507 edges, 68069 markings/sec, 210 secs
lola: 18945116 markings, 155739800 edges, 62029 markings/sec, 215 secs
lola: 19370795 markings, 158801354 edges, 85136 markings/sec, 220 secs
lola: 19795756 markings, 161957442 edges, 84992 markings/sec, 225 secs
lola: 20173978 markings, 165148627 edges, 75644 markings/sec, 230 secs
lola: 20567263 markings, 168343973 edges, 78657 markings/sec, 235 secs
lola: 20953930 markings, 171679158 edges, 77333 markings/sec, 240 secs
lola: 21294347 markings, 175038413 edges, 68083 markings/sec, 245 secs
lola: 21653072 markings, 178349437 edges, 71745 markings/sec, 250 secs
lola: 21991272 markings, 181545099 edges, 67640 markings/sec, 255 secs
lola: 22309183 markings, 184751155 edges, 63582 markings/sec, 260 secs
lola: 22598249 markings, 187946209 edges, 57813 markings/sec, 265 secs
lola: 23024509 markings, 191210998 edges, 85252 markings/sec, 270 secs
lola: 23423541 markings, 194591393 edges, 79806 markings/sec, 275 secs
lola: 23765962 markings, 197716800 edges, 68484 markings/sec, 280 secs
lola: 24092462 markings, 200840010 edges, 65300 markings/sec, 285 secs
lola: 24400312 markings, 204006631 edges, 61570 markings/sec, 290 secs
lola: 24718798 markings, 207016671 edges, 63697 markings/sec, 295 secs
lola: 25113023 markings, 210427083 edges, 78845 markings/sec, 300 secs
lola: 25453080 markings, 213701445 edges, 68011 markings/sec, 305 secs
lola: 25752224 markings, 216937268 edges, 59829 markings/sec, 310 secs
lola: 26167145 markings, 220503300 edges, 82984 markings/sec, 315 secs
lola: 26522682 markings, 224047357 edges, 71107 markings/sec, 320 secs
lola: 26877898 markings, 227614676 edges, 71043 markings/sec, 325 secs
lola: 27238216 markings, 231305601 edges, 72064 markings/sec, 330 secs
lola: 27628009 markings, 235113261 edges, 77959 markings/sec, 335 secs
lola: 28004442 markings, 238789708 edges, 75287 markings/sec, 340 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 28209796 markings, 240889488 edges
lola: ========================================
lola: subprocess 11 will run for 527 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F (A (G (FIREABLE(t18_20)))))) AND E (X ((FIREABLE(t21_2) OR A (F (FIREABLE(t21_20)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 527 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (NOT FIREABLE(t18_20)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U NOT FIREABLE(t18_20)))))
lola: processed formula length: 50
lola: 8 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: 19 markings, 39 edges
lola: ========================================
lola: subprocess 12 will run for 658 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(t21_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(FIREABLE(t21_2))
lola: processed formula length: 19
lola: 7 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 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 13 will run for 878 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (FIREABLE(t21_20)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U FIREABLE(t21_20)))
lola: processed formula length: 30
lola: 8 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 364 markings, 389 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 658 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((NOT FIREABLE(t2_12) OR E (F (NOT FIREABLE(t9_14)))) AND E (G ((FIREABLE(t1_3) OR FIREABLE(t14_1) OR FIREABLE(t3_4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 658 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t2_12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t2_12)
lola: processed formula length: 15
lola: 9 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: processed formula with 0 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 13 will run for 878 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(t1_3) AND NOT FIREABLE(t14_1) AND NOT FIREABLE(t3_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((NOT FIREABLE(t1_3) AND NOT FIREABLE(t14_1) AND NOT FIREABLE(t3_4))))
lola: processed formula: A (F ((NOT FIREABLE(t1_3) AND NOT FIREABLE(t14_1) AND NOT FIREABLE(t3_4))))
lola: processed formula length: 75
lola: 9 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1887 markings, 1886 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 878 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(A (G (E (F (FIREABLE(t9_12)))))))
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 FIREABLE(t9_12)))))
lola: processed formula length: 45
lola: 12 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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: 2078 markings, 5220 edges
lola: ========================================
lola: subprocess 14 will run for 1317 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (G (NOT FIREABLE(t13_7))))) OR ((A (X (FIREABLE(t1_2))) OR E (G ((FIREABLE(t10_2) AND FIREABLE(t5_4))))) AND FIREABLE(t13_4)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1317 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (NOT FIREABLE(t13_7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (NOT FIREABLE(t13_7)))))
lola: processed formula: A (F (A (G (NOT FIREABLE(t13_7)))))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 112 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: 187687 markings, 829318 edges, 37537 markings/sec, 0 secs
lola: 351293 markings, 1600371 edges, 32721 markings/sec, 5 secs
lola: 522993 markings, 2603680 edges, 34340 markings/sec, 10 secs
lola: 704484 markings, 3443043 edges, 36298 markings/sec, 15 secs
lola: 866591 markings, 4369874 edges, 32421 markings/sec, 20 secs
lola: 1022381 markings, 5249967 edges, 31158 markings/sec, 25 secs
lola: 1185815 markings, 6175041 edges, 32687 markings/sec, 30 secs
lola: 1362223 markings, 7054699 edges, 35282 markings/sec, 35 secs
lola: 1541059 markings, 8008759 edges, 35767 markings/sec, 40 secs
lola: 1702846 markings, 8968428 edges, 32357 markings/sec, 45 secs
lola: 1884228 markings, 9941451 edges, 36276 markings/sec, 50 secs
lola: 2055117 markings, 10932021 edges, 34178 markings/sec, 55 secs
lola: 2233729 markings, 11961679 edges, 35722 markings/sec, 60 secs
lola: 2403998 markings, 13010839 edges, 34054 markings/sec, 65 secs
lola: 2573977 markings, 13897512 edges, 33996 markings/sec, 70 secs
lola: 2736196 markings, 14801990 edges, 32444 markings/sec, 75 secs
lola: 2897455 markings, 15661991 edges, 32252 markings/sec, 80 secs
lola: 3053048 markings, 16545581 edges, 31119 markings/sec, 85 secs
lola: 3221702 markings, 17435689 edges, 33731 markings/sec, 90 secs
lola: 3386631 markings, 18372432 edges, 32986 markings/sec, 95 secs
lola: 3552352 markings, 19332110 edges, 33144 markings/sec, 100 secs
lola: 3703973 markings, 20337955 edges, 30324 markings/sec, 105 secs
lola: 3864171 markings, 21170774 edges, 32040 markings/sec, 110 secs
lola: 4023213 markings, 22028218 edges, 31808 markings/sec, 115 secs
lola: 4177574 markings, 22929290 edges, 30872 markings/sec, 120 secs
lola: 4330584 markings, 23928440 edges, 30602 markings/sec, 125 secs
lola: 4483603 markings, 24851564 edges, 30604 markings/sec, 130 secs
lola: 4634126 markings, 25759502 edges, 30105 markings/sec, 135 secs
lola: 4773349 markings, 26596462 edges, 27845 markings/sec, 140 secs
lola: 4908601 markings, 27525641 edges, 27050 markings/sec, 145 secs
lola: 5045636 markings, 28472108 edges, 27407 markings/sec, 150 secs
lola: 5183593 markings, 29463549 edges, 27591 markings/sec, 155 secs
lola: 5321166 markings, 30386188 edges, 27515 markings/sec, 160 secs
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: 5409671 markings, 31055875 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(((FIREABLE(t15_13) OR FIREABLE(t19_17) OR NOT FIREABLE(t10_13)) AND A (F (FIREABLE(t2_21))))) AND ((NOT FIREABLE(t14_12) AND NOT FIREABLE(t12_16) AND NOT FIREABLE(t9_6)) OR NOT FIREABLE(t20_4))) OR FIREABLE(t5_7))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(t15_13) AND NOT FIREABLE(t19_17) AND FIREABLE(t10_13))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(t15_13) AND NOT FIREABLE(t19_17) AND FIREABLE(t10_13))
lola: processed formula length: 68
lola: 5 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: processed formula with 0 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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(t14_12) AND NOT FIREABLE(t12_16) AND NOT FIREABLE(t9_6)) OR NOT FIREABLE(t20_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((NOT FIREABLE(t14_12) AND NOT FIREABLE(t12_16) AND NOT FIREABLE(t9_6)) OR NOT FIREABLE(t20_4))
lola: processed formula length: 96
lola: 5 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: processed formula with 0 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 18 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t5_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t5_7)
lola: processed formula length: 14
lola: 5 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-11ringRR-CTLFireability.task
lola: processed formula with 0 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: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no unknown no no no yes yes no no yes no yes unknown
FORMULA DNAwalker-PT-11ringRR-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-CTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-11ringRR-CTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DNAwalker-PT-11ringRR"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-11ringRR.tgz
mv DNAwalker-PT-11ringRR execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is DNAwalker-PT-11ringRR, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-smll-152649744200298"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
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 ;