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 644K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K 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 5.9K 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 9.7K 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 8.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 479K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DLCround-PT-08a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-152649742800073
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526667510624


BK_STOP 1526668295148

--------------------
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 DLCround-PT-08a as instance name.
Using DLCround 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': False, 'Source Transition': False, 'Sink Transition': False, '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': 5079, 'Memory': 326.25, 'Tool': 'itstools'}, {'Time': 223642, 'Memory': 4096.14, 'Tool': 'gspn'}, {'Time': 573383, 'Memory': 4388.86, 'Tool': 'marcie'}, {'Time': 2190334, 'Memory': 15950.03, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 431.253002559559x far from the best tool itstools.
CTLCardinality lola DLCround-PT-08a...

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


checking for too many tokens
===========================================================================================
DLCround-PT-08a: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ DLCround-PT-08a @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 139 (ignored)
----- 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: 2170/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 263 places, 1907 transitions, 106 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1668 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-08a-CTLCardinality.task
lola: ((E (F ((3 <= p128))) AND E (F (((3 <= p172) OR (3 <= p203))))) OR E (X (((p185 + 1 <= p255) OR (p227 <= 0))))) : ((((p31 <= p195) OR A (F ((p62 <= p117)))) OR A (G ((p241 <= 2)))) AND E (((p42 <= 1) U ((3 <= p184) AND (p194 <= p231))))) : (E (((p24 <= 0) U ((p97 <= p258) AND (3 <= p88)))) AND E (F (E (X (TRUE))))) : NOT((E (X ((p45 <= p46))) AND NOT(A (G ((p21 <= p232)))))) : (NOT(E (G (((2 <= p24) AND (p160 <= p55))))) AND A (G ((p197 <= p125)))) : ((NOT(E (F ((2 <= p262)))) AND E (F (((2 <= p193) OR (1 <= p164))))) AND E (F (((p99 <= 2) OR (p140 + 1 <= p223))))) : A (G (E (X (((p127 <= p164) OR (1 <= p189)))))) : E (F ((((p122 <= p97) AND (p253 + 1 <= p199)) AND E (X ((2 <= p182)))))) : E (F (A (G (((2 <= p83) OR (p121 <= p212)))))) : E (F (NOT(E (F ((1 <= p200)))))) : (NOT(NOT(A (G ((p63 <= p237))))) OR (((1 <= p47) OR A (X ((p55 <= p236)))) AND ((1 <= p258) AND (p84 <= p104) AND (p127 <= p96) AND (p172 <= p187) AND (p183 <= p115)))) : E ((E (X ((p169 <= p234))) U ((p66 <= p141) AND (2 <= p253) AND (1 <= p151) AND (p130 <= p47)))) : E ((((1 <= p197) OR (3 <= p114) OR (3 <= p190) OR (p192 <= p248)) U (((2 <= p257) AND (p238 <= p100)) OR ((3 <= p141) AND (p10 <= p53))))) : (NOT(E (F (((1 <= p160) AND (2 <= p242))))) AND A (F (((p92 <= 1) AND (p28 <= 0))))) : A (G (E (X (((p228 <= p198) OR (p108 <= p100)))))) : E (((p56 <= p225) U E (X ((2 <= p260)))))
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 <= p128))) AND E (F (((3 <= p172) OR (3 <= p203))))) OR E (X (((p185 + 1 <= p255) OR (p227 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= 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 16 bytes per marking, with 22 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 unreachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((p185 + 1 <= p255) OR (p227 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p185 + 1 <= p255) OR (p227 <= 0)))
lola: processed formula length: 40
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 22 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p31 <= p195) OR A (F ((p62 <= p117)))) OR A (G ((p241 <= 2)))) AND E (((p42 <= 1) U ((3 <= p184) AND (p194 <= p231)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p31 <= p195)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p31 <= p195)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p42 <= 1) U ((3 <= p184) AND (p194 <= p231))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p42 <= 1) U ((3 <= p184) AND (p194 <= p231)))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 22 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: 153980 markings, 6556565 edges, 30783 markings/sec, 0 secs
lola: 317640 markings, 13468189 edges, 32732 markings/sec, 5 secs
lola: 474025 markings, 20129860 edges, 31277 markings/sec, 10 secs
lola: 627858 markings, 26641229 edges, 30767 markings/sec, 15 secs
lola: 780128 markings, 33117632 edges, 30454 markings/sec, 20 secs
lola: 932028 markings, 39499461 edges, 30380 markings/sec, 25 secs
lola: 1081188 markings, 45881281 edges, 29832 markings/sec, 30 secs
lola: 1232371 markings, 52399387 edges, 30237 markings/sec, 35 secs
lola: 1381028 markings, 59162287 edges, 29731 markings/sec, 40 secs
lola: 1528801 markings, 65770200 edges, 29555 markings/sec, 45 secs
lola: 1676373 markings, 72393338 edges, 29514 markings/sec, 50 secs
lola: 1819374 markings, 78821356 edges, 28600 markings/sec, 55 secs
lola: 1959764 markings, 85178539 edges, 28078 markings/sec, 60 secs
lola: 2101535 markings, 91594775 edges, 28354 markings/sec, 65 secs
lola: 2248379 markings, 98207330 edges, 29369 markings/sec, 70 secs
lola: 2399691 markings, 104707540 edges, 30262 markings/sec, 75 secs
lola: 2547145 markings, 111015323 edges, 29491 markings/sec, 80 secs
lola: 2686605 markings, 117338373 edges, 27892 markings/sec, 85 secs
lola: 2830008 markings, 123796289 edges, 28681 markings/sec, 90 secs
lola: 2971324 markings, 130187601 edges, 28263 markings/sec, 95 secs
lola: 3112278 markings, 136564843 edges, 28191 markings/sec, 100 secs
lola: 3254126 markings, 142832085 edges, 28370 markings/sec, 105 secs
lola: 3392684 markings, 149103859 edges, 27712 markings/sec, 110 secs
lola: 3541283 markings, 155762803 edges, 29720 markings/sec, 115 secs
lola: 3690342 markings, 162508998 edges, 29812 markings/sec, 120 secs
lola: 3837412 markings, 169104111 edges, 29414 markings/sec, 125 secs
lola: 3983051 markings, 175647282 edges, 29128 markings/sec, 130 secs
lola: 4130311 markings, 182225860 edges, 29452 markings/sec, 135 secs
lola: 4273454 markings, 188699029 edges, 28629 markings/sec, 140 secs
lola: 4416494 markings, 195047666 edges, 28608 markings/sec, 145 secs
lola: 4564097 markings, 201633897 edges, 29521 markings/sec, 150 secs
lola: 4705562 markings, 208045221 edges, 28293 markings/sec, 155 secs
lola: 4856220 markings, 214464150 edges, 30132 markings/sec, 160 secs
lola: 4999426 markings, 220929137 edges, 28641 markings/sec, 165 secs
lola: 5140384 markings, 227303279 edges, 28192 markings/sec, 170 secs
lola: 5280659 markings, 233660470 edges, 28055 markings/sec, 175 secs
lola: 5420204 markings, 240026865 edges, 27909 markings/sec, 180 secs
lola: 5566824 markings, 246324941 edges, 29324 markings/sec, 185 secs
lola: 5706184 markings, 252666911 edges, 27872 markings/sec, 190 secs
lola: 5845931 markings, 258988965 edges, 27949 markings/sec, 195 secs
lola: 5985857 markings, 265258843 edges, 27985 markings/sec, 200 secs
lola: 6122893 markings, 271534394 edges, 27407 markings/sec, 205 secs
lola: 6262970 markings, 277829810 edges, 28015 markings/sec, 210 secs
lola: 6404014 markings, 284131225 edges, 28209 markings/sec, 215 secs
lola: 6541657 markings, 290376017 edges, 27529 markings/sec, 220 secs
lola: 6682233 markings, 296711780 edges, 28115 markings/sec, 225 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 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((p24 <= 0) U ((p97 <= p258) AND (3 <= p88)))) AND E (F (E (X (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p24 <= 0) U ((p97 <= p258) AND (3 <= p88)))
lola: processed formula length: 46
lola: 7 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 22 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: 185481 markings, 6850400 edges, 3689329903141912576 markings/sec, 0 secs
lola: 371863 markings, 13757080 edges, 37276 markings/sec, 5 secs
lola: 553199 markings, 20457401 edges, 36267 markings/sec, 10 secs
lola: 732579 markings, 27053890 edges, 35876 markings/sec, 15 secs
lola: 908928 markings, 33658812 edges, 35270 markings/sec, 20 secs
lola: 1083428 markings, 40543112 edges, 34900 markings/sec, 25 secs
lola: 1256040 markings, 47245568 edges, 34522 markings/sec, 30 secs
lola: 1425493 markings, 53936885 edges, 33891 markings/sec, 35 secs
lola: 1594286 markings, 60578278 edges, 33759 markings/sec, 40 secs
lola: 1767946 markings, 67352170 edges, 34732 markings/sec, 45 secs
lola: 1942714 markings, 74185449 edges, 34954 markings/sec, 50 secs
lola: 2113925 markings, 80885910 edges, 34242 markings/sec, 55 secs
lola: 2280387 markings, 87449841 edges, 33292 markings/sec, 60 secs
lola: 2445669 markings, 94004724 edges, 33056 markings/sec, 65 secs
lola: 2614237 markings, 100586756 edges, 33714 markings/sec, 70 secs
lola: 2782792 markings, 107194493 edges, 33711 markings/sec, 75 secs
lola: 2956952 markings, 113745060 edges, 34832 markings/sec, 80 secs
lola: 3124037 markings, 120196419 edges, 33417 markings/sec, 85 secs
lola: 3292040 markings, 126565693 edges, 33601 markings/sec, 90 secs
lola: 3453577 markings, 132899261 edges, 32307 markings/sec, 95 secs
lola: 3638446 markings, 139719538 edges, 36974 markings/sec, 100 secs
lola: 3833910 markings, 146447271 edges, 39093 markings/sec, 105 secs
lola: 4022067 markings, 153000897 edges, 37631 markings/sec, 110 secs
lola: 4213747 markings, 159555181 edges, 38336 markings/sec, 115 secs
lola: 4400526 markings, 166013854 edges, 37356 markings/sec, 120 secs
lola: 4592308 markings, 172595945 edges, 38356 markings/sec, 125 secs
lola: 4781907 markings, 178990289 edges, 37920 markings/sec, 130 secs
lola: 4962448 markings, 185335350 edges, 36108 markings/sec, 135 secs
lola: 5149055 markings, 191717995 edges, 37321 markings/sec, 140 secs
lola: 5328860 markings, 197968585 edges, 35961 markings/sec, 145 secs
lola: 5513133 markings, 204201429 edges, 36855 markings/sec, 150 secs
lola: 5692253 markings, 210494050 edges, 35824 markings/sec, 155 secs
lola: 5876449 markings, 216756839 edges, 36839 markings/sec, 160 secs
lola: 6055815 markings, 222994593 edges, 35873 markings/sec, 165 secs
lola: 6229435 markings, 229124757 edges, 34724 markings/sec, 170 secs
lola: 6405164 markings, 235270584 edges, 35146 markings/sec, 175 secs
lola: 6582224 markings, 241398869 edges, 35412 markings/sec, 180 secs
lola: 6763449 markings, 247639758 edges, 36245 markings/sec, 185 secs
lola: 6948752 markings, 254056539 edges, 37061 markings/sec, 190 secs
lola: 7134494 markings, 260482276 edges, 37148 markings/sec, 195 secs
lola: 7311567 markings, 266665575 edges, 35415 markings/sec, 200 secs
lola: 7483372 markings, 272785063 edges, 34361 markings/sec, 205 secs
lola: 7660594 markings, 279030940 edges, 35444 markings/sec, 210 secs
lola: 7842008 markings, 285079523 edges, 36283 markings/sec, 215 secs
lola: 8013520 markings, 291145751 edges, 34302 markings/sec, 220 secs
lola: 8192678 markings, 298003892 edges, 35832 markings/sec, 225 secs
lola: 8367640 markings, 304822566 edges, 34992 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (X ((p45 <= p46))) AND NOT(A (G ((p21 <= p232))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p46 + 1 <= p45)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p46 + 1 <= p45)))
lola: processed formula: A (X ((p46 + 1 <= p45)))
lola: processed formula length: 24
lola: 10 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p21 <= p232)))
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 16 bytes per marking, with 22 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 DLCround-PT-08a-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-08a-CTLCardinality-4.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (G (((2 <= p24) AND (p160 <= p55))))) AND A (G ((p197 <= p125))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p24 <= 1) OR (p55 + 1 <= p160))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p24 <= 1) OR (p55 + 1 <= p160))))
lola: processed formula: A (F (((p24 <= 1) OR (p55 + 1 <= p160))))
lola: processed formula length: 42
lola: 3 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 21 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p197 <= p125)))
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 16 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to DLCround-PT-08a-CTLCardinality-5.sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (F ((2 <= p262)))) AND E (F (((2 <= p193) OR (1 <= p164))))) AND E (F (((p99 <= 2) OR (p140 + 1 <= p223)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 278 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p262 <= 1)))
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 16 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: ========================================
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 DLCround-PT-08a-CTLCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2 markings, 1 edges
sara: lola: try reading problem file DLCround-PT-08a-CTLCardinality-5.sara.
========================================
lola: subprocess 6 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p193) OR (1 <= p164))))
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 16 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-08a-CTLCardinality-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 7 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p99 <= 2) OR (p140 + 1 <= p223))))
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 16 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to DLCround-PT-08a-CTLCardinality-7.sara
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 6 will run for 306 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (((p127 <= p164) OR (1 <= p189))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(((p127 <= p164) OR (1 <= p189))))))
lola: processed formula length: 56
lola: 2 rewrites
lola: formula mentions 0 of 263 places; total mentions: 0
lola: closed formula file DLCround-PT-08a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 22 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).
sara: try reading problem file DLCround-PT-08a-CTLCardinality-7.sara.
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic

lola: 138040 markings, 5878243 edges, 3689348869717491712 markings/sec, 0 secs
lola: 277780 markings, 11726580 edges, 27948 markings/sec, 5 secs
lola: 409408 markings, 17406716 edges, 26326 markings/sec, 10 secs
lola: 541759 markings, 23018313 edges, 26470 markings/sec, 15 secs
lola: 672773 markings, 28564609 edges, 26203 markings/sec, 20 secs
lola: 803096 markings, 34067882 edges, 26065 markings/sec, 25 secs
lola: 933640 markings, 39568713 edges, 26109 markings/sec, 30 secs
lola: 1062280 markings, 45068472 edges, 25728 markings/sec, 35 secs
lola: 1190977 markings, 50580093 edges, 25739 markings/sec, 40 secs
lola: 1321165 markings, 56467895 edges, 26038 markings/sec, 45 secs
lola: 1449347 markings, 62214688 edges, 25636 markings/sec, 50 secs
lola: 1576696 markings, 67924951 edges, 25470 markings/sec, 55 secs
lola: 1702425 markings, 73590156 edges, 25146 markings/sec, 60 secs
lola: 1826253 markings, 79130165 edges, 24766 markings/sec, 65 secs
lola: 1949218 markings, 84687490 edges, 24593 markings/sec, 70 secs
lola: 2071324 markings, 90204439 edges, 24421 markings/sec, 75 secs
lola: 2196476 markings, 95838970 edges, 25030 markings/sec, 80 secs
lola: 2322847 markings, 101391448 edges, 25274 markings/sec, 85 secs
lola: 2449030 markings, 106834655 edges, 25237 markings/sec, 90 secs
lola: 2573364 markings, 112183880 edges, 24867 markings/sec, 95 secs
lola: 2692439 markings, 117597212 edges, 23815 markings/sec, 100 secs
lola: 2815407 markings, 123131721 edges, 24594 markings/sec, 105 secs
lola: 2935464 markings, 128590527 edges, 24011 markings/sec, 110 secs
lola: 3057902 markings, 134119747 edges, 24488 markings/sec, 115 secs
lola: 3179289 markings, 139463934 edges, 24277 markings/sec, 120 secs
lola: 3297255 markings, 144792421 edges, 23593 markings/sec, 125 secs
lola: 3416447 markings, 150187256 edges, 23838 markings/sec, 130 secs
lola: 3544798 markings, 155927344 edges, 25670 markings/sec, 135 secs
lola: 3672093 markings, 161688011 edges, 25459 markings/sec, 140 secs
lola: 3797233 markings, 167315532 edges, 25028 markings/sec, 145 secs
lola: 3922166 markings, 172907615 edges, 24987 markings/sec, 150 secs
lola: 4046788 markings, 178462974 edges, 24924 markings/sec, 155 secs
lola: 4169796 markings, 184022011 edges, 24602 markings/sec, 160 secs
lola: 4289930 markings, 189438695 edges, 24027 markings/sec, 165 secs
lola: 4411744 markings, 194849409 edges, 24363 markings/sec, 170 secs
lola: 4539797 markings, 200508082 edges, 25611 markings/sec, 175 secs
lola: 4662539 markings, 206094215 edges, 24548 markings/sec, 180 secs
lola: 4791641 markings, 211657247 edges, 25820 markings/sec, 185 secs
lola: 4915350 markings, 217148587 edges, 24742 markings/sec, 190 secs
lola: 5037014 markings, 222624792 edges, 24333 markings/sec, 195 secs
lola: 5156897 markings, 228053143 edges, 23977 markings/sec, 200 secs
lola: 5276315 markings, 233463984 edges, 23884 markings/sec, 205 secs
lola: 5393447 markings, 238786083 edges, 23426 markings/sec, 210 secs
lola: 5514748 markings, 244103218 edges, 24260 markings/sec, 215 secs
lola: 5634097 markings, 249386170 edges, 23870 markings/sec, 220 secs
lola: 5751437 markings, 254723538 edges, 23468 markings/sec, 225 secs
lola: 5870898 markings, 260042016 edges, 23892 markings/sec, 230 secs
lola: 5988173 markings, 265360161 edges, 23455 markings/sec, 235 secs
lola: 6104962 markings, 270689620 edges, 23358 markings/sec, 240 secs
lola: 6220715 markings, 275964551 edges, 23151 markings/sec, 245 secs
lola: 6340028 markings, 281234892 edges, 23863 markings/sec, 250 secs
lola: 6456443 markings, 286487551 edges, 23283 markings/sec, 255 secs
lola: 6573263 markings, 291756250 edges, 23364 markings/sec, 260 secs
lola: 6691912 markings, 297135855 edges, 23730 markings/sec, 265 secs
lola: 6816936 markings, 302788011 edges, 25005 markings/sec, 270 secs
lola: 6934502 markings, 308158849 edges, 23513 markings/sec, 275 secs
lola: 7066221 markings, 313663422 edges, 26344 markings/sec, 280 secs
lola: 7204700 markings, 319216666 edges, 27696 markings/sec, 285 secs
lola: 7342807 markings, 324681544 edges, 27621 markings/sec, 290 secs
lola: 7478128 markings, 330040583 edges, 27064 markings/sec, 295 secs
lola: 7614157 markings, 335442408 edges, 27206 markings/sec, 300 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
Segmentation fault (core dumped)
FORMULA DLCround-PT-08a-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-08a-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished 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="DLCround-PT-08a"
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/DLCround-PT-08a.tgz
mv DLCround-PT-08a 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 DLCround-PT-08a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-smll-152649742800073"
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 ;