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 304K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 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
-rwxr-xr-x 1 mcc users 130K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is SquareGrid-PT-040204, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-152705516900185
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527097463110


BK_STOP 1527097844497

--------------------
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 SquareGrid-PT-040204 as instance name.
Using SquareGrid 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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 482, 'Memory': 105.79, 'Tool': 'lola'}, {'Time': 619, 'Memory': 106.87, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola SquareGrid-PT-040204...

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


checking for too many tokens
===========================================================================================
SquareGrid-PT-040204: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ SquareGrid-PT-040204 @ 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: 512/65536 symbol table entries, 25 collisions
lola: preprocessing...
lola: finding significant places
lola: 240 places, 272 transitions, 143 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 368 transition conflict sets
lola: TASK
lola: reading formula from SquareGrid-PT-040204-CTLCardinality.task
lola: E (((p4il_3_4 + 1 <= pb4_1_2) U A (G ((p4o_3_1 <= p1il_4_4))))) : A (F (A (F ((2 <= p4i_2_4))))) : ((A (X ((p1ol_4_2 <= pb3_2_3))) AND E (G ((1 <= p1il_2_3)))) AND (p1o_3_1 + 1 <= pb4_3_4)) : (A (G (((pb2_1_2 <= 2) OR (pb4_2_1 <= p1ol_1_4)))) OR E (F (((p1il_1_4 <= 1) AND (pb1_3_2 <= 0))))) : NOT(A (F ((p4ol_1_2 <= p1i_4_1)))) : A (F ((A (X ((pb4_1_3 <= p1il_2_2))) AND E (F ((pb4_4_2 <= p1i_4_3)))))) : E ((E (F ((2 <= p1i_1_4))) U (((3 <= p1o_1_1) OR (p1o_4_2 <= pb3_1_3)) AND (p1ol_1_4 + 1 <= p1ol_4_2)))) : E (F (E (F (((3 <= p1ol_1_4) AND (pb1_3_3 <= pb4_1_4)))))) : ((E (X ((p1i_5_1 <= 1))) OR E (X (((1 <= pb3_1_3) OR (2 <= pb1_3_4))))) AND E (G (A (F ((p4il_2_5 <= pb4_2_1)))))) : NOT(E (X (E (F ((3 <= p1i_5_1)))))) : NOT((((pb3_4_3 + 1 <= p1o_1_4) OR (pbl_2_2 + 1 <= p4ol_4_4) OR (p4il_4_1 <= 0) OR (pbl_4_3 <= 2)) OR A (F (((p4il_1_2 <= p1o_1_1) OR (3 <= pb2_2_2)))))) : (((p1o_5_1 <= p4o_3_2) AND (A (F ((p4ol_3_2 <= pb2_2_4))) OR E (X ((3 <= p4ol_2_5))))) AND ((2 <= p1i_5_2) OR E (((p4ol_3_2 <= pb2_1_3) U (3 <= p4ol_4_2))))) : NOT(NOT(((3 <= pbl_4_3) AND A (F ((2 <= p1il_3_2)))))) : ((pb1_3_4 + 1 <= pb3_1_3) OR A (G (E (F ((3 <= p1il_2_1)))))) : (A (X (A (F ((1 <= p4i_4_2))))) OR (3 <= pb3_1_4)) : A (F (NOT(A (X ((p4i_2_5 <= p4ol_1_4))))))
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 (((p4il_3_4 + 1 <= pb4_1_2) U A (G ((p4o_3_1 <= p1il_4_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p4il_3_4 + 1 <= pb4_1_2) U NOT(E(TRUE U (p1il_4_4 + 1 <= p4o_3_1))))
lola: processed formula length: 71
lola: 3 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 682643 markings, 3366391 edges, 3225412962034384896 markings/sec, 0 secs
lola: 1253410 markings, 6623082 edges, 114153 markings/sec, 5 secs
lola: 1822907 markings, 9732845 edges, 113899 markings/sec, 10 secs
lola: 2322432 markings, 12717988 edges, 99905 markings/sec, 15 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2946999 markings, 15083297 edges
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (F ((2 <= p4i_2_4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= p4i_2_4)))
lola: processed formula: A (F ((2 <= p4i_2_4)))
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 576 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: 633 markings, 633 edges
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (X ((p1ol_4_2 <= pb3_2_3))) AND E (G ((1 <= p1il_2_3)))) AND (p1o_3_1 + 1 <= pb4_3_4))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p1ol_4_2 <= pb3_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p1ol_4_2 <= pb3_2_3)))
lola: processed formula: A (X ((p1ol_4_2 <= pb3_2_3)))
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 576 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 65 markings, 64 edges
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= p1il_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p1il_2_3 <= 0)))
lola: processed formula length: 30
lola: 3 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: 435 markings, 435 edges
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p1o_3_1 + 1 <= pb4_3_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1o_3_1 + 1 <= pb4_3_4)
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((pb2_1_2 <= 2) OR (pb4_2_1 <= p1ol_1_4)))) OR E (F (((p1il_1_4 <= 1) AND (pb1_3_2 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pb2_1_2 <= 2) OR (pb4_2_1 <= p1ol_1_4))))
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 572 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 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1il_1_4 <= 1) AND (pb1_3_2 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SquareGrid-PT-040204-CTLCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((p4ol_1_2 <= p1i_4_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p4ol_1_2 <= p1i_4_1)))
lola: processed formula length: 36
lola: 5 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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: 632 markings, 633 edges
lola: ========================================
lola: subprocess 5 will run for 319 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((pb4_1_3 <= p1il_2_2))) AND E (F ((pb4_4_2 <= p1i_4_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (AX((pb4_1_3 <= p1il_2_2)) AND E(TRUE U (pb4_4_2 <= p1i_4_3))))
lola: processed formula length: 72
lola: 3 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 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: 679 markings, 715 edges
lola: ========================================
lola: subprocess 6 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((2 <= p1i_1_4))) U (((3 <= p1o_1_1) OR (p1o_4_2 <= pb3_1_3)) AND (p1ol_1_4 + 1 <= p1ol_4_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (2 <= p1i_1_4)) U (((3 <= p1o_1_1) OR (p1o_4_2 <= pb3_1_3)) AND (p1ol_1_4 + 1 <= p1ol_4_2)))
lola: processed formula length: 104
lola: 2 rewrites
lola: formula mentions 0 of 240 places; total mentions: 0
lola: closed formula file SquareGrid-PT-040204-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 572 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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 748732 markings, 3455978 edges, 149733 markings/sec, 0 secs
lola: 1361422 markings, 6699693 edges, 122538 markings/sec, 5 secs
lola: 1856122 markings, 9714340 edges, 98940 markings/sec, 10 secs
lola: 2568785 markings, 12435960 edges, 142533 markings/sec, 15 secs
lola: 3444906 markings, 14865471 edges, 175224 markings/sec, 20 secs
lola: 4274494 markings, 17252231 edges, 165918 markings/sec, 25 secs
lola: 5052812 markings, 19573551 edges, 155664 markings/sec, 30 secs
lola: 5904738 markings, 21891223 edges, 170385 markings/sec, 35 secs
lola: 6510510 markings, 23853705 edges, 121154 markings/sec, 40 secs
lola: 6920156 markings, 25702636 edges, 81929 markings/sec, 45 secs
lola: 7513096 markings, 27633581 edges, 118588 markings/sec, 50 secs
lola: 8071141 markings, 29673004 edges, 111609 markings/sec, 55 secs
lola: 8698787 markings, 31619373 edges, 125529 markings/sec, 60 secs
lola: 9204068 markings, 33490659 edges, 101056 markings/sec, 65 secs
lola: 9823128 markings, 35392383 edges, 123812 markings/sec, 70 secs
lola: 10369709 markings, 37227556 edges, 109316 markings/sec, 75 secs
lola: 10752686 markings, 39053207 edges, 76595 markings/sec, 80 secs
lola: 11227193 markings, 40860531 edges, 94901 markings/sec, 85 secs
lola: 11663508 markings, 42383962 edges, 87263 markings/sec, 90 secs
lola: 11860678 markings, 43952122 edges, 39434 markings/sec, 95 secs
lola: 12108442 markings, 45692937 edges, 49553 markings/sec, 100 secs
lola: 12559092 markings, 47514707 edges, 90130 markings/sec, 105 secs
lola: 12900249 markings, 49220173 edges, 68231 markings/sec, 110 secs
lola: 13521452 markings, 51204193 edges, 124241 markings/sec, 115 secs
lola: 13968097 markings, 52913140 edges, 89329 markings/sec, 120 secs
lola: 14485360 markings, 54737809 edges, 103453 markings/sec, 125 secs
lola: 14986286 markings, 56476654 edges, 100185 markings/sec, 130 secs
lola: 15694859 markings, 58183055 edges, 141715 markings/sec, 135 secs
lola: 16285590 markings, 59844047 edges, 118146 markings/sec, 140 secs
lola: 16940910 markings, 61349831 edges, 131064 markings/sec, 145 secs
lola: 17535574 markings, 62745011 edges, 118933 markings/sec, 150 secs
lola: 17890178 markings, 64064364 edges, 70921 markings/sec, 155 secs
lola: 18247386 markings, 65572725 edges, 71442 markings/sec, 160 secs
lola: 18590269 markings, 67209815 edges, 68577 markings/sec, 165 secs
lola: 19391217 markings, 69557315 edges, 160190 markings/sec, 170 secs
lola: 20194307 markings, 71918230 edges, 160618 markings/sec, 175 secs
lola: 20969064 markings, 74152861 edges, 154951 markings/sec, 180 secs
lola: 21719358 markings, 76377630 edges, 150059 markings/sec, 185 secs
lola: 22274450 markings, 78259221 edges, 111018 markings/sec, 190 secs
lola: 22723351 markings, 80224984 edges, 89780 markings/sec, 195 secs
lola: 23246255 markings, 82005964 edges, 104581 markings/sec, 200 secs
lola: 23907422 markings, 84070629 edges, 132233 markings/sec, 205 secs
lola: 24458840 markings, 85957838 edges, 110284 markings/sec, 210 secs
lola: 25010170 markings, 87709153 edges, 110266 markings/sec, 215 secs
lola: 25515749 markings, 89438778 edges, 101116 markings/sec, 220 secs
lola: 25925512 markings, 91361936 edges, 81953 markings/sec, 225 secs
lola: 26383704 markings, 92975528 edges, 91638 markings/sec, 230 secs
lola: 26801106 markings, 94461899 edges, 83480 markings/sec, 235 secs
lola: 26924668 markings, 96028311 edges, 24712 markings/sec, 240 secs
lola: 27274333 markings, 97853949 edges, 69933 markings/sec, 245 secs
lola: 27662634 markings, 99537780 edges, 77660 markings/sec, 250 secs
lola: 28044284 markings, 101291891 edges, 76330 markings/sec, 255 secs
lola: 28657945 markings, 103197645 edges, 122732 markings/sec, 260 secs
lola: 29129628 markings, 104883311 edges, 94337 markings/sec, 265 secs
lola: 29589017 markings, 106509439 edges, 91878 markings/sec, 270 secs
lola: 30227590 markings, 108330582 edges, 127715 markings/sec, 275 secs
lola: 31010144 markings, 109927392 edges, 156511 markings/sec, 280 secs
lola: 31715014 markings, 111380920 edges, 140974 markings/sec, 285 secs
lola: 32187029 markings, 112939429 edges, 94403 markings/sec, 290 secs
lola: 32601565 markings, 114307386 edges, 82907 markings/sec, 295 secs
lola: 32960253 markings, 115747928 edges, 71738 markings/sec, 300 secs
lola: 33295093 markings, 117281069 edges, 66968 markings/sec, 305 secs
lola: 33699460 markings, 118939903 edges, 80873 markings/sec, 310 secs
lola: 34118828 markings, 120550555 edges, 83874 markings/sec, 315 secs
lola: 34475295 markings, 122227933 edges, 71293 markings/sec, 320 secs
lola: 34879454 markings, 123820847 edges, 80832 markings/sec, 325 secs
lola: 35341456 markings, 125347330 edges, 92400 markings/sec, 330 secs
lola: 35775531 markings, 126719691 edges, 86815 markings/sec, 335 secs
lola: 36210596 markings, 128110085 edges, 87013 markings/sec, 340 secs
lola: 36611327 markings, 129407161 edges, 80146 markings/sec, 345 secs
lola: local time limit reached - aborting
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 SquareGrid-PT-040204-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SquareGrid-PT-040204-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

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="SquareGrid-PT-040204"
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/SquareGrid-PT-040204.tgz
mv SquareGrid-PT-040204 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 SquareGrid-PT-040204, 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 r166-smll-152705516900185"
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 ;