About the Execution of M4M.full for DNAwalker-PT-08ringLL
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2997.840 | 766128.00 | 1199372.00 | 2751.50 | TF?TFFTTF?TFFFFT | 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 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-full
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 r070-smll-152649743100276
=====================================================================
--------------------
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 1526756120356
BK_STOP 1526756886484
--------------------
content from stderr:
Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DNAwalker-PT-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.sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
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: 949747 markings, 4759684 edges, 189949 markings/sec, 0 secs
lola: 1698585 markings, 9204856 edges, 149768 markings/sec, 5 secs
lola: 2509438 markings, 13195174 edges, 162171 markings/sec, 10 secs
lola: 3341194 markings, 17513048 edges, 166351 markings/sec, 15 secs
lola: 4085435 markings, 21631052 edges, 148848 markings/sec, 20 secs
lola: 4817381 markings, 25628754 edges, 146389 markings/sec, 25 secs
lola: 5468140 markings, 29520366 edges, 130152 markings/sec, 30 secs
lola: 6238769 markings, 33582906 edges, 154126 markings/sec, 35 secs
lola: 7000235 markings, 37248759 edges, 152293 markings/sec, 40 secs
lola: 7617732 markings, 41040635 edges, 123499 markings/sec, 45 secs
lola: 8396156 markings, 44613430 edges, 155685 markings/sec, 50 secs
lola: 8956568 markings, 48479827 edges, 112082 markings/sec, 55 secs
lola: 9383280 markings, 52089501 edges, 85342 markings/sec, 60 secs
lola: 9953394 markings, 55661073 edges, 114023 markings/sec, 65 secs
lola: 10627028 markings, 58889306 edges, 134727 markings/sec, 70 secs
lola: 11214804 markings, 61963520 edges, 117555 markings/sec, 75 secs
lola: 11763930 markings, 65133820 edges, 109825 markings/sec, 80 secs
lola: 12337060 markings, 68550252 edges, 114626 markings/sec, 85 secs
lola: 12807936 markings, 71862741 edges, 94175 markings/sec, 90 secs
lola: 13281420 markings, 74982838 edges, 94697 markings/sec, 95 secs
lola: 13652483 markings, 77940578 edges, 74213 markings/sec, 100 secs
lola: 14089012 markings, 81110999 edges, 87306 markings/sec, 105 secs
lola: 14552327 markings, 84277749 edges, 92663 markings/sec, 110 secs
lola: 14941982 markings, 87264340 edges, 77931 markings/sec, 115 secs
lola: 15322835 markings, 90217503 edges, 76171 markings/sec, 120 secs
lola: 15697179 markings, 93078741 edges, 74869 markings/sec, 125 secs
lola: 16007293 markings, 95915379 edges, 62023 markings/sec, 130 secs
lola: 16377790 markings, 98748814 edges, 74099 markings/sec, 135 secs
lola: 16748987 markings, 101676755 edges, 74239 markings/sec, 140 secs
lola: 17101518 markings, 104436019 edges, 70506 markings/sec, 145 secs
lola: 17451382 markings, 107248558 edges, 69973 markings/sec, 150 secs
lola: 17720407 markings, 109742218 edges, 53805 markings/sec, 155 secs
lola: 18011048 markings, 112373231 edges, 58128 markings/sec, 160 secs
lola: 18286602 markings, 115062240 edges, 55111 markings/sec, 165 secs
lola: 18684499 markings, 117937295 edges, 79579 markings/sec, 170 secs
lola: 19104727 markings, 120845622 edges, 84046 markings/sec, 175 secs
lola: 19439607 markings, 123493928 edges, 66976 markings/sec, 180 secs
lola: 19858838 markings, 126427660 edges, 83846 markings/sec, 185 secs
lola: 20206338 markings, 129156546 edges, 69500 markings/sec, 190 secs
lola: 20542066 markings, 131941719 edges, 67146 markings/sec, 195 secs
lola: 20865337 markings, 134646157 edges, 64654 markings/sec, 200 secs
lola: 21185903 markings, 137205481 edges, 64113 markings/sec, 205 secs
lola: 21480468 markings, 139769938 edges, 58913 markings/sec, 210 secs
lola: 21744862 markings, 142277094 edges, 52879 markings/sec, 215 secs
lola: 22062648 markings, 144976200 edges, 63557 markings/sec, 220 secs
lola: 22424708 markings, 147680911 edges, 72412 markings/sec, 225 secs
lola: 22724540 markings, 150245891 edges, 59966 markings/sec, 230 secs
lola: 23071081 markings, 152985800 edges, 69308 markings/sec, 235 secs
lola: 23386351 markings, 155670887 edges, 63054 markings/sec, 240 secs
lola: 23685450 markings, 158314988 edges, 59820 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 274 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 274 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 274 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 411 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 411 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 548 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 || 298506 markings, 1869341 edges, 59701 markings/sec, 0 secs
lola: sara is running 5 secs || 565169 markings, 3777150 edges, 53333 markings/sec, 5 secs
lola: sara is running 10 secs || 832283 markings, 5580368 edges, 53423 markings/sec, 10 secs
lola: sara is running 15 secs || 1075577 markings, 7524678 edges, 48659 markings/sec, 15 secs
lola: sara is running 20 secs || 1327767 markings, 9450401 edges, 50438 markings/sec, 20 secs
lola: sara is running 25 secs || 1584558 markings, 11373677 edges, 51358 markings/sec, 25 secs
lola: sara is running 30 secs || 1834776 markings, 13223213 edges, 50044 markings/sec, 30 secs
lola: sara is running 35 secs || 2085731 markings, 15064987 edges, 50191 markings/sec, 35 secs
lola: sara is running 40 secs || 2331673 markings, 16947996 edges, 49188 markings/sec, 40 secs
lola: sara is running 45 secs || 2564029 markings, 18827416 edges, 46471 markings/sec, 45 secs
lola: sara is running 50 secs || 2808487 markings, 20736030 edges, 48892 markings/sec, 50 secs
lola: sara is running 55 secs || 3065532 markings, 22633309 edges, 51409 markings/sec, 55 secs
lola: sara is running 60 secs || 3306600 markings, 24522296 edges, 48214 markings/sec, 60 secs
lola: sara is running 65 secs || 3551025 markings, 26418086 edges, 48885 markings/sec, 65 secs
lola: sara is running 70 secs || 3788577 markings, 28330053 edges, 47510 markings/sec, 70 secs
lola: sara is running 75 secs || 4024356 markings, 30170595 edges, 47156 markings/sec, 75 secs
lola: sara is running 80 secs || 4271708 markings, 31994606 edges, 49470 markings/sec, 80 secs
lola: sara is running 85 secs || 4523549 markings, 33776720 edges, 50368 markings/sec, 85 secs
lola: sara is running 90 secs || 4759769 markings, 35616088 edges, 47244 markings/sec, 90 secs
lola: sara is running 95 secs || 4988009 markings, 37445413 edges, 45648 markings/sec, 95 secs
lola: sara is running 100 secs || 5208362 markings, 39240872 edges, 44071 markings/sec, 100 secs
lola: sara is running 105 secs || 5413967 markings, 40928325 edges, 41121 markings/sec, 105 secs
lola: sara is running 110 secs || 5630919 markings, 42869292 edges, 43390 markings/sec, 110 secs
lola: sara is running 115 secs || 5874343 markings, 44882469 edges, 48685 markings/sec, 115 secs
lola: sara is running 120 secs || 6163181 markings, 46913928 edges, 57768 markings/sec, 120 secs
lola: sara is running 125 secs || 6427969 markings, 48959626 edges, 52958 markings/sec, 125 secs
lola: sara is running 130 secs || 6700170 markings, 50898342 edges, 54440 markings/sec, 130 secs
lola: sara is running 135 secs || 6947211 markings, 52962606 edges, 49408 markings/sec, 135 secs
lola: sara is running 140 secs || 7193284 markings, 55073230 edges, 49215 markings/sec, 140 secs
lola: sara is running 145 secs || 7468296 markings, 57080155 edges, 55002 markings/sec, 145 secs
lola: sara is running 150 secs || 7728047 markings, 59100331 edges, 51950 markings/sec, 150 secs
lola: sara is running 155 secs || 7980117 markings, 61088274 edges, 50414 markings/sec, 155 secs
lola: sara is running 160 secs || 8232999 markings, 63078499 edges, 50576 markings/sec, 160 secs
lola: sara is running 165 secs || 8472827 markings, 64993410 edges, 47966 markings/sec, 165 secs
lola: sara is running 170 secs || 8697820 markings, 66899250 edges, 44999 markings/sec, 170 secs
lola: sara is running 175 secs || 8934918 markings, 68817497 edges, 47420 markings/sec, 175 secs
lola: sara is running 180 secs || 9183618 markings, 70827091 edges, 49740 markings/sec, 180 secs
lola: sara is running 185 secs || 9429247 markings, 72735915 edges, 49126 markings/sec, 185 secs
lola: sara is running 190 secs || 9649974 markings, 74645352 edges, 44145 markings/sec, 190 secs
lola: sara is running 195 secs || 9904332 markings, 76651955 edges, 50872 markings/sec, 195 secs
lola: sara is running 200 secs || 10141860 markings, 78705691 edges, 47506 markings/sec, 200 secs
lola: sara is running 205 secs || 10380236 markings, 80697345 edges, 47675 markings/sec, 205 secs
lola: sara is running 210 secs || 10627566 markings, 82727195 edges, 49466 markings/sec, 210 secs
lola: sara is running 215 secs || 10869099 markings, 84767964 edges, 48307 markings/sec, 215 secs
lola: sara is running 220 secs || 11111411 markings, 86749516 edges, 48462 markings/sec, 220 secs
lola: sara is running 225 secs || 11333176 markings, 88814390 edges, 44353 markings/sec, 225 secs
lola: sara is running 230 secs || 11562604 markings, 90865994 edges, 45886 markings/sec, 230 secs
lola: sara is running 235 secs || 11803497 markings, 92832241 edges, 48179 markings/sec, 235 secs
lola: sara is running 240 secs || 12028841 markings, 94843024 edges, 45069 markings/sec, 240 secs
lola: sara is running 245 secs || 12254852 markings, 96835770 edges, 45202 markings/sec, 245 secs
lola: sara is running 250 secs || 12469816 markings, 98710357 edges, 42993 markings/sec, 250 secs
lola: sara is running 255 secs || 12742061 markings, 100702060 edges, 54449 markings/sec, 255 secs
lola: sara is running 260 secs || 13016486 markings, 102600864 edges, 54885 markings/sec, 260 secs
lola: sara is running 265 secs || 13271673 markings, 104595824 edges, 51037 markings/sec, 265 secs
lola: sara is running 270 secs || 13539441 markings, 106557148 edges, 53554 markings/sec, 270 secs
lola: sara is running 275 secs || 13793508 markings, 108516942 edges, 50813 markings/sec, 275 secs
lola: sara is running 280 secs || 14050689 markings, 110488188 edges, 51436 markings/sec, 280 secs
lola: sara is running 285 secs || 14307751 markings, 112477239 edges, 51412 markings/sec, 285 secs
lola: sara is running 290 secs || 14561825 markings, 114464906 edges, 50815 markings/sec, 290 secs
lola: sara is running 295 secs || 14822436 markings, 116363810 edges, 52122 markings/sec, 295 secs
lola: sara is running 300 secs || 15064235 markings, 118331785 edges, 48360 markings/sec, 300 secs
lola: sara is running 305 secs || 15290739 markings, 120254134 edges, 45301 markings/sec, 305 secs
lola: sara is running 310 secs || 15512625 markings, 122252992 edges, 44377 markings/sec, 310 secs
lola: sara is running 315 secs || 15779543 markings, 124117419 edges, 53384 markings/sec, 315 secs
lola: sara is running 320 secs || 16043111 markings, 126028772 edges, 52714 markings/sec, 320 secs
lola: sara is running 325 secs || 16295625 markings, 127951431 edges, 50503 markings/sec, 325 secs
lola: sara is running 330 secs || 16548792 markings, 129838447 edges, 50633 markings/sec, 330 secs
lola: sara is running 335 secs || 16783067 markings, 131711069 edges, 46855 markings/sec, 335 secs
lola: sara is running 340 secs || 17004388 markings, 133611613 edges, 44264 markings/sec, 340 secs
lola: sara is running 345 secs || 17228436 markings, 135568040 edges, 44810 markings/sec, 345 secs
lola: sara is running 350 secs || 17468242 markings, 137397635 edges, 47961 markings/sec, 350 secs
lola: sara is running 355 secs || 17675190 markings, 139350272 edges, 41390 markings/sec, 355 secs
lola: sara is running 360 secs || 17879601 markings, 141315881 edges, 40882 markings/sec, 360 secs
lola: sara is running 365 secs || 18097128 markings, 143377056 edges, 43505 markings/sec, 365 secs
lola: sara is running 370 secs || 18326974 markings, 145489556 edges, 45969 markings/sec, 370 secs
lola: sara is running 375 secs || 18549769 markings, 147594968 edges, 44559 markings/sec, 375 secs
lola: sara is running 380 secs || 18780026 markings, 149641442 edges, 46051 markings/sec, 380 secs
lola: sara is running 385 secs || 18994423 markings, 151624740 edges, 42879 markings/sec, 385 secs
lola: sara is running 390 secs || 19259943 markings, 153549136 edges, 53104 markings/sec, 390 secs
lola: sara is running 395 secs || 19512835 markings, 155505807 edges, 50578 markings/sec, 395 secs
lola: sara is running 400 secs || 19757996 markings, 157436246 edges, 49032 markings/sec, 400 secs
lola: sara is running 405 secs || 20009404 markings, 159328409 edges, 50282 markings/sec, 405 secs
lola: sara is running 410 secs || 20240878 markings, 161260583 edges, 46295 markings/sec, 410 secs
lola: sara is running 415 secs || 20459327 markings, 163218591 edges, 43690 markings/sec, 415 secs
lola: sara is running 420 secs || 20698702 markings, 165209636 edges, 47875 markings/sec, 420 secs
lola: sara is running 425 secs || 20939733 markings, 167223392 edges, 48206 markings/sec, 425 secs
lola: sara is running 430 secs || 21180396 markings, 169201250 edges, 48133 markings/sec, 430 secs
lola: sara is running 435 secs || 21412623 markings, 171201554 edges, 46445 markings/sec, 435 secs
lola: sara is running 440 secs || 21654689 markings, 173109199 edges, 48413 markings/sec, 440 secs
lola: sara is running 445 secs || 21880302 markings, 175079112 edges, 45123 markings/sec, 445 secs
lola: sara is running 450 secs || 22106297 markings, 177039876 edges, 45199 markings/sec, 450 secs
lola: sara is running 455 secs || 22314538 markings, 179023642 edges, 41648 markings/sec, 455 secs
lola: sara is running 460 secs || 22548883 markings, 181035114 edges, 46869 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 2819 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 stderr -----
----- Finished stdout -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DNAwalker-PT-08ringLL"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-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-full"
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 r070-smll-152649743100276"
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 '
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 ;