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 252K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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.9K 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 77K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Solitaire-PT-EngCT7x7, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-152705516900136
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527078301714


BK_STOP 1527079051979

--------------------
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 Solitaire-PT-EngCT7x7 as instance name.
Using Solitaire as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': None, 'Source Place': None, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': None, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': None, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 1327148, 'Memory': 4881.48, 'Tool': 'lola'}, {'Time': 1327234, 'Memory': 5171.64, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola Solitaire-PT-EngCT7x7...

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


checking for too many tokens
===========================================================================================
Solitaire-PT-EngCT7x7: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ Solitaire-PT-EngCT7x7 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- 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: 143/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 67 places, 76 transitions, 33 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 77 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: (((3 <= F41) AND ((F65 + 1 <= F73) OR (F34 + 1 <= T44)) AND (F52 <= F65)) OR A (F ((2 <= T32)))) : A (F (E (G ((T32 + 1 <= T44))))) : E (X ((A (F ((2 <= F44))) OR (3 <= T42)))) : (E (((F32 <= F24) U (2 <= F54))) OR ((T55 <= T37) AND A (((3 <= F63) U (2 <= T41))))) : E (G ((((F37 <= 2) OR (F65 <= 2)) OR A (G ((F52 <= T43)))))) : (((A (G ((3 <= T31))) OR (((1 <= T54) AND (T74 <= T31)) OR (F15 <= F56))) AND (3 <= F33)) OR (((((F47 <= F75) AND (1 <= F24)) OR (2 <= T24)) OR E (G ((F53 <= T15)))) OR A (X ((T37 <= F54))))) : A (F (((2 <= p23) OR (3 <= p23)))) : A (F (E (G ((T55 <= 2))))) : (A (F (((T42 <= F63) OR (T47 <= F55)))) AND A (((T75 <= counter) U (T56 + 1 <= T47)))) : A (X (E (F ((2 <= F75))))) : (E (G (((F15 <= T13) OR (2 <= F34) OR (2 <= F14)))) AND (T44 <= p23)) : (((1 <= F41) OR (((T33 + 1 <= T43) OR ((3 <= F54) AND (1 <= F34))) AND (T52 <= F74))) OR (A (((2 <= counter) U (3 <= F36))) AND A (X ((T35 <= 2))))) : (A (F (A (G ((1 <= F37))))) AND E (((F45 + 1 <= T33) U TRUE))) : A (F (())) : (E (F (A (F ((2 <= F74))))) AND (A (X ((1 <= T15))) OR A (F (((1 <= T37) AND (1 <= F65)))))) : A (F (E (((F57 <= F31) U (2 <= F25)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= F41) AND ((F65 + 1 <= F73) OR (F34 + 1 <= T44)) AND (F52 <= F65)) OR A (F ((2 <= T32))))
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: ((3 <= F41) AND ((F65 + 1 <= F73) OR (F34 + 1 <= T44)) AND (F52 <= F65))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= F41) AND ((F65 + 1 <= F73) OR (F34 + 1 <= T44)) AND (F52 <= F65))
lola: processed formula length: 73
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: processed formula with 4 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= T32)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= T32)))
lola: processed formula: A (F ((2 <= T32)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 29 markings, 29 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((T32 + 1 <= T44)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (T44 <= T32))))
lola: processed formula length: 37
lola: 3 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 95 markings, 131 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((A (F ((2 <= F44))) OR (3 <= T42))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((2 <= F44)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (2 <= F44)))
lola: processed formula length: 24
lola: 3 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 88 markings, 87 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((3 <= T42)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((3 <= T42))
lola: processed formula length: 14
lola: 2 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((F32 <= F24) U (2 <= F54))) OR ((T55 <= T37) AND A (((3 <= F63) U (2 <= T41)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((F32 <= F24) U (2 <= F54)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((F32 <= F24) U (2 <= F54))
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 851497 markings, 3650486 edges, 2169638807299686400 markings/sec, 0 secs
lola: 1618515 markings, 6968876 edges, 153404 markings/sec, 5 secs
lola: 2307468 markings, 10176911 edges, 137791 markings/sec, 10 secs
lola: 2983121 markings, 13381825 edges, 135131 markings/sec, 15 secs
lola: 3646061 markings, 16555691 edges, 132588 markings/sec, 20 secs
lola: 4233408 markings, 19716558 edges, 117469 markings/sec, 25 secs
lola: 4813586 markings, 22953309 edges, 116036 markings/sec, 30 secs
lola: 5431583 markings, 26065298 edges, 123599 markings/sec, 35 secs
lola: 6088593 markings, 29222345 edges, 131402 markings/sec, 40 secs
lola: 6692643 markings, 32288968 edges, 120810 markings/sec, 45 secs
lola: 7320189 markings, 35565015 edges, 125509 markings/sec, 50 secs
lola: 7878200 markings, 38758430 edges, 111602 markings/sec, 55 secs
lola: 8429679 markings, 41713641 edges, 110296 markings/sec, 60 secs
lola: 8981808 markings, 44717693 edges, 110426 markings/sec, 65 secs
lola: 9502002 markings, 47754694 edges, 104039 markings/sec, 70 secs
lola: 10020353 markings, 50919863 edges, 103670 markings/sec, 75 secs
lola: 10491456 markings, 53874969 edges, 94221 markings/sec, 80 secs
lola: 11007724 markings, 56708268 edges, 103254 markings/sec, 85 secs
lola: 11489100 markings, 59483599 edges, 96275 markings/sec, 90 secs
lola: 11972747 markings, 62233730 edges, 96729 markings/sec, 95 secs
lola: 12544833 markings, 65047548 edges, 114417 markings/sec, 100 secs
lola: 13105147 markings, 67723582 edges, 112063 markings/sec, 105 secs
lola: 13672342 markings, 70726620 edges, 113439 markings/sec, 110 secs
lola: 14202658 markings, 73648046 edges, 106063 markings/sec, 115 secs
lola: 14725292 markings, 76386190 edges, 104527 markings/sec, 120 secs
lola: 15209116 markings, 79172540 edges, 96765 markings/sec, 125 secs
lola: 15727277 markings, 81860065 edges, 103632 markings/sec, 130 secs
lola: 16225153 markings, 84554444 edges, 99575 markings/sec, 135 secs
lola: 16719391 markings, 87182757 edges, 98848 markings/sec, 140 secs
lola: 17188603 markings, 89677040 edges, 93842 markings/sec, 145 secs
lola: 17673730 markings, 92173085 edges, 97025 markings/sec, 150 secs
lola: 18088466 markings, 94659328 edges, 82947 markings/sec, 155 secs
lola: 18503892 markings, 97217634 edges, 83085 markings/sec, 160 secs
lola: 18940452 markings, 99766134 edges, 87312 markings/sec, 165 secs
lola: 19386171 markings, 102360728 edges, 89144 markings/sec, 170 secs
lola: 19921046 markings, 105069228 edges, 106975 markings/sec, 175 secs
lola: 20430687 markings, 107799562 edges, 101928 markings/sec, 180 secs
lola: 20911801 markings, 110498803 edges, 96223 markings/sec, 185 secs
lola: 21379924 markings, 113215253 edges, 93625 markings/sec, 190 secs
lola: 21840696 markings, 115699601 edges, 92154 markings/sec, 195 secs
lola: 22315333 markings, 118573572 edges, 94927 markings/sec, 200 secs
lola: 22762523 markings, 121415772 edges, 89438 markings/sec, 205 secs
lola: 23187403 markings, 124001742 edges, 84976 markings/sec, 210 secs
lola: 23624869 markings, 126590570 edges, 87493 markings/sec, 215 secs
lola: 24062412 markings, 129167473 edges, 87509 markings/sec, 220 secs
lola: 24479731 markings, 131797837 edges, 83464 markings/sec, 225 secs
lola: 24906939 markings, 134387838 edges, 85442 markings/sec, 230 secs
lola: 25363454 markings, 137183757 edges, 91303 markings/sec, 235 secs
lola: 25789653 markings, 139849620 edges, 85240 markings/sec, 240 secs
lola: 26197044 markings, 142467015 edges, 81478 markings/sec, 245 secs
lola: 26599075 markings, 145053138 edges, 80406 markings/sec, 250 secs
lola: 26968328 markings, 147483836 edges, 73851 markings/sec, 255 secs
lola: 27373323 markings, 149915647 edges, 80999 markings/sec, 260 secs
lola: 27803598 markings, 152322204 edges, 86055 markings/sec, 265 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 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((F37 <= 2) OR (F65 <= 2)) OR A (G ((F52 <= T43))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((3 <= F37) AND (3 <= F65)) AND E(TRUE U (T43 + 1 <= F52)))))
lola: processed formula length: 75
lola: 6 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A (G ((3 <= T31))) OR (((1 <= T54) AND (T74 <= T31)) OR (F15 <= F56))) AND (3 <= F33)) OR (((((F47 <= F75) AND (1 <= F24)) OR (2 <= T24)) OR E (G ((F53 <= T15)))) OR A (X ((T37 <= F54)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= T31)))
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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((1 <= T54) AND (T74 <= T31)) OR (F15 <= F56))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((1 <= T54) AND (T74 <= T31)) OR (F15 <= F56))
lola: processed formula length: 48
lola: 1 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= F33)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= F33)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-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 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((F47 <= F75) AND (1 <= F24)) OR (2 <= T24))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((F47 <= F75) AND (1 <= F24)) OR (2 <= T24))
lola: processed formula length: 46
lola: 1 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: processed formula with 3 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 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((F53 <= T15)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (T15 + 1 <= F53)))
lola: processed formula length: 31
lola: 3 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 23 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p23) OR (3 <= p23))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= p23) OR (3 <= p23))))
lola: processed formula: A (F (((2 <= p23) OR (3 <= p23))))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 28 markings, 28 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((T55 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (3 <= T55))))
lola: processed formula length: 35
lola: 3 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 23 markings, 23 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((T42 <= F63) OR (T47 <= F55)))) AND A (((T75 <= counter) U (T56 + 1 <= T47))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((T42 <= F63) OR (T47 <= F55))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((T42 <= F63) OR (T47 <= F55))))
lola: processed formula: A (F (((T42 <= F63) OR (T47 <= F55))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 994493 markings, 1666629 edges, 198899 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1392222 markings, 2407655 edges
lola: ========================================
lola: subprocess 9 will run for 465 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((T75 <= counter) U (T56 + 1 <= T47)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((T75 <= counter) U (T56 + 1 <= T47)))
lola: processed formula: A (((T75 <= counter) U (T56 + 1 <= T47)))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 28 markings, 28 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 465 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((2 <= F75)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (2 <= F75)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 67 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngCT7x7-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 858072 markings, 3864181 edges, 3689320832170983424 markings/sec, 0 secs
lola: 1586075 markings, 7394191 edges, 145601 markings/sec, 5 secs
lola: 2205648 markings, 10806729 edges, 123915 markings/sec, 10 secs
lola: 2804206 markings, 14134144 edges, 119712 markings/sec, 15 secs
lola: 3422569 markings, 17544352 edges, 123673 markings/sec, 20 secs
lola: 3995292 markings, 20975188 edges, 114545 markings/sec, 25 secs
lola: 4525605 markings, 24288961 edges, 106063 markings/sec, 30 secs
lola: 5062369 markings, 27621328 edges, 107353 markings/sec, 35 secs
lola: 5577968 markings, 30923283 edges, 103120 markings/sec, 40 secs
lola: 6058166 markings, 34165679 edges, 96040 markings/sec, 45 secs
lola: 6586193 markings, 37328291 edges, 105605 markings/sec, 50 secs
lola: 7182644 markings, 40540375 edges, 119290 markings/sec, 55 secs
lola: 7727240 markings, 43713012 edges, 108919 markings/sec, 60 secs
lola: 8235808 markings, 46746336 edges, 101714 markings/sec, 65 secs
lola: 8749690 markings, 49803443 edges, 102776 markings/sec, 70 secs
lola: 9262413 markings, 52954804 edges, 102545 markings/sec, 75 secs
lola: 9819331 markings, 56255551 edges, 111384 markings/sec, 80 secs
lola: 10345178 markings, 59496269 edges, 105169 markings/sec, 85 secs
lola: 10801296 markings, 62642174 edges, 91224 markings/sec, 90 secs
lola: 11251331 markings, 65672172 edges, 90007 markings/sec, 95 secs
lola: 11705761 markings, 68680132 edges, 90886 markings/sec, 100 secs
lola: 12179774 markings, 71793337 edges, 94803 markings/sec, 105 secs
lola: 12642156 markings, 74937496 edges, 92476 markings/sec, 110 secs
lola: 13061034 markings, 77919785 edges, 83776 markings/sec, 115 secs
lola: 13476651 markings, 80854926 edges, 83123 markings/sec, 120 secs
lola: 13854434 markings, 83684420 edges, 75557 markings/sec, 125 secs
lola: 14242782 markings, 86597687 edges, 77670 markings/sec, 130 secs
lola: 14635977 markings, 89421079 edges, 78639 markings/sec, 135 secs
lola: 15147733 markings, 92228972 edges, 102351 markings/sec, 140 secs
lola: 15633287 markings, 95074634 edges, 97111 markings/sec, 145 secs
lola: 16126488 markings, 97944977 edges, 98640 markings/sec, 150 secs
lola: 16657666 markings, 100937537 edges, 106236 markings/sec, 155 secs
lola: 17133462 markings, 103800528 edges, 95159 markings/sec, 160 secs
lola: 17582788 markings, 106729209 edges, 89865 markings/sec, 165 secs
lola: 18083978 markings, 109707720 edges, 100238 markings/sec, 170 secs
lola: 18510639 markings, 112465579 edges, 85332 markings/sec, 175 secs
lola: 18932658 markings, 115236573 edges, 84404 markings/sec, 180 secs
lola: 19348027 markings, 117950398 edges, 83074 markings/sec, 185 secs
lola: 19763225 markings, 120659418 edges, 83040 markings/sec, 190 secs
lola: 20213076 markings, 123445484 edges, 89970 markings/sec, 195 secs
lola: 20640885 markings, 126171967 edges, 85562 markings/sec, 200 secs
lola: 21017363 markings, 128850515 edges, 75296 markings/sec, 205 secs
lola: 21387667 markings, 131574141 edges, 74061 markings/sec, 210 secs
lola: 21750232 markings, 134158790 edges, 72513 markings/sec, 215 secs
lola: 22143321 markings, 136842204 edges, 78618 markings/sec, 220 secs
lola: 22548927 markings, 139444633 edges, 81121 markings/sec, 225 secs
lola: 22909998 markings, 142043854 edges, 72214 markings/sec, 230 secs
lola: 23275294 markings, 144668692 edges, 73059 markings/sec, 235 secs
lola: 23640921 markings, 147193333 edges, 73125 markings/sec, 240 secs
lola: 24037553 markings, 149863062 edges, 79326 markings/sec, 245 secs
lola: 24469299 markings, 152625707 edges, 86349 markings/sec, 250 secs
lola: 24920987 markings, 155423592 edges, 90338 markings/sec, 255 secs
lola: 25346482 markings, 158188073 edges, 85099 markings/sec, 260 secs
lola: 25754552 markings, 160952150 edges, 81614 markings/sec, 265 secs
lola: 26181900 markings, 163719754 edges, 85470 markings/sec, 270 secs
lola: 26563270 markings, 166287995 edges, 76274 markings/sec, 275 secs
lola: 26939245 markings, 168845325 edges, 75195 markings/sec, 280 secs
lola: 27327122 markings, 171447971 edges, 77575 markings/sec, 285 secs
lola: 27706791 markings, 174146502 edges, 75934 markings/sec, 290 secs
lola: 28108692 markings, 176933258 edges, 80380 markings/sec, 295 secs
lola: 28508752 markings, 179656009 edges, 80012 markings/sec, 300 secs
lola: 28938034 markings, 182529509 edges, 85856 markings/sec, 305 secs
lola: 29328590 markings, 185300110 edges, 78111 markings/sec, 310 secs
lola: 29754711 markings, 188017156 edges, 85224 markings/sec, 315 secs
lola: 30107617 markings, 190677442 edges, 70581 markings/sec, 320 secs
lola: 30436851 markings, 193282452 edges, 65847 markings/sec, 325 secs
lola: 30770185 markings, 195856086 edges, 66667 markings/sec, 330 secs
lola: 31113054 markings, 198339525 edges, 68574 markings/sec, 335 secs
lola: 31502628 markings, 201001537 edges, 77915 markings/sec, 340 secs
lola: 31854547 markings, 203557848 edges, 70384 markings/sec, 345 secs
lola: 32247893 markings, 206157771 edges, 78669 markings/sec, 350 secs
lola: 32612664 markings, 208647597 edges, 72954 markings/sec, 355 secs
lola: 32989906 markings, 211143042 edges, 75448 markings/sec, 360 secs
lola: 33310551 markings, 213618365 edges, 64129 markings/sec, 365 secs
lola: 33661108 markings, 216283286 edges, 70111 markings/sec, 370 secs
lola: 34065153 markings, 219025304 edges, 80809 markings/sec, 375 secs
lola: 34431202 markings, 221662160 edges, 73210 markings/sec, 380 secs
lola: 34778935 markings, 224134987 edges, 69547 markings/sec, 385 secs
lola: 35100286 markings, 226551520 edges, 64270 markings/sec, 390 secs
lola: 35435395 markings, 228912432 edges, 67022 markings/sec, 395 secs
lola: 35757185 markings, 231331088 edges, 64358 markings/sec, 400 secs
lola: 36081945 markings, 233738511 edges, 64952 markings/sec, 405 secs
lola: 36407668 markings, 236130537 edges, 65145 markings/sec, 410 secs
lola: 36705089 markings, 238465499 edges, 59484 markings/sec, 415 secs
lola: 37006107 markings, 240865596 edges, 60204 markings/sec, 420 secs
lola: 37285982 markings, 243321189 edges, 55975 markings/sec, 425 secs
lola: 37604115 markings, 245874975 edges, 63627 markings/sec, 430 secs
lola: 38040112 markings, 248670716 edges, 87199 markings/sec, 435 secs
lola: 38420465 markings, 251271696 edges, 76071 markings/sec, 440 secs
lola: 38800636 markings, 253916374 edges, 76034 markings/sec, 445 secs
lola: 39173849 markings, 256549345 edges, 74643 markings/sec, 450 secs
lola: 39576587 markings, 259243143 edges, 80548 markings/sec, 455 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- 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="Solitaire-PT-EngCT7x7"
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/Solitaire-PT-EngCT7x7.tgz
mv Solitaire-PT-EngCT7x7 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 Solitaire-PT-EngCT7x7, 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 r166-smll-152705516900136"
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 ;