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 272K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.1K 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 12K 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 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 110K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DES-PT-60a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-152646385700283
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526561443506


BK_STOP 1526562170363

--------------------
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 DES-PT-60a as instance name.
Using DES 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': False, 'Source Place': True, 'Sink Place': None, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 2791780, 'Memory': 3316.83, 'Tool': 'lola'}, {'Time': 2792458, 'Memory': 3339.48, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola DES-PT-60a...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
DES-PT-60a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
DES-PT-60a: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ DES-PT-60a @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 665/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 354 places, 311 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 336 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-60a-CTLCardinality.task
lola: E (F (((3 <= p214) AND (2 <= p128)))) : NOT(A (X (A (G ((p282 <= p23)))))) : A (((((3 <= p133) AND (2 <= p122)) OR (p270 <= 1)) U (p61 + 1 <= p284))) : E (G (E (F ((3 <= p17))))) : ((((p161 <= 0) AND (p314 <= 1)) OR (((p5 <= 2) OR (p232 <= 2)) AND (p163 <= p105))) AND NOT((A (F ((3 <= p190))) OR A (G ((1 <= p216)))))) : (E (G ((p126 <= p146))) OR NOT((A (X ((p329 <= p142))) OR (p286 <= p61)))) : A (G (A (F (((2 <= p45) AND (p68 <= p160)))))) : A (F (NOT(A (F ((p266 <= p306)))))) : E (X (E (((p353 <= p256) U (2 <= p130))))) : A ((E (F ((p306 <= p161))) U A (F ((2 <= p322))))) : E (F (E (G ((p180 <= p220))))) : ((p110 <= p6) AND (E (G ((p198 <= 1))) OR (E (G ((3 <= p5))) AND ((p202 <= 1) AND (p293 + 1 <= p67))))) : (E (G ((p340 <= p34))) OR A (F (E (G ((p27 <= p291)))))) : A (G (E (X ((p96 <= p183))))) : NOT((A (F ((p159 + 1 <= p156))) OR (A (F ((p311 <= p34))) AND E (G ((3 <= p0)))))) : ((E (F (((1 <= p122) AND (3 <= p187)))) OR A (G ((p75 + 1 <= p122)))) AND (p1 <= p93))
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 (((3 <= p214) AND (2 <= p128))))
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 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60a-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (A (G ((p282 <= p23))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (p23 + 1 <= p282)))
lola: processed formula length: 31
lola: 7 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 51594 markings, 304274 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((((3 <= p133) AND (2 <= p122)) OR (p270 <= 1)) U (p61 + 1 <= p284)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((((3 <= p133) AND (2 <= p122)) OR (p270 <= 1)) U (p61 + 1 <= p284)))
lola: processed formula: A (((((3 <= p133) AND (2 <= p122)) OR (p270 <= 1)) U (p61 + 1 <= p284)))
lola: processed formula length: 73
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 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: 26 markings, 26 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((3 <= p17)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (3 <= p17)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 560577 markings, 3481629 edges, 3192519972177838080 markings/sec, 0 secs
lola: 1119218 markings, 7158122 edges, 111728 markings/sec, 5 secs
lola: 1519555 markings, 10706095 edges, 80067 markings/sec, 10 secs
lola: 1892989 markings, 14107232 edges, 74687 markings/sec, 15 secs
lola: 2265871 markings, 17520714 edges, 74576 markings/sec, 20 secs
lola: 2608540 markings, 20861957 edges, 68534 markings/sec, 25 secs
lola: 3030733 markings, 24254529 edges, 84439 markings/sec, 30 secs
lola: 3501212 markings, 27808583 edges, 94096 markings/sec, 35 secs
lola: 3855129 markings, 31159743 edges, 70783 markings/sec, 40 secs
lola: 4218466 markings, 34527696 edges, 72667 markings/sec, 45 secs
lola: 4579432 markings, 37880439 edges, 72193 markings/sec, 50 secs
lola: 5091879 markings, 41368744 edges, 102489 markings/sec, 55 secs
lola: 5470497 markings, 44787835 edges, 75724 markings/sec, 60 secs
lola: 5815954 markings, 48128980 edges, 69091 markings/sec, 65 secs
lola: 6196480 markings, 51547962 edges, 76105 markings/sec, 70 secs
lola: 6541499 markings, 54859809 edges, 69004 markings/sec, 75 secs
lola: 6988512 markings, 58175048 edges, 89403 markings/sec, 80 secs
lola: 7376874 markings, 61492890 edges, 77672 markings/sec, 85 secs
lola: 7733263 markings, 64855046 edges, 71278 markings/sec, 90 secs
lola: 8085198 markings, 68341383 edges, 70387 markings/sec, 95 secs
lola: 8595468 markings, 72067329 edges, 102054 markings/sec, 100 secs
lola: 9032116 markings, 75541774 edges, 87330 markings/sec, 105 secs
lola: 9439539 markings, 78870454 edges, 81485 markings/sec, 110 secs
lola: 9794130 markings, 82095975 edges, 70918 markings/sec, 115 secs
lola: 10174018 markings, 85286566 edges, 75978 markings/sec, 120 secs
lola: 10510880 markings, 88368554 edges, 67372 markings/sec, 125 secs
lola: 10900622 markings, 91650595 edges, 77948 markings/sec, 130 secs
lola: 11246744 markings, 94851885 edges, 69224 markings/sec, 135 secs
lola: 11667976 markings, 98331348 edges, 84246 markings/sec, 140 secs
lola: 12021606 markings, 101582065 edges, 70726 markings/sec, 145 secs
lola: 12358325 markings, 104716257 edges, 67344 markings/sec, 150 secs
lola: 12656476 markings, 107755973 edges, 59630 markings/sec, 155 secs
lola: 12977570 markings, 110752375 edges, 64219 markings/sec, 160 secs
lola: 13262890 markings, 113654430 edges, 57064 markings/sec, 165 secs
lola: 13600077 markings, 116814295 edges, 67437 markings/sec, 170 secs
lola: 13902671 markings, 119898745 edges, 60519 markings/sec, 175 secs
lola: 14344277 markings, 123486913 edges, 88321 markings/sec, 180 secs
lola: 14788633 markings, 126953097 edges, 88871 markings/sec, 185 secs
lola: 15199694 markings, 130361220 edges, 82212 markings/sec, 190 secs
lola: 15580953 markings, 133912172 edges, 76252 markings/sec, 195 secs
lola: 15939429 markings, 137439771 edges, 71695 markings/sec, 200 secs
lola: 16261288 markings, 140824874 edges, 64372 markings/sec, 205 secs
lola: 16660079 markings, 144461558 edges, 79758 markings/sec, 210 secs
lola: 17063828 markings, 148064590 edges, 80750 markings/sec, 215 secs
lola: 17399039 markings, 151214447 edges, 67042 markings/sec, 220 secs
lola: 17765529 markings, 154602519 edges, 73298 markings/sec, 225 secs
lola: 18120219 markings, 157990856 edges, 70938 markings/sec, 230 secs
lola: 18438551 markings, 161223792 edges, 63666 markings/sec, 235 secs
lola: 18753399 markings, 164361807 edges, 62970 markings/sec, 240 secs
lola: 19057206 markings, 167443574 edges, 60761 markings/sec, 245 secs
lola: 19392718 markings, 170738719 edges, 67102 markings/sec, 250 secs
lola: 19766695 markings, 174060810 edges, 74795 markings/sec, 255 secs
lola: 20098745 markings, 177401117 edges, 66410 markings/sec, 260 secs
lola: 20400979 markings, 180747681 edges, 60447 markings/sec, 265 secs
lola: local time limit reached - aborting
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: ((((p161 <= 0) AND (p314 <= 1)) OR (((p5 <= 2) OR (p232 <= 2)) AND (p163 <= p105))) AND NOT((A (F ((3 <= p190))) OR A (G ((1 <= p216))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p161 <= 0) AND (p314 <= 1)) OR (((p5 <= 2) OR (p232 <= 2)) AND (p163 <= p105)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p161 <= 0) AND (p314 <= 1)) OR (((p5 <= 2) OR (p232 <= 2)) AND (p163 <= p105)))
lola: processed formula length: 84
lola: 7 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: processed formula with 5 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 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p190 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= p190)))
lola: processed formula length: 26
lola: 9 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 44 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p216 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: state equation: write sara problem file to DES-PT-60a-CTLCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((p126 <= p146))) OR NOT((A (X ((p329 <= p142))) OR (p286 <= p61))))
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: E (G ((p126 <= p146)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p146 + 1 <= p126)))
lola: processed formula length: 33
lola: 7 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 44 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 (G (A (F (((2 <= p45) AND (p68 <= p160))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((2 <= p45) AND (p68 <= p160))))))
lola: processed formula length: 60
lola: 2 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 45 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(A (F ((p266 <= p306))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p266 <= p306))))
lola: processed formula length: 39
lola: 6 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 89 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (((p353 <= p256) U (2 <= p130)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E((p353 <= p256) U (2 <= p130)))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 752020 markings, 3546587 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1385069 markings, 7232084 edges, 126610 markings/sec, 5 secs
lola: 1892208 markings, 10910550 edges, 101428 markings/sec, 10 secs
lola: 2435621 markings, 14621241 edges, 108683 markings/sec, 15 secs
lola: 3010786 markings, 18324190 edges, 115033 markings/sec, 20 secs
lola: 3667267 markings, 22130748 edges, 131296 markings/sec, 25 secs
lola: 4172081 markings, 25915485 edges, 100963 markings/sec, 30 secs
lola: 4651103 markings, 29609756 edges, 95804 markings/sec, 35 secs
lola: 5128912 markings, 33254804 edges, 95562 markings/sec, 40 secs
lola: 5564491 markings, 36777029 edges, 87116 markings/sec, 45 secs
lola: 6074475 markings, 40308959 edges, 101997 markings/sec, 50 secs
lola: 6487745 markings, 43655189 edges, 82654 markings/sec, 55 secs
lola: 6962399 markings, 47351780 edges, 94931 markings/sec, 60 secs
lola: 7379130 markings, 51106572 edges, 83346 markings/sec, 65 secs
lola: 7802935 markings, 54841094 edges, 84761 markings/sec, 70 secs
lola: 8233046 markings, 58444198 edges, 86022 markings/sec, 75 secs
lola: 8601911 markings, 61991368 edges, 73773 markings/sec, 80 secs
lola: 9018478 markings, 65386339 edges, 83313 markings/sec, 85 secs
lola: 9511418 markings, 68832979 edges, 98588 markings/sec, 90 secs
lola: 9877536 markings, 72153953 edges, 73224 markings/sec, 95 secs
lola: 10223065 markings, 75804516 edges, 69106 markings/sec, 100 secs
lola: 10493113 markings, 79291638 edges, 54010 markings/sec, 105 secs
lola: 10880751 markings, 82743000 edges, 77528 markings/sec, 110 secs
lola: 11303766 markings, 86018869 edges, 84603 markings/sec, 115 secs
lola: 11718714 markings, 89298612 edges, 82990 markings/sec, 120 secs
lola: 12095506 markings, 92511610 edges, 75358 markings/sec, 125 secs
lola: 12407929 markings, 95823417 edges, 62485 markings/sec, 130 secs
lola: 12703309 markings, 99299036 edges, 59076 markings/sec, 135 secs
lola: 12942884 markings, 102590775 edges, 47915 markings/sec, 140 secs
lola: 13234878 markings, 106008319 edges, 58399 markings/sec, 145 secs
lola: 13607159 markings, 109665676 edges, 74456 markings/sec, 150 secs
lola: 13923685 markings, 113336139 edges, 63305 markings/sec, 155 secs
lola: 14237228 markings, 116913424 edges, 62709 markings/sec, 160 secs
lola: 14498031 markings, 120499027 edges, 52161 markings/sec, 165 secs
lola: 14868540 markings, 124010275 edges, 74102 markings/sec, 170 secs
lola: 15264364 markings, 127529506 edges, 79165 markings/sec, 175 secs
lola: 15565044 markings, 131049258 edges, 60136 markings/sec, 180 secs
lola: 15864441 markings, 134498034 edges, 59879 markings/sec, 185 secs
lola: 16357609 markings, 138130301 edges, 98634 markings/sec, 190 secs
lola: 17039687 markings, 141813027 edges, 136416 markings/sec, 195 secs
lola: 17501423 markings, 145311887 edges, 92347 markings/sec, 200 secs
lola: 17831794 markings, 148843589 edges, 66074 markings/sec, 205 secs
lola: 18165986 markings, 152247584 edges, 66838 markings/sec, 210 secs
lola: 18627589 markings, 155806117 edges, 92321 markings/sec, 215 secs
lola: 19120819 markings, 159320400 edges, 98646 markings/sec, 220 secs
lola: 19524796 markings, 162616553 edges, 80795 markings/sec, 225 secs
lola: 19915582 markings, 166025216 edges, 78157 markings/sec, 230 secs
lola: 20287441 markings, 169457302 edges, 74372 markings/sec, 235 secs
lola: 20654426 markings, 172796111 edges, 73397 markings/sec, 240 secs
lola: 20955248 markings, 176174717 edges, 60164 markings/sec, 245 secs
lola: 21315619 markings, 179430449 edges, 72074 markings/sec, 250 secs
lola: 21586255 markings, 182735735 edges, 54127 markings/sec, 255 secs
lola: 21876670 markings, 186139336 edges, 58083 markings/sec, 260 secs
lola: 22176681 markings, 189647881 edges, 60002 markings/sec, 265 secs
lola: 22501768 markings, 193101320 edges, 65017 markings/sec, 270 secs
lola: 22783406 markings, 196519595 edges, 56328 markings/sec, 275 secs
lola: 23345358 markings, 200047433 edges, 112390 markings/sec, 280 secs
lola: 23676116 markings, 203465009 edges, 66152 markings/sec, 285 secs
lola: 24261677 markings, 207046149 edges, 117112 markings/sec, 290 secs
lola: 24929175 markings, 210797257 edges, 133500 markings/sec, 295 secs
lola: 25401511 markings, 214482032 edges, 94467 markings/sec, 300 secs
lola: 25832445 markings, 218089995 edges, 86187 markings/sec, 305 secs
lola: 26326344 markings, 221757323 edges, 98780 markings/sec, 310 secs
lola: 26981441 markings, 225287491 edges, 131019 markings/sec, 315 secs
lola: 27453880 markings, 228800665 edges, 94488 markings/sec, 320 secs
lola: 27917804 markings, 232237350 edges, 92785 markings/sec, 325 secs
lola: 28342883 markings, 235708602 edges, 85016 markings/sec, 330 secs
lola: 28773717 markings, 239170272 edges, 86167 markings/sec, 335 secs
lola: 29176844 markings, 242525844 edges, 80625 markings/sec, 340 secs
lola: 29599064 markings, 245920895 edges, 84444 markings/sec, 345 secs
lola: 30036844 markings, 249316587 edges, 87556 markings/sec, 350 secs
lola: 30456189 markings, 252596846 edges, 83869 markings/sec, 355 secs
lola: 30956856 markings, 255776492 edges, 100133 markings/sec, 360 secs
lola: 31357672 markings, 258966348 edges, 80163 markings/sec, 365 secs
lola: 31752176 markings, 262105265 edges, 78901 markings/sec, 370 secs
lola: 32260294 markings, 265448167 edges, 101624 markings/sec, 375 secs
lola: 32642999 markings, 268759406 edges, 76541 markings/sec, 380 secs
lola: 33146534 markings, 271901999 edges, 100707 markings/sec, 385 secs
lola: 33537211 markings, 275373832 edges, 78135 markings/sec, 390 secs
lola: 34184618 markings, 278988176 edges, 129481 markings/sec, 395 secs
lola: 34622787 markings, 282712736 edges, 87634 markings/sec, 400 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((p306 <= p161))) U A (F ((2 <= p322)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (p306 <= p161)) U A(TRUE U (2 <= p322)))
lola: processed formula length: 51
lola: 3 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 45 markings, 178 edges
lola: ========================================
lola: subprocess 10 will run for 476 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p180 <= p220)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (p220 + 1 <= p180))))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 49 edges
lola: ========================================
lola: subprocess 11 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p110 <= p6) AND (E (G ((p198 <= 1))) OR (E (G ((3 <= p5))) AND ((p202 <= 1) AND (p293 + 1 <= p67)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p110 <= p6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p110 <= p6)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: processed formula with 1 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 12 will run for 714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p198 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= p198)))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 44 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((p340 <= p34))) OR A (F (E (G ((p27 <= p291))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 714 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p340 <= p34)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p34 + 1 <= p340)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 16786 markings, 66503 edges
lola: ========================================
lola: subprocess 13 will run for 952 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((p27 <= p291)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (p291 + 1 <= p27))))
lola: processed formula length: 42
lola: 3 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 45 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 952 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((p96 <= p183)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((p96 <= p183)))))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 44 edges
lola: ========================================
lola: subprocess 14 will run for 1429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F ((p159 + 1 <= p156))) OR (A (F ((p311 <= p34))) AND E (G ((3 <= p0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p156 <= p159)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p159 + 1 <= p156)))
lola: processed formula length: 33
lola: 13 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 45 markings, 44 edges
lola: ========================================
lola: subprocess 15 will run for 2858 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p34 + 1 <= p311)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p311 <= p34)))
lola: processed formula length: 28
lola: 13 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2858 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F (((1 <= p122) AND (3 <= p187)))) OR A (G ((p75 + 1 <= p122)))) AND (p1 <= p93))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2858 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p122) AND (3 <= p187))))
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 40 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-60a-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-60a-CTLCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p1 <= p93)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 <= p93)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 354 places; total mentions: 0
lola: closed formula file DES-PT-60a-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no unknown yes yes no no unknown no yes yes yes no unknown unknown
FORMULA DES-PT-60a-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-60a-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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="DES-PT-60a"
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/DES-PT-60a.tgz
mv DES-PT-60a 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 DES-PT-60a, 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 r058-smll-152646385700283"
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 ;