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 964K
-rw-r--r-- 1 mcc users 4.1K 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.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 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.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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 804K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Echo-PT-d02r15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-blw3-152649949800437
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527424342830


BK_STOP 1527424915609

--------------------
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 Echo-PT-d02r15 as instance name.
Using Echo 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': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1219224, 'Memory': 15945.28, 'Tool': 'lola'}, {'Time': 3540101, 'Memory': 12757.46, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola Echo-PT-d02r15...

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


checking for too many tokens
===========================================================================================
Echo-PT-d02r15: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ Echo-PT-d02r15 @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 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: 3801/65536 symbol table entries, 7 collisions
lola: preprocessing...
lola: finding significant places
lola: 2127 places, 1674 transitions, 1062 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3336 transition conflict sets
lola: TASK
lola: reading formula from Echo-PT-d02r15-CTLCardinality.task
lola: ((E (F (((2 <= p2030) OR (3 <= p1442)))) OR ((p1700 + 1 <= p568) AND (2 <= p981) AND ((p1694 <= p458) OR (1 <= p997) OR (p233 + 1 <= p1053)))) AND A (X (((p776 + 1 <= p2041) AND (p712 <= 2))))) : A ((((p905 <= p1445) OR (p527 <= 0)) U E (G ((1 <= p1621))))) : (A (G ((p567 <= p1197))) AND A (F (E (F ((p458 <= p2063)))))) : E (F (E (X ((1 <= p1584))))) : (A (G (((3 <= p106) OR (p147 <= p1850) OR ((p156 <= p1058) AND (3 <= p397))))) OR ((2 <= p1363) OR A (G (((p1454 <= p123) OR (2 <= p1176)))))) : (A (G (A (G ((1 <= p2012))))) OR ((((p365 + 1 <= p494) AND (p697 <= p1394)) OR (p409 + 1 <= p1287)) OR (E (G ((1 <= p2119))) AND E (X ((2 <= p1867)))))) : E (X (A (G ((p714 <= p952))))) : E ((E (G ((p1363 <= p1619))) U (((1 <= p748) OR (1 <= p8)) AND (p1259 <= p1816)))) : ((1 <= p320) OR A (F (A (G ((p1116 <= p1540)))))) : E (F (E (G ((p187 <= p1552))))) : E (G (E (((p1637 <= p3) U (p1866 <= p1469))))) : ((((1 <= p890) AND (p671 <= p421) AND ((1 <= p867) OR (2 <= p782)) AND (1 <= p2071) AND (1 <= p522) AND (p1454 <= p207) AND (p744 <= p1641)) OR (1 <= p1236)) OR E (F ((((3 <= p1243) AND (p229 <= p1088)) OR (p1705 + 1 <= p411))))) : (A (F (((p901 + 1 <= p206) AND (p781 <= p1436)))) AND NOT(A (G ((1 <= p1482))))) : (A (X (A (G ((3 <= p2050))))) OR A (F (E (F ((2 <= p226)))))) : E ((((p1178 <= 1) AND ((p679 <= p1410) OR (p481 <= p1969))) U A (X ((1 <= p1251))))) : (NOT((A (F ((3 <= p553))) OR E (G ((p1656 <= p316))))) OR NOT(A (((p1528 <= p1968) U (p672 <= p1177)))))
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 (((2 <= p2030) OR (3 <= p1442)))) OR ((p1700 + 1 <= p568) AND (2 <= p981) AND ((p1694 <= p458) OR (1 <= p997) OR (p233 + 1 <= p1053)))) AND A (X (((p776 + 1 <= p2041) AND (p712 <= 2)))))
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 (((2 <= p2030) OR (3 <= p1442))))
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 136 bytes per marking, with 26 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 Echo-PT-d02r15-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r15-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: ((p1700 + 1 <= p568) AND (2 <= p981) AND ((p1694 <= p458) OR (1 <= p997) OR (p233 + 1 <= p1053)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p1700 + 1 <= p568) AND (2 <= p981) AND ((p1694 <= p458) OR (1 <= p997) OR (p233 + 1 <= p1053)))
lola: processed formula length: 99
lola: 0 rewrites
lola: formula mentions 0 of 2127 places; total mentions: 0
lola: closed formula file Echo-PT-d02r15-CTLCardinality.task
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: 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: A ((((p905 <= p1445) OR (p527 <= 0)) U E (G ((1 <= p1621)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((p905 <= p1445) OR (p527 <= 0)) U NOT(A(TRUE U (p1621 <= 0))))
lola: processed formula length: 66
lola: 3 rewrites
lola: formula mentions 0 of 2127 places; total mentions: 0
lola: closed formula file Echo-PT-d02r15-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 26 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: 451 markings, 901 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((p567 <= p1197))) AND A (F (E (F ((p458 <= p2063))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p567 <= p1197)))
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 136 bytes per marking, with 26 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 Echo-PT-d02r15-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r15-CTLCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 55 markings, 54 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X ((1 <= p1584)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((1 <= p1584)))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 2127 places; total mentions: 0
lola: closed formula file Echo-PT-d02r15-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 26 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: 228380 markings, 1510584 edges, 3096157948485828608 markings/sec, 0 secs
lola: 421494 markings, 3001510 edges, 38623 markings/sec, 5 secs
lola: 627583 markings, 4603218 edges, 41218 markings/sec, 10 secs
lola: 836203 markings, 6193710 edges, 41724 markings/sec, 15 secs
lola: 1027395 markings, 7676725 edges, 38238 markings/sec, 20 secs
lola: 1202540 markings, 9173566 edges, 35029 markings/sec, 25 secs
lola: 1380290 markings, 10714892 edges, 35550 markings/sec, 30 secs
lola: 1558896 markings, 12274629 edges, 35721 markings/sec, 35 secs
lola: 1740634 markings, 13736951 edges, 36348 markings/sec, 40 secs
lola: 1914379 markings, 15223809 edges, 34749 markings/sec, 45 secs
lola: 2086947 markings, 16727668 edges, 34514 markings/sec, 50 secs
lola: 2262555 markings, 18259278 edges, 35122 markings/sec, 55 secs
lola: 2449724 markings, 19763947 edges, 37434 markings/sec, 60 secs
lola: 2623007 markings, 21246545 edges, 34657 markings/sec, 65 secs
lola: 2794141 markings, 22740935 edges, 34227 markings/sec, 70 secs
lola: 2968723 markings, 24268889 edges, 34916 markings/sec, 75 secs
lola: 3158578 markings, 25784885 edges, 37971 markings/sec, 80 secs
lola: 3331799 markings, 27275960 edges, 34644 markings/sec, 85 secs
lola: 3503789 markings, 28779890 edges, 34398 markings/sec, 90 secs
lola: 3678727 markings, 30310954 edges, 34988 markings/sec, 95 secs
lola: 3874239 markings, 31864184 edges, 39102 markings/sec, 100 secs
lola: 4048913 markings, 33384087 edges, 34935 markings/sec, 105 secs
lola: 4222314 markings, 34898630 edges, 34680 markings/sec, 110 secs
lola: 4399256 markings, 36446298 edges, 35388 markings/sec, 115 secs
lola: 4572586 markings, 37805409 edges, 34666 markings/sec, 120 secs
lola: 4732115 markings, 39183526 edges, 31906 markings/sec, 125 secs
lola: 4891037 markings, 40574397 edges, 31784 markings/sec, 130 secs
lola: 5053267 markings, 41989727 edges, 32446 markings/sec, 135 secs
lola: 5215031 markings, 43400867 edges, 32353 markings/sec, 140 secs
lola: 5362731 markings, 44795116 edges, 29540 markings/sec, 145 secs
lola: 5507866 markings, 46205214 edges, 29027 markings/sec, 150 secs
lola: 5655557 markings, 47637359 edges, 29538 markings/sec, 155 secs
lola: 5802846 markings, 49068334 edges, 29458 markings/sec, 160 secs
lola: 5964350 markings, 50494190 edges, 32301 markings/sec, 165 secs
lola: 6113591 markings, 51935260 edges, 29848 markings/sec, 170 secs
lola: 6263840 markings, 53387482 edges, 30050 markings/sec, 175 secs
lola: 6414407 markings, 54844021 edges, 30113 markings/sec, 180 secs
lola: 6569370 markings, 56304329 edges, 30993 markings/sec, 185 secs
lola: 6725406 markings, 57728141 edges, 31207 markings/sec, 190 secs
lola: 6873961 markings, 59173760 edges, 29711 markings/sec, 195 secs
lola: 7026707 markings, 60658488 edges, 30549 markings/sec, 200 secs
lola: 7181009 markings, 62158778 edges, 30860 markings/sec, 205 secs
lola: 7345340 markings, 63632866 edges, 32866 markings/sec, 210 secs
lola: 7496374 markings, 65087454 edges, 30207 markings/sec, 215 secs
lola: 7645559 markings, 66530285 edges, 29837 markings/sec, 220 secs
lola: 7798277 markings, 68003901 edges, 30544 markings/sec, 225 secs
lola: 7959668 markings, 69485504 edges, 32278 markings/sec, 230 secs
lola: 8123557 markings, 70814550 edges, 32778 markings/sec, 235 secs
lola: 8272680 markings, 72114939 edges, 29825 markings/sec, 240 secs
lola: 8430626 markings, 73493264 edges, 31589 markings/sec, 245 secs
lola: 8591533 markings, 74900074 edges, 32181 markings/sec, 250 secs
lola: 8754417 markings, 76321274 edges, 32577 markings/sec, 255 secs
lola: 8901699 markings, 77744102 edges, 29456 markings/sec, 260 secs
lola: 9046762 markings, 79148836 edges, 29013 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: (A (G (((3 <= p106) OR (p147 <= p1850) OR ((p156 <= p1058) AND (3 <= p397))))) OR ((2 <= p1363) OR A (G (((p1454 <= p123) OR (2 <= p1176))))))
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: A (G (((3 <= p106) OR (p147 <= p1850) OR ((p156 <= p1058) AND (3 <= p397)))))
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 136 bytes per marking, with 26 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r15-CTLCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 244 markings, 243 edges
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p1363)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p1363)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 2127 places; total mentions: 0
lola: closed formula file Echo-PT-d02r15-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1454 <= p123) OR (2 <= p1176))))
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 136 bytes per marking, with 26 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 Echo-PT-d02r15-CTLCardinality-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (G ((1 <= p2012))))) OR ((((p365 + 1 <= p494) AND (p697 <= p1394)) OR (p409 + 1 <= p1287)) OR (E (G ((1 <= p2119))) AND E (X ((2 <= p1867))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p2012)))
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 136 bytes per marking, with 26 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 Echo-PT-d02r15-CTLCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p365 + 1 <= p494) AND (p697 <= p1394)) OR (p409 + 1 <= p1287))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p365 + 1 <= p494) AND (p697 <= p1394)) OR (p409 + 1 <= p1287))
lola: processed formula length: 66
lola: 1 rewrites
lola: formula mentions 0 of 2127 places; total mentions: 0
lola: closed formula file Echo-PT-d02r15-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p2119)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p2119 <= 0)))
lola: processed formula length: 27
lola: 3 rewrites
lola: formula mentions 0 of 2127 places; total mentions: 0
lola: closed formula file Echo-PT-d02r15-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 26 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: 676003 markings, 1673396 edges, 2893551765469265920 markings/sec, 0 secs
lola: 1297358 markings, 3328678 edges, 124271 markings/sec, 5 secs
lola: 1901236 markings, 4977015 edges, 120776 markings/sec, 10 secs
lola: 2486829 markings, 6581920 edges, 117119 markings/sec, 15 secs
lola: 3074908 markings, 8208114 edges, 117616 markings/sec, 20 secs
lola: 3662652 markings, 9839186 edges, 117549 markings/sec, 25 secs
lola: 4273844 markings, 11512007 edges, 122238 markings/sec, 30 secs
lola: 4829996 markings, 13033817 edges, 111230 markings/sec, 35 secs
lola: 5360800 markings, 14548495 edges, 106161 markings/sec, 40 secs
lola: 5876738 markings, 16101358 edges, 103188 markings/sec, 45 secs
lola: 6406940 markings, 17697389 edges, 106040 markings/sec, 50 secs
lola: 6938992 markings, 19288165 edges, 106410 markings/sec, 55 secs
lola: 7470366 markings, 20872774 edges, 106275 markings/sec, 60 secs
lola: 8004952 markings, 22458232 edges, 106917 markings/sec, 65 secs
lola: 8543703 markings, 23949522 edges, 107750 markings/sec, 70 secs
lola: 9063586 markings, 25479787 edges, 103977 markings/sec, 75 secs
lola: 9582165 markings, 27027439 edges, 103716 markings/sec, 80 secs
lola: 10091776 markings, 28562209 edges, 101922 markings/sec, 85 secs
lola: 10600320 markings, 30094885 edges, 101709 markings/sec, 90 secs
lola: 11120877 markings, 31645734 edges, 104111 markings/sec, 95 secs
lola: 11672428 markings, 33232160 edges, 110310 markings/sec, 100 secs
lola: 12229556 markings, 34791421 edges, 111426 markings/sec, 105 secs
lola: 12728284 markings, 36296039 edges, 99746 markings/sec, 110 secs
lola: 13238936 markings, 37819987 edges, 102130 markings/sec, 115 secs
lola: 13763243 markings, 39380261 edges, 104861 markings/sec, 120 secs
lola: 14287828 markings, 40969004 edges, 104917 markings/sec, 125 secs
lola: 14814892 markings, 42554071 edges, 105413 markings/sec, 130 secs
lola: 15377556 markings, 44129221 edges, 112533 markings/sec, 135 secs
lola: 15918953 markings, 45671221 edges, 108279 markings/sec, 140 secs
lola: 16430492 markings, 47211379 edges, 102308 markings/sec, 145 secs
lola: 16949676 markings, 48774818 edges, 103837 markings/sec, 150 secs
lola: 17482640 markings, 50367325 edges, 106593 markings/sec, 155 secs
lola: 18023488 markings, 51979735 edges, 108170 markings/sec, 160 secs
lola: 18564559 markings, 53585418 edges, 108214 markings/sec, 165 secs
lola: 19145028 markings, 55195696 edges, 116094 markings/sec, 170 secs
lola: 19663243 markings, 56728272 edges, 103643 markings/sec, 175 secs
lola: 20192708 markings, 58306169 edges, 105893 markings/sec, 180 secs
lola: 20725224 markings, 59899829 edges, 106503 markings/sec, 185 secs
lola: 21244200 markings, 61476963 edges, 103795 markings/sec, 190 secs
lola: 21775028 markings, 63058926 edges, 106166 markings/sec, 195 secs
lola: 22285283 markings, 64509935 edges, 102051 markings/sec, 200 secs
lola: 22781489 markings, 65896343 edges, 99241 markings/sec, 205 secs
lola: 23253336 markings, 67320691 edges, 94369 markings/sec, 210 secs
lola: 23735608 markings, 68751545 edges, 96454 markings/sec, 215 secs
lola: 24209608 markings, 70173976 edges, 94800 markings/sec, 220 secs
lola: 24677075 markings, 71590004 edges, 93493 markings/sec, 225 secs
lola: 25156484 markings, 73012173 edges, 95882 markings/sec, 230 secs
lola: 25648140 markings, 74481880 edges, 98331 markings/sec, 235 secs
lola: 26131125 markings, 75946929 edges, 96597 markings/sec, 240 secs
lola: 26587624 markings, 77395987 edges, 91300 markings/sec, 245 secs
lola: 27037752 markings, 78854326 edges, 90026 markings/sec, 250 secs
lola: 27483492 markings, 80317394 edges, 89148 markings/sec, 255 secs
lola: 27947730 markings, 81807668 edges, 92848 markings/sec, 260 secs
lola: 28401396 markings, 83288848 edges, 90733 markings/sec, 265 secs
lola: 28842932 markings, 84728292 edges, 88307 markings/sec, 270 secs
lola: 29320360 markings, 86199859 edges, 95486 markings/sec, 275 secs
lola: 29801149 markings, 87660940 edges, 96158 markings/sec, 280 secs
lola: 30257100 markings, 89144546 edges, 91190 markings/sec, 285 secs
lola: 30722988 markings, 90648644 edges, 93178 markings/sec, 290 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
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA Echo-PT-d02r15-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
FORMULA Echo-PT-d02r15-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- 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="Echo-PT-d02r15"
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/Echo-PT-d02r15.tgz
mv Echo-PT-d02r15 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 Echo-PT-d02r15, 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 r082-blw3-152649949800437"
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 ;