Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...................
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 3.5K 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.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 95K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is PolyORBNT-COL-S10J80, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-152673534300325
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527047625450


BK_STOP 1527047921374

--------------------
content from stderr:

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBNT-COL-S10J80 as instance name.
Using PolyORBNT as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1026335, 'Memory': 885.95, 'Tool': 'lola'}, {'Time': 1253843, 'Memory': 15950.38, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBNT-COL-S10J80...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBNT-COL-S10J80: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
PolyORBNT-COL-S10J80: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBNT-COL-S10J80 @ 3534 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3534 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 15274/65536 symbol table entries, 4901 collisions
lola: preprocessing...
lola: finding significant places
lola: 1694 places, 13580 transitions, 1502 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4378 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S10J80-CTLCardinality.task
lola: A (G (((((3 <= p1519) OR (1 <= p1410)) AND ((p1519 <= p353) OR (1 <= p598))) AND E (X ((p266 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 + p37 + p36 + p35 + p34 + p33 + p32 + p31 + p30 + p10 + p11 + p12 + p13 + p14 + p15 + p16 + p17 + p18 + p19 + p20 + p21 + p22 + p23 + p24 + p25 + p26 + p27 + p28 + p29 + p82)))))) : E (G (A (X ((p1610 + p1609 + p1608 + p1607 + p1606 + p1605 + p1604 + p1603 + p1602 + p1601 + p1600 + p1531 + p1532 + p1533 + p1534 + p1535 + p1536 + p1537 + p1538 + p1539 + p1540 + p1541 + p1542 + p1543 + p1544 + p1545 + p1546 + p1547 + p1548 + p1549 + p1550 + p1551 + p1552 + p1553 + p1554 + p1555 + p1556 + p1557 + p1558 + p1559 + p1560 + p1561 + p1562 + p1563 + p1564 + p1565 + p1566 + p1567 + p1568 + p1569 + p1570 + p1571 + p1572 + p1573 + p1574 + p1575 + p1576 + p1577 + p1578 + p1579 + p1580 + p1581 + p1582 + p1583 + p1584 + p1585 + p1586 + p1587 + p1588 + p1589 + p1590 + p1591 + p1592 + p1593 + p1594 + p1595 + p1596 + p1597 + p1598 + p1599 + p1611 <= 0))))) : (E (F ((1 <= p179))) AND NOT(E (F ((p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 <= p1614 + p1613 + p1615 + p1616 + p1617 + p1618 + p1619 + p1620 + p1621 + p1622 + p1623 + p1624 + p1625 + p1626 + p1627 + p1628 + p1629 + p1630 + p1631 + p1632 + p1633 + p1634 + p1635 + p1636 + p1637 + p1638 + p1639 + p1640 + p1641 + p1642 + p1643 + p1644 + p1645 + p1646 + p1647 + p1648 + p1649 + p1650 + p1651 + p1652 + p1653 + p1654 + p1655 + p1656 + p1657 + p1658 + p1659 + p1660 + p1661 + p1662 + p1663 + p1664 + p1665 + p1666 + p1667 + p1668 + p1669 + p1670 + p1671 + p1672 + p1673 + p1674 + p1675 + p1676 + p1677 + p1678 + p1679 + p1680 + p1681 + p1682 + p1683 + p1684 + p1685 + p1686 + p1687 + p1688 + p1689 + p1690 + p1691 + p1692 + p1693))))) : A (F (((p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 <= p353) AND (2 <= p1409)))) : A (F ((A (G ((3 <= p1))) AND (p1519 <= p181)))) : (((p183 <= p83) AND E (G ((p350 + 1 <= p181)))) OR (3 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264)) : E (X (E (F ((p348 <= p266))))) : A (G (E (G ((p100 + p101 + p102 + p103 + p104 + p105 + p106 + p107 + p108 + p109 + p110 + p111 + p112 + p113 + p114 + p115 + p116 + p117 + p118 + p119 + p120 + p121 + p122 + p123 + p124 + p125 + p126 + p127 + p128 + p129 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 + p158 + p159 + p160 + p161 + p162 + p163 + p164 + p165 + p166 + p167 + p168 + p169 + p170 + p171 + p172 + p173 + p174 + p175 + p176 + p177 + p97 + p98 + p99 <= p355 + p356 + p357 + p358 + p359 + p360 + p361 + p362 + p363 + p364 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p372 + p373 + p374 + p375 + p376 + p377 + p378 + p379 + p380 + p381 + p382 + p383 + p384 + p385 + p386 + p387 + p388 + p389 + p390 + p391 + p392 + p393 + p394 + p395 + p396 + p397 + p398 + p399 + p405 + p406 + p407 + p408 + p409 + p410 + p411 + p412 + p413 + p414 + p415 + p416 + p417 + p418 + p419 + p420 + p421 + p422 + p423 + p424 + p425 + p426 + p427 + p428 + p429 + p430 + p431 + p432 + p433 + p434 + p435 + p404 + p403 + p402 + p401 + p400))))) : A (((p179 <= p85) U (3 <= p1409))) : E (X ((((p436 + p437 + p438 + p439 + p440 + p441 + p442 + p443 + p444 + p445 + p446 + p447 + p448 + p449 + p450 + p451 + p452 + p453 + p454 + p455 + p456 + p457 + p458 + p459 + p460 + p461 + p462 + p463 + p464 + p465 + p466 + p467 + p468 + p469 + p470 + p471 + p472 + p473 + p474 + p475 + p476 + p477 + p478 + p479 + p480 + p481 + p482 + p483 + p484 + p485 + p486 + p487 + p488 + p489 + p490 + p491 + p492 + p493 + p494 + p495 + p496 + p497 + p498 + p499 + p500 + p501 + p502 + p503 + p504 + p505 + p506 + p507 + p508 + p509 + p510 + p511 + p512 + p513 + p514 + p515 + p516 + p517 + p518 + p519 + p520 + p521 + p522 + p523 + p524 + p525 + p526 + p527 + p528 + p529 + p530 + p531 + p532 + p533 + p534 + p535 + p536 + p537 + p538 + p539 + p540 + p541 + p542 + p543 + p544 + p545 + p546 + p547 + p548 + p549 + p550 + p551 + p552 + p553 + p554 + p555 + p556 + p557 + p558 + p559 + p560 + p561 + p562 + p563 + p564 + p565 + p566 + p567 + p568 + p569 + p570 + p571 + p572 + p573 + p574 + p575 + p576 + p577 + p578 + p579 + p580 + p581 + p582 + p583 + p584 + p585 + p586 + p587 + p588 + p589 + p590 + p591 + p592 + p593 + p594 + p595 + p596 + p597 <= p1412) AND (1 <= p1411) AND (p83 <= p179)) OR A (F ((2 <= p350)))))) : A (G (E (F (((3 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264) AND (p1412 <= p351)))))) : (((((p1508 <= p1413) AND (1 <= p354)) AND E (F ((p178 <= p348)))) AND (p1427 + p1428 + p1429 + p1430 + p1431 + p1432 + p1433 + p1434 + p1435 + p1436 + p1437 + p1438 + p1439 + p1440 + p1441 + p1442 + p1443 + p1444 + p1445 + p1446 + p1447 + p1448 + p1449 + p1450 + p1451 + p1452 + p1453 + p1454 + p1455 + p1456 + p1457 + p1458 + p1459 + p1460 + p1461 + p1462 + p1463 + p1464 + p1465 + p1466 + p1467 + p1468 + p1469 + p1470 + p1471 + p1472 + p1473 + p1474 + p1475 + p1476 + p1477 + p1478 + p1479 + p1480 + p1481 + p1482 + p1483 + p1484 + p1485 + p1486 + p1487 + p1488 + p1489 + p1490 + p1491 + p1492 + p1493 + p1494 + p1495 + p1496 + p1497 + p1498 + p1499 + p1500 + p1501 + p1502 + p1503 + p1504 + p1505 + p1506 + p1507 + 1 <= p349)) OR E (X (E (F ((p354 <= p1413)))))) : A (G (NOT(E (G ((p84 <= p1415 + p1416 + p1417 + p1418 + p1419 + p1420 + p1421 + p1422 + p1423 + p1424)))))) : A (X (E (G ((3 <= p348))))) : (E (((1 <= p83) U ((3 <= p182) AND (3 <= p1)))) OR A (G (E (F ((p178 <= p1425)))))) : E (F ((3 <= p349)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((3 <= p1519) OR (1 <= p1410)) AND ((p1519 <= p353) OR (1 <= p598))) AND E (X ((p266 <= p2 + p3 + p4 + p5 + p6 + p7 + p8 + p9 + p81 + p80 + p79 + p78 + p77 + p76 + p75 + p74 + p73 + p72 + p71 + p70 + p69 + p68 + p67 + p66 + p65 + p64 + p63 + p62 + p61 + p60 + p59 + p58 + p57 + p56 + p55 + p54 + p53 + p52 + p51 + p50 + p49 + p48 + p47 + p46 + p45 + p44 + p43 + p42 + p41 + p40 + p39 + p38 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= p1519) OR (1 <= p1410)) AND ((p1519 <= p353) OR (1 <= p598)))))
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 6008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J80-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J80-CTLCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 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: E (G (A (X ((p1610 + p1609 + p1608 + p1607 + p1606 + p1605 + p1604 + p1603 + p1602 + p1601 + p1600 + p1531 + p1532 + p1533 + p1534 + p1535 + p1536 + p1537 + p1538 + p1539 + p1540 + p1541 + p1542 + p1543 + p1544 + p1545 + p1546 + p1547 + p1548 + p1549 + p1550 + p1551 + p1552 + p1553 + p1554 + p1555 + p1556 + p1557 + p1558 + p1559 + p1560 + p1561 + p1562 + p1563 + p1564 + p1565 + p1566 + p1567 + p15... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(AX((p1610 + p1609 + p1608 + p1607 + p1606 + p1605 + p1604 + p1603 + p1602 + p1601 + p1600 + p1531 + p1532 + p1533 + p1534 + p1535 + p1536 + p1537 + p1538 + p1539 + p1540 + p1541 + p1542 + p1543 + p1544 + p1545 + p1546 + p1547 + p1548 + p1549 + p1550 + p1551 + p1552 + p1553 + p1554 + p1555 + p1556 + p1557 + p1558 + p1559 + p1560 + p1561 + p1562 + p1563 + p1564 + p1565 + p1566 + p15... (shortened)
lola: processed formula length: 676
lola: 2 rewrites
lola: formula mentions 0 of 1694 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((1 <= p179))) AND NOT(E (F ((p86 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 <= p1614 + p1613 + p1615 + p1616 + p1617 + p1618 + p1619 + p1620 + p1621 + p1622 + p1623 + p1624 + p1625 + p1626 + p1627 + p1628 + p1629 + p1630 + p1631 + p1632 + p1633 + p1634 + p1635 + p1636 + p1637 + p1638 + p1639 + p1640 + p1641 + p1642 + p1643 + p1644 + p1645 + p1646 + p1647 + p1648 + p1649 + p1650 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p179)))
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 6008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J80-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J80-CTLCardinality-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1614 + p1613 + p1615 + p1616 + p1617 + p1618 + p1619 + p1620 + p1621 + p1622 + p1623 + p1624 + p1625 + p1626 + p1627 + p1628 + p1629 + p1630 + p1631 + p1632 + p1633 + p1634 + p1635 + p1636 + p1637 + p1638 + p1639 + p1640 + p1641 + p1642 + p1643 + p1644 + p1645 + p1646 + p1647 + p1648 + p1649 + p1650 + p1651 + p1652 + p1653 + p1654 + p1655 + p1656 + p1657 + p1658 + p1659 + p1660 + p1661 + p... (shortened)
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 6008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-COL-S10J80-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J80-CTLCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + p250 + p251 + p252 + p253 + p254 + p255 + p256 + p257 + p258 + p259 + p260 + p261 + p262 + p263 + p264 <= p353) AND (2 <= p1409))))
lola: processed formula: A (F (((p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + ... (shortened)
lola: processed formula length: 601
lola: 0 rewrites
lola: formula mentions 0 of 1694 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J80-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6012 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 18 markings, 18 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((3 <= p1))) AND (p1519 <= p181))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A (G ((3 <= p1))) AND (p1519 <= p181))))
lola: processed formula: A (F ((A (G ((3 <= p1))) AND (p1519 <= p181))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 1694 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J80-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6012 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 19 markings, 19 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p183 <= p83) AND E (G ((p350 + 1 <= p181)))) OR (3 <= p184 + p185 + p186 + p187 + p188 + p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p183 <= p83)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p183 <= p83)
lola: processed formula length: 13
lola: 0 rewrites
lola: formula mentions 0 of 1694 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J80-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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p350 + 1 <= p181)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p181 <= p350)))
lola: processed formula length: 29
lola: 2 rewrites
lola: formula mentions 0 of 1694 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 18 markings, 17 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((p348 <= p266)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (p348 <= p266)))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 1694 places; total mentions: 0
lola: closed formula file PolyORBNT-COL-S10J80-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6008 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 174199 markings, 425864 edges, 3689329903141912576 markings/sec, 0 secs
lola: 350375 markings, 857321 edges, 35235 markings/sec, 5 secs
lola: 524606 markings, 1283419 edges, 34846 markings/sec, 10 secs
lola: 694691 markings, 1698309 edges, 34017 markings/sec, 15 secs
lola: 861560 markings, 2107766 edges, 33374 markings/sec, 20 secs
lola: 992002 markings, 2594621 edges, 26088 markings/sec, 25 secs
lola: 1093601 markings, 3009255 edges, 20320 markings/sec, 30 secs
lola: 1210207 markings, 3366793 edges, 23321 markings/sec, 35 secs
lola: 1339436 markings, 3770104 edges, 25846 markings/sec, 40 secs
lola: 1478726 markings, 4178964 edges, 27858 markings/sec, 45 secs
lola: 1628357 markings, 4545046 edges, 29926 markings/sec, 50 secs
lola: 1780375 markings, 4916760 edges, 30404 markings/sec, 55 secs
lola: 1935548 markings, 5294255 edges, 31035 markings/sec, 60 secs
lola: 2091095 markings, 5677271 edges, 31109 markings/sec, 65 secs
lola: 2247927 markings, 6059138 edges, 31366 markings/sec, 70 secs
lola: 2350135 markings, 6576299 edges, 20442 markings/sec, 75 secs
lola: 2484426 markings, 6865948 edges, 26858 markings/sec, 80 secs
lola: 2621898 markings, 7162818 edges, 27494 markings/sec, 85 secs
lola: 2763580 markings, 7467338 edges, 28336 markings/sec, 90 secs
lola: 2905273 markings, 7773849 edges, 28339 markings/sec, 95 secs
lola: 3055923 markings, 8098088 edges, 30130 markings/sec, 100 secs
lola: 3207998 markings, 8425130 edges, 30415 markings/sec, 105 secs
lola: 3362374 markings, 8758128 edges, 30875 markings/sec, 110 secs
lola: 3517782 markings, 9093642 edges, 31082 markings/sec, 115 secs
lola: 3674048 markings, 9430816 edges, 31253 markings/sec, 120 secs
lola: 3791893 markings, 9805140 edges, 23569 markings/sec, 125 secs
lola: 3878565 markings, 10162023 edges, 17334 markings/sec, 130 secs
lola: 3980649 markings, 10458597 edges, 20417 markings/sec, 135 secs
lola: 4094438 markings, 10788456 edges, 22758 markings/sec, 140 secs
lola: 4214286 markings, 11136522 edges, 23970 markings/sec, 145 secs
lola: 4338031 markings, 11495265 edges, 24749 markings/sec, 150 secs
lola: 4434051 markings, 11853078 edges, 19204 markings/sec, 155 secs
lola: 4545517 markings, 12195623 edges, 22293 markings/sec, 160 secs
lola: 4668254 markings, 12572413 edges, 24547 markings/sec, 165 secs
lola: 4769120 markings, 12945372 edges, 20173 markings/sec, 170 secs
lola: 4872175 markings, 13244559 edges, 20611 markings/sec, 175 secs
lola: 4986739 markings, 13577047 edges, 22913 markings/sec, 180 secs
lola: 5110072 markings, 13934664 edges, 24667 markings/sec, 185 secs
lola: 5237077 markings, 14303637 edges, 25401 markings/sec, 190 secs
lola: 5325023 markings, 14659472 edges, 17589 markings/sec, 195 secs
lola: 5422891 markings, 15012302 edges, 19574 markings/sec, 200 secs
lola: 5547901 markings, 15379811 edges, 25002 markings/sec, 205 secs
lola: 5687913 markings, 15723177 edges, 28002 markings/sec, 210 secs
lola: 5827913 markings, 16066068 edges, 28000 markings/sec, 215 secs
lola: 5971788 markings, 16415326 edges, 28775 markings/sec, 220 secs
lola: 6117589 markings, 16774293 edges, 29160 markings/sec, 225 secs
lola: 6225944 markings, 17039871 edges, 21671 markings/sec, 230 secs
lola: 6225957 markings, 17039913 edges, 3 markings/sec, 235 secs
lola: 6226427 markings, 17041202 edges, 94 markings/sec, 240 secs
lola: 6227058 markings, 17042941 edges, 126 markings/sec, 245 secs
lola: 6227156 markings, 17043214 edges, 20 markings/sec, 250 secs
lola: 6227173 markings, 17043256 edges, 3 markings/sec, 255 secs
lola: 6227188 markings, 17043297 edges, 3 markings/sec, 260 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '\ufffd'
Aborted (core dumped)
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBNT-COL-S10J80-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- 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="PolyORBNT-COL-S10J80"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J80.tgz
mv PolyORBNT-COL-S10J80 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is PolyORBNT-COL-S10J80, 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 r131-smll-152673534300325"
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 ;