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 irma4mcc-structural
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 r079-blw3-152649947000437
=====================================================================

--------------------
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 1527096554989


BK_STOP 1527097127712

--------------------
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 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': 'itstools'}].
CTLCardinality lola Echo-PT-d02r15...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- 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 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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: 238872 markings, 1585014 edges, 3096157948485828608 markings/sec, 0 secs
lola: 454173 markings, 3259736 edges, 43060 markings/sec, 5 secs
lola: 675452 markings, 4952164 edges, 44256 markings/sec, 10 secs
lola: 875999 markings, 6511453 edges, 40109 markings/sec, 15 secs
lola: 1070966 markings, 8022935 edges, 38993 markings/sec, 20 secs
lola: 1236236 markings, 9458945 edges, 33054 markings/sec, 25 secs
lola: 1396640 markings, 10857648 edges, 32081 markings/sec, 30 secs
lola: 1565338 markings, 12332205 edges, 33740 markings/sec, 35 secs
lola: 1743664 markings, 13760726 edges, 35665 markings/sec, 40 secs
lola: 1911336 markings, 15198347 edges, 33534 markings/sec, 45 secs
lola: 2077414 markings, 16640986 edges, 33216 markings/sec, 50 secs
lola: 2246186 markings, 18115613 edges, 33754 markings/sec, 55 secs
lola: 2427224 markings, 19584450 edges, 36208 markings/sec, 60 secs
lola: 2596332 markings, 21032365 edges, 33822 markings/sec, 65 secs
lola: 2766016 markings, 22490520 edges, 33937 markings/sec, 70 secs
lola: 2935457 markings, 23970933 edges, 33888 markings/sec, 75 secs
lola: 3118307 markings, 25468365 edges, 36570 markings/sec, 80 secs
lola: 3295229 markings, 26979865 edges, 35384 markings/sec, 85 secs
lola: 3471078 markings, 28487766 edges, 35170 markings/sec, 90 secs
lola: 3652740 markings, 30081143 edges, 36332 markings/sec, 95 secs
lola: 3853576 markings, 31702763 edges, 40167 markings/sec, 100 secs
lola: 4039480 markings, 33298913 edges, 37181 markings/sec, 105 secs
lola: 4219291 markings, 34874744 edges, 35962 markings/sec, 110 secs
lola: 4401212 markings, 36462553 edges, 36384 markings/sec, 115 secs
lola: 4566335 markings, 37754185 edges, 33025 markings/sec, 120 secs
lola: 4720933 markings, 39090931 edges, 30920 markings/sec, 125 secs
lola: 4877390 markings, 40450534 edges, 31291 markings/sec, 130 secs
lola: 5032332 markings, 41805415 edges, 30988 markings/sec, 135 secs
lola: 5191517 markings, 43192704 edges, 31837 markings/sec, 140 secs
lola: 5352215 markings, 44689239 edges, 32140 markings/sec, 145 secs
lola: 5506079 markings, 46187192 edges, 30773 markings/sec, 150 secs
lola: 5661557 markings, 47697893 edges, 31096 markings/sec, 155 secs
lola: 5815416 markings, 49195122 edges, 30772 markings/sec, 160 secs
lola: 5974834 markings, 50588539 edges, 31884 markings/sec, 165 secs
lola: 6119430 markings, 51988444 edges, 28919 markings/sec, 170 secs
lola: 6265835 markings, 53405882 edges, 29281 markings/sec, 175 secs
lola: 6412758 markings, 54828480 edges, 29385 markings/sec, 180 secs
lola: 6563975 markings, 56255466 edges, 30243 markings/sec, 185 secs
lola: 6722725 markings, 57701494 edges, 31750 markings/sec, 190 secs
lola: 6871538 markings, 59148776 edges, 29763 markings/sec, 195 secs
lola: 7019005 markings, 60584508 edges, 29493 markings/sec, 200 secs
lola: 7170159 markings, 62049863 edges, 30231 markings/sec, 205 secs
lola: 7331067 markings, 63508122 edges, 32182 markings/sec, 210 secs
lola: 7486728 markings, 64989139 edges, 31132 markings/sec, 215 secs
lola: 7637922 markings, 66460816 edges, 30239 markings/sec, 220 secs
lola: 7800050 markings, 68019582 edges, 32426 markings/sec, 225 secs
lola: 7970346 markings, 69572052 edges, 34059 markings/sec, 230 secs
lola: 8146519 markings, 71023750 edges, 35235 markings/sec, 235 secs
lola: 8313101 markings, 72477162 edges, 33316 markings/sec, 240 secs
lola: 8481783 markings, 73951564 edges, 33736 markings/sec, 245 secs
lola: 8654306 markings, 75429829 edges, 34505 markings/sec, 250 secs
lola: 8818675 markings, 76922305 edges, 32874 markings/sec, 255 secs
lola: 8972790 markings, 78417869 edges, 30823 markings/sec, 260 secs
lola: 9125758 markings, 79907299 edges, 30594 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: state equation: calling and running sara
sara: try reading problem file 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: 697072 markings, 1727664 edges, 2893551765469265920 markings/sec, 0 secs
lola: 1295988 markings, 3324716 edges, 119783 markings/sec, 5 secs
lola: 1858520 markings, 4863174 edges, 112506 markings/sec, 10 secs
lola: 2425024 markings, 6414025 edges, 113301 markings/sec, 15 secs
lola: 2994312 markings, 8004591 edges, 113858 markings/sec, 20 secs
lola: 3591664 markings, 9636179 edges, 119470 markings/sec, 25 secs
lola: 4178560 markings, 11244209 edges, 117379 markings/sec, 30 secs
lola: 4727788 markings, 12745287 edges, 109846 markings/sec, 35 secs
lola: 5253589 markings, 14220909 edges, 105160 markings/sec, 40 secs
lola: 5748248 markings, 15728137 edges, 98932 markings/sec, 45 secs
lola: 6258084 markings, 17244640 edges, 101967 markings/sec, 50 secs
lola: 6771584 markings, 18777771 edges, 102700 markings/sec, 55 secs
lola: 7288524 markings, 20333310 edges, 103388 markings/sec, 60 secs
lola: 7805337 markings, 21889832 edges, 103363 markings/sec, 65 secs
lola: 8332347 markings, 23362122 edges, 105402 markings/sec, 70 secs
lola: 8848464 markings, 24825253 edges, 103223 markings/sec, 75 secs
lola: 9331600 markings, 26297916 edges, 96627 markings/sec, 80 secs
lola: 9824724 markings, 27764391 edges, 98625 markings/sec, 85 secs
lola: 10325848 markings, 29256983 edges, 100225 markings/sec, 90 secs
lola: 10831524 markings, 30774726 edges, 101135 markings/sec, 95 secs
lola: 11330976 markings, 32282167 edges, 99890 markings/sec, 100 secs
lola: 11866846 markings, 33777824 edges, 107174 markings/sec, 105 secs
lola: 12389557 markings, 35266053 edges, 104542 markings/sec, 110 secs
lola: 12880500 markings, 36750079 edges, 98189 markings/sec, 115 secs
lola: 13376164 markings, 38237962 edges, 99133 markings/sec, 120 secs
lola: 13882440 markings, 39742794 edges, 101255 markings/sec, 125 secs
lola: 14392659 markings, 41268169 edges, 102044 markings/sec, 130 secs
lola: 14894103 markings, 42792060 edges, 100289 markings/sec, 135 secs
lola: 15454520 markings, 44341007 edges, 112083 markings/sec, 140 secs
lola: 15978364 markings, 45847715 edges, 104769 markings/sec, 145 secs
lola: 16479928 markings, 47353285 edges, 100313 markings/sec, 150 secs
lola: 16980415 markings, 48867887 edges, 100097 markings/sec, 155 secs
lola: 17506898 markings, 50438896 edges, 105297 markings/sec, 160 secs
lola: 18057924 markings, 52086277 edges, 110205 markings/sec, 165 secs
lola: 18631393 markings, 53758126 edges, 114694 markings/sec, 170 secs
lola: 19231400 markings, 55434478 edges, 120001 markings/sec, 175 secs
lola: 19767220 markings, 57044887 edges, 107164 markings/sec, 180 secs
lola: 20305932 markings, 58655634 edges, 107742 markings/sec, 185 secs
lola: 20855732 markings, 60294837 edges, 109960 markings/sec, 190 secs
lola: 21408113 markings, 61950729 edges, 110476 markings/sec, 195 secs
lola: 21958395 markings, 63619110 edges, 110056 markings/sec, 200 secs
lola: 22441912 markings, 64945453 edges, 96703 markings/sec, 205 secs
lola: 22921172 markings, 66306087 edges, 95852 markings/sec, 210 secs
lola: 23376752 markings, 67696586 edges, 91116 markings/sec, 215 secs
lola: 23856957 markings, 69121192 edges, 96041 markings/sec, 220 secs
lola: 24345204 markings, 70575956 edges, 97649 markings/sec, 225 secs
lola: 24824122 markings, 72034290 edges, 95784 markings/sec, 230 secs
lola: 25326488 markings, 73531447 edges, 100473 markings/sec, 235 secs
lola: 25830240 markings, 75029412 edges, 100750 markings/sec, 240 secs
lola: 26323461 markings, 76535487 edges, 98644 markings/sec, 245 secs
lola: 26783422 markings, 78044369 edges, 91992 markings/sec, 250 secs
lola: 27254522 markings, 79558158 edges, 94220 markings/sec, 255 secs
lola: 27723452 markings, 81083114 edges, 93786 markings/sec, 260 secs
lola: 28190796 markings, 82615174 edges, 93469 markings/sec, 265 secs
lola: 28666840 markings, 84145299 edges, 95209 markings/sec, 270 secs
lola: 29154588 markings, 85699443 edges, 97550 markings/sec, 275 secs
lola: 29658504 markings, 87226307 edges, 100783 markings/sec, 280 secs
lola: 30136872 markings, 88750056 edges, 95674 markings/sec, 285 secs
lola: 30615339 markings, 90288804 edges, 95693 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
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 -----
----- 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="Echo-PT-d02r15"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-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/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 irma4mcc-structural"
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 r079-blw3-152649947000437"
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 ;