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 276K
-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 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.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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-08ringLL, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-152649744100276
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526748479696


BK_STOP 1526749246222

--------------------
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-08ringLL 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': 14629, 'Memory': 7612.74, 'Tool': 'marcie'}, {'Time': 16405, 'Memory': 7612.58, 'Tool': 'marcie'}, {'Time': 29453, 'Memory': 849.67, 'Tool': 'itstools'}, {'Time': 31259, 'Memory': 859.28, 'Tool': 'itstools'}, {'Time': 1529397, 'Memory': 3519.55, 'Tool': 'lola'}, {'Time': 1552052, 'Memory': 3385.22, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 104.54556018866634x far from the best tool marcie.
CTLCardinality lola DNAwalker-PT-08ringLL...

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


checking for too many tokens
===========================================================================================
DNAwalker-PT-08ringLL: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ DNAwalker-PT-08ringLL @ 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: 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-08ringLL-CTLCardinality.task
lola: (((E (F ((1 <= B2))) OR (A13 <= A15)) AND E (G ((A3 <= B4)))) AND E (F (E (F ((A17 <= B4)))))) : A (G (NOT(A (X ((A8 <= A2)))))) : ((A (X (((A6 <= A12) AND (B15 <= B4)))) OR E (((A3 <= A21) U (3 <= B5)))) AND E (X ((A12 <= B14)))) : NOT(((A (F ((A6 <= A8))) OR E (G ((A20 <= B2)))) AND A (F ((2 <= A6))))) : ((A12 + 1 <= B2) OR (A (F (((B3 <= A1) AND (3 <= B4)))) AND NOT(E (G ((2 <= B5)))))) : NOT(A (F (A (F ((A1 <= B3)))))) : ((A (((A19 <= B14) U (2 <= B5))) AND ((1 <= A1) AND (2 <= A1) AND ((3 <= A17) OR (A2 <= A3)) AND (A19 <= A2))) OR (A (F ((3 <= A15))) OR E (G (((A9 <= B5) AND (1 <= A17)))))) : E (F (E (G (((A17 <= B3) OR (A15 <= B3)))))) : A ((((A18 <= A19) OR (3 <= B2) OR (B4 <= 2)) U A (F ((3 <= A21))))) : NOT((A (F (((A17 <= A6) AND (B15 <= A14)))) OR E (F (((3 <= B2) OR (3 <= A7)))))) : (NOT(NOT(A (G (TRUE)))) AND E (X ((B14 <= A5)))) : A (F ((2 <= A21))) : A (F ((A (X ((1 <= B5))) OR (B15 + 1 <= A20)))) : NOT(NOT(E (F (FALSE)))) : A (F ((A18 <= A14))) : E (G (A (((A9 <= A2) U (1 <= A11)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (F ((1 <= B2))) OR (A13 <= A15)) AND E (G ((A3 <= B4)))) AND E (F (E (F ((A17 <= B4))))))
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: E (F ((1 <= B2)))
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 108 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: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A3 <= B4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (B4 + 1 <= A3)))
lola: processed formula length: 29
lola: 4 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A17 <= B4)))
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 108 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: state equation: write sara problem file to DNAwalker-PT-08ringLL-CTLCardinality-2.saralola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(A (X ((A8 <= A2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((A2 + 1 <= A8)))))
lola: processed formula length: 38
lola: 5 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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: 25 markings, 29 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (X (((A6 <= A12) AND (B15 <= B4)))) OR E (((A3 <= A21) U (3 <= B5)))) AND E (X ((A12 <= B14))))
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: A (X (((A6 <= A12) AND (B15 <= B4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((A6 <= A12) AND (B15 <= B4))))
lola: processed formula: A (X (((A6 <= A12) AND (B15 <= B4))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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: 28 markings, 28 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((A3 <= A21) U (3 <= B5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((A3 <= A21) U (3 <= B5))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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: 921243 markings, 4545892 edges, 184249 markings/sec, 0 secs
lola: 1699380 markings, 9211230 edges, 155627 markings/sec, 5 secs
lola: 2551096 markings, 13444758 edges, 170343 markings/sec, 10 secs
lola: 3405646 markings, 18003222 edges, 170910 markings/sec, 15 secs
lola: 4221733 markings, 22371325 edges, 163217 markings/sec, 20 secs
lola: 4960450 markings, 26564556 edges, 147743 markings/sec, 25 secs
lola: 5786784 markings, 30823752 edges, 165267 markings/sec, 30 secs
lola: 6470705 markings, 34913831 edges, 136784 markings/sec, 35 secs
lola: 7237853 markings, 38488547 edges, 153430 markings/sec, 40 secs
lola: 7970818 markings, 42651102 edges, 146593 markings/sec, 45 secs
lola: 8641304 markings, 46083215 edges, 134097 markings/sec, 50 secs
lola: 9111438 markings, 49645599 edges, 94027 markings/sec, 55 secs
lola: 9521641 markings, 53383866 edges, 82041 markings/sec, 60 secs
lola: 10229024 markings, 57012365 edges, 141477 markings/sec, 65 secs
lola: 10885933 markings, 60151608 edges, 131382 markings/sec, 70 secs
lola: 11468482 markings, 63365332 edges, 116510 markings/sec, 75 secs
lola: 12061409 markings, 66779376 edges, 118585 markings/sec, 80 secs
lola: 12592678 markings, 70186615 edges, 106254 markings/sec, 85 secs
lola: 13063828 markings, 73518809 edges, 94230 markings/sec, 90 secs
lola: 13491581 markings, 76592187 edges, 85551 markings/sec, 95 secs
lola: 13880621 markings, 79680216 edges, 77808 markings/sec, 100 secs
lola: 14368961 markings, 83002627 edges, 97668 markings/sec, 105 secs
lola: 14813307 markings, 86201057 edges, 88869 markings/sec, 110 secs
lola: 15230140 markings, 89460034 edges, 83367 markings/sec, 115 secs
lola: 15672210 markings, 92857565 edges, 88414 markings/sec, 120 secs
lola: 16036857 markings, 96215986 edges, 72929 markings/sec, 125 secs
lola: 16469219 markings, 99487701 edges, 86472 markings/sec, 130 secs
lola: 16879593 markings, 102652891 edges, 82075 markings/sec, 135 secs
lola: 17258121 markings, 105675008 edges, 75706 markings/sec, 140 secs
lola: 17622912 markings, 108816221 edges, 72958 markings/sec, 145 secs
lola: 17958113 markings, 111897382 edges, 67040 markings/sec, 150 secs
lola: 18279218 markings, 114984562 edges, 64221 markings/sec, 155 secs
lola: 18755319 markings, 118390877 edges, 95220 markings/sec, 160 secs
lola: 19219599 markings, 121663200 edges, 92856 markings/sec, 165 secs
lola: 19634773 markings, 124873736 edges, 83035 markings/sec, 170 secs
lola: 20064065 markings, 128047849 edges, 85858 markings/sec, 175 secs
lola: 20474590 markings, 131306804 edges, 82105 markings/sec, 180 secs
lola: 20849017 markings, 134510600 edges, 74885 markings/sec, 185 secs
lola: 21227732 markings, 137544415 edges, 75743 markings/sec, 190 secs
lola: 21556225 markings, 140514710 edges, 65699 markings/sec, 195 secs
lola: 21864295 markings, 143503500 edges, 61614 markings/sec, 200 secs
lola: 22306514 markings, 146748816 edges, 88444 markings/sec, 205 secs
lola: 22680960 markings, 149821769 edges, 74889 markings/sec, 210 secs
lola: 23064822 markings, 152932915 edges, 76772 markings/sec, 215 secs
lola: 23431503 markings, 156096796 edges, 73336 markings/sec, 220 secs
lola: 23815921 markings, 159249923 edges, 76884 markings/sec, 225 secs
lola: 24222036 markings, 162444432 edges, 81223 markings/sec, 230 secs
lola: 24587578 markings, 165588736 edges, 73108 markings/sec, 235 secs
lola: 24934378 markings, 168692866 edges, 69360 markings/sec, 240 secs
lola: 25304315 markings, 171902554 edges, 73987 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((A (F ((A6 <= A8))) OR E (G ((A20 <= B2)))) AND A (F ((2 <= A6)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A8 + 1 <= A6)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (A6 <= A8)))
lola: processed formula length: 25
lola: 13 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A6 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= A6)))
lola: processed formula length: 24
lola: 13 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A12 + 1 <= B2) OR (A (F (((B3 <= A1) AND (3 <= B4)))) AND NOT(E (G ((2 <= B5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A12 + 1 <= B2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A12 + 1 <= B2)
lola: processed formula length: 15
lola: 3 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-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 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((B3 <= A1) AND (3 <= B4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((B3 <= A1) AND (3 <= B4))))
lola: processed formula: A (F (((B3 <= A1) AND (3 <= B4))))
lola: processed formula length: 34
lola: 3 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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: 17 markings, 17 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (F ((A1 <= B3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (A1 <= B3)))
lola: processed formula length: 25
lola: 6 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 12393 markings, 14580 edges
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((A19 <= B14) U (2 <= B5))) AND ((1 <= A1) AND (2 <= A1) AND ((3 <= A17) OR (A2 <= A3)) AND (A19 <= A2))) OR (A (F ((3 <= A15))) OR E (G (((A9 <= B5) AND (1 <= A17))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((A19 <= B14) U (2 <= B5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((A19 <= B14) U (2 <= B5)))
lola: processed formula: A (((A19 <= B14) U (2 <= B5)))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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: 20 markings, 20 edges
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= A15)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= A15)))
lola: processed formula: A (F ((3 <= A15)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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: 14 markings, 14 edges
lola: ========================================
lola: subprocess 8 will run for 410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((A9 <= B5) AND (1 <= A17))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((B5 + 1 <= A9) OR (A17 <= 0))))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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: 24 markings, 24 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (((A17 <= B3) OR (A15 <= B3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U ((B3 + 1 <= A17) AND (B3 + 1 <= A15)))))
lola: processed formula length: 62
lola: 3 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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, 20 edges
lola: ========================================
lola: subprocess 8 will run for 410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((A18 <= A19) OR (3 <= B2) OR (B4 <= 2)) U A (F ((3 <= A21)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((A18 <= A19) OR (3 <= B2) OR (B4 <= 2)) U A(TRUE U (3 <= A21)))
lola: processed formula length: 68
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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: 15 markings, 45 edges
lola: ========================================
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F (((A17 <= A6) AND (B15 <= A14)))) OR E (F (((3 <= B2) OR (3 <= A7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((A6 + 1 <= A17) OR (A14 + 1 <= B15))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((A17 <= A6) AND (B15 <= A14))))
lola: processed formula length: 45
lola: 9 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 10 will run for 547 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((B2 <= 2) AND (A7 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 108 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-08ringLL-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-08ringLL-CTLCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 320057 markings, 2008456 edges, 64011 markings/sec, 0 secs
lola: sara is running 5 secs || 609753 markings, 4044198 edges, 57939 markings/sec, 5 secs
lola: sara is running 10 secs || 891601 markings, 6035589 edges, 56370 markings/sec, 10 secs
lola: sara is running 15 secs || 1156090 markings, 8163646 edges, 52898 markings/sec, 15 secs
lola: sara is running 20 secs || 1432729 markings, 10206779 edges, 55328 markings/sec, 20 secs
lola: sara is running 25 secs || 1709673 markings, 12243618 edges, 55389 markings/sec, 25 secs
lola: sara is running 30 secs || 1977338 markings, 14265280 edges, 53533 markings/sec, 30 secs
lola: sara is running 35 secs || 2243026 markings, 16314253 edges, 53138 markings/sec, 35 secs
lola: sara is running 40 secs || 2504476 markings, 18328342 edges, 52290 markings/sec, 40 secs
lola: sara is running 45 secs || 2753416 markings, 20375684 edges, 49788 markings/sec, 45 secs
lola: sara is running 50 secs || 3036621 markings, 22460241 edges, 56641 markings/sec, 50 secs
lola: sara is running 55 secs || 3305317 markings, 24509722 edges, 53739 markings/sec, 55 secs
lola: sara is running 60 secs || 3571134 markings, 26565002 edges, 53163 markings/sec, 60 secs
lola: sara is running 65 secs || 3832337 markings, 28618659 edges, 52241 markings/sec, 65 secs
lola: sara is running 70 secs || 4083667 markings, 30659785 edges, 50266 markings/sec, 70 secs
lola: sara is running 75 secs || 4359791 markings, 32628982 edges, 55225 markings/sec, 75 secs
lola: sara is running 80 secs || 4630779 markings, 34559583 edges, 54198 markings/sec, 80 secs
lola: sara is running 85 secs || 4871416 markings, 36584101 edges, 48127 markings/sec, 85 secs
lola: sara is running 90 secs || 5122684 markings, 38545368 edges, 50254 markings/sec, 90 secs
lola: sara is running 95 secs || 5365036 markings, 40499425 edges, 48470 markings/sec, 95 secs
lola: sara is running 100 secs || 5589025 markings, 42534014 edges, 44798 markings/sec, 100 secs
lola: sara is running 105 secs || 5828791 markings, 44587350 edges, 47953 markings/sec, 105 secs
lola: sara is running 110 secs || 6128380 markings, 46666953 edges, 59918 markings/sec, 110 secs
lola: sara is running 115 secs || 6397413 markings, 48765464 edges, 53807 markings/sec, 115 secs
lola: sara is running 120 secs || 6680308 markings, 50735779 edges, 56579 markings/sec, 120 secs
lola: sara is running 125 secs || 6936000 markings, 52861809 edges, 51138 markings/sec, 125 secs
lola: sara is running 130 secs || 7189405 markings, 55039157 edges, 50681 markings/sec, 130 secs
lola: sara is running 135 secs || 7469808 markings, 57092983 edges, 56081 markings/sec, 135 secs
lola: sara is running 140 secs || 7734065 markings, 59148101 edges, 52851 markings/sec, 140 secs
lola: sara is running 145 secs || 7994269 markings, 61193504 edges, 52041 markings/sec, 145 secs
lola: sara is running 150 secs || 8254059 markings, 63261808 edges, 51958 markings/sec, 150 secs
lola: sara is running 155 secs || 8508588 markings, 65290108 edges, 50906 markings/sec, 155 secs
lola: sara is running 160 secs || 8747472 markings, 67370576 edges, 47777 markings/sec, 160 secs
lola: sara is running 165 secs || 9016950 markings, 69449920 edges, 53896 markings/sec, 165 secs
lola: sara is running 170 secs || 9282359 markings, 71546809 edges, 53082 markings/sec, 170 secs
lola: sara is running 175 secs || 9533425 markings, 73675202 edges, 50213 markings/sec, 175 secs
lola: sara is running 180 secs || 9792885 markings, 75727063 edges, 51892 markings/sec, 180 secs
lola: sara is running 185 secs || 10037032 markings, 77860514 edges, 48829 markings/sec, 185 secs
lola: sara is running 190 secs || 10282568 markings, 79889851 edges, 49107 markings/sec, 190 secs
lola: sara is running 195 secs || 10523993 markings, 81969160 edges, 48285 markings/sec, 195 secs
lola: sara is running 200 secs || 10784939 markings, 84021422 edges, 52189 markings/sec, 200 secs
lola: sara is running 205 secs || 11031154 markings, 86098060 edges, 49243 markings/sec, 205 secs
lola: sara is running 210 secs || 11268906 markings, 88161616 edges, 47550 markings/sec, 210 secs
lola: sara is running 215 secs || 11495224 markings, 90311858 edges, 45264 markings/sec, 215 secs
lola: sara is running 220 secs || 11743489 markings, 92339165 edges, 49653 markings/sec, 220 secs
lola: sara is running 225 secs || 11973233 markings, 94429572 edges, 45949 markings/sec, 225 secs
lola: sara is running 230 secs || 12208699 markings, 96447869 edges, 47093 markings/sec, 230 secs
lola: sara is running 235 secs || 12434461 markings, 98359157 edges, 45152 markings/sec, 235 secs
lola: sara is running 240 secs || 12698470 markings, 100388376 edges, 52802 markings/sec, 240 secs
lola: sara is running 245 secs || 12976588 markings, 102318331 edges, 55624 markings/sec, 245 secs
lola: sara is running 250 secs || 13233839 markings, 104321010 edges, 51450 markings/sec, 250 secs
lola: sara is running 255 secs || 13503476 markings, 106339325 edges, 53927 markings/sec, 255 secs
lola: sara is running 260 secs || 13768722 markings, 108318867 edges, 53049 markings/sec, 260 secs
lola: sara is running 265 secs || 14028003 markings, 110328410 edges, 51856 markings/sec, 265 secs
lola: sara is running 270 secs || 14289770 markings, 112355993 edges, 52353 markings/sec, 270 secs
lola: sara is running 275 secs || 14550670 markings, 114367776 edges, 52180 markings/sec, 275 secs
lola: sara is running 280 secs || 14813013 markings, 116282612 edges, 52469 markings/sec, 280 secs
lola: sara is running 285 secs || 15055840 markings, 118273082 edges, 48565 markings/sec, 285 secs
lola: sara is running 290 secs || 15286387 markings, 120209205 edges, 46109 markings/sec, 290 secs
lola: sara is running 295 secs || 15510086 markings, 122233341 edges, 44740 markings/sec, 295 secs
lola: sara is running 300 secs || 15777218 markings, 124098165 edges, 53426 markings/sec, 300 secs
lola: sara is running 305 secs || 16040694 markings, 126007957 edges, 52695 markings/sec, 305 secs
lola: sara is running 310 secs || 16294274 markings, 127942024 edges, 50716 markings/sec, 310 secs
lola: sara is running 315 secs || 16548086 markings, 129831547 edges, 50762 markings/sec, 315 secs
lola: sara is running 320 secs || 16783978 markings, 131718206 edges, 47178 markings/sec, 320 secs
lola: sara is running 325 secs || 17008553 markings, 133648844 edges, 44915 markings/sec, 325 secs
lola: sara is running 330 secs || 17238616 markings, 135642229 edges, 46013 markings/sec, 330 secs
lola: sara is running 335 secs || 17482342 markings, 137523205 edges, 48745 markings/sec, 335 secs
lola: sara is running 340 secs || 17690604 markings, 139516395 edges, 41652 markings/sec, 340 secs
lola: sara is running 345 secs || 17897183 markings, 141498791 edges, 41316 markings/sec, 345 secs
lola: sara is running 350 secs || 18117780 markings, 143556600 edges, 44119 markings/sec, 350 secs
lola: sara is running 355 secs || 18346348 markings, 145685145 edges, 45714 markings/sec, 355 secs
lola: sara is running 360 secs || 18571039 markings, 147765329 edges, 44938 markings/sec, 360 secs
lola: sara is running 365 secs || 18798759 markings, 149821259 edges, 45544 markings/sec, 365 secs
lola: sara is running 370 secs || 19018923 markings, 151807028 edges, 44033 markings/sec, 370 secs
lola: sara is running 375 secs || 19279377 markings, 153726925 edges, 52091 markings/sec, 375 secs
lola: sara is running 380 secs || 19530484 markings, 155657578 edges, 50221 markings/sec, 380 secs
lola: sara is running 385 secs || 19776526 markings, 157583349 edges, 49208 markings/sec, 385 secs
lola: sara is running 390 secs || 20023771 markings, 159460470 edges, 49449 markings/sec, 390 secs
lola: sara is running 395 secs || 20254562 markings, 161381870 edges, 46158 markings/sec, 395 secs
lola: sara is running 400 secs || 20472599 markings, 163329886 edges, 43607 markings/sec, 400 secs
lola: sara is running 405 secs || 20711834 markings, 165309866 edges, 47847 markings/sec, 405 secs
lola: sara is running 410 secs || 20950748 markings, 167326813 edges, 47783 markings/sec, 410 secs
lola: sara is running 415 secs || 21190828 markings, 169294060 edges, 48016 markings/sec, 415 secs
lola: sara is running 420 secs || 21424171 markings, 171274667 edges, 46669 markings/sec, 420 secs
lola: sara is running 425 secs || 21662803 markings, 173175438 edges, 47726 markings/sec, 425 secs
lola: sara is running 430 secs || 21887035 markings, 175135535 edges, 44846 markings/sec, 430 secs
lola: sara is running 435 secs || 22111892 markings, 177088818 edges, 44971 markings/sec, 435 secs
lola: sara is running 440 secs || 22319303 markings, 179071094 edges, 41482 markings/sec, 440 secs
lola: sara is running 445 secs || 22553464 markings, 181072183 edges, 46832 markings/sec, 445 secs
lola: sara is running 450 secs || 22789975 markings, 183035547 edges, 47302 markings/sec, 450 secs
lola: sara is running 455 secs || 23029307 markings, 184977364 edges, 47866 markings/sec, 455 secs
lola: sara is running 460 secs || 23269655 markings, 186888387 edges, 48070 markings/sec, 460 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 10 will run for 469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(NOT(A (G (TRUE)))) AND E (X ((B14 <= A5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((B14 <= A5))
lola: processed formula length: 15
lola: 7 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 563 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= A21)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= A21)))
lola: processed formula: A (F ((2 <= A21)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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: subprocess 12 will run for 704 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((1 <= B5))) OR (B15 + 1 <= A20))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (AX((1 <= B5)) OR (B15 + 1 <= A20)))
lola: processed formula length: 45
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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: 19 markings, 19 edges
lola: ========================================
lola: subprocess 13 will run for 939 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (F (FALSE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 5 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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 14 will run for 1409 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A18 <= A14)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A18 <= A14)))
lola: processed formula: A (F ((A18 <= A14)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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: 32 markings, 32 edges
lola: ========================================
lola: subprocess 15 will run for 2818 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((A9 <= A2) U (1 <= A11)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((A9 <= A2) U (1 <= A11)))))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 27 places; total mentions: 0
lola: closed formula file DNAwalker-PT-08ringLL-CTLCardinality.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: 15 markings, 30 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no unknown yes no no yes yes no unknown yes no no no no yes
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-08ringLL-CTLCardinality-15 TRUE 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-08ringLL"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-08ringLL.tgz
mv DNAwalker-PT-08ringLL 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-08ringLL, 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 r071-smll-152649744100276"
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 ;