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 irma4mcc-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 r162-smll-152705514100185
=====================================================================

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


BK_STOP 1527071646266

--------------------
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 stderr -----
----- Start make result stdout -----
CTLCardinality @ SquareGrid-PT-040204 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- 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: 693126 markings, 3430710 edges, 3225412962034384896 markings/sec, 0 secs
lola: 1254781 markings, 6657103 edges, 112331 markings/sec, 5 secs
lola: 1826251 markings, 9747961 edges, 114294 markings/sec, 10 secs
lola: 2320092 markings, 12699750 edges, 98768 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: state equation: write sara problem file to SquareGrid-PT-040204-CTLCardinality-4.sara
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: 753492 markings, 3483171 edges, 150685 markings/sec, 0 secs
lola: 1351108 markings, 6645651 edges, 119523 markings/sec, 5 secs
lola: 1850616 markings, 9682708 edges, 99902 markings/sec, 10 secs
lola: 2600890 markings, 12523233 edges, 150055 markings/sec, 15 secs
lola: 3471873 markings, 14958502 edges, 174197 markings/sec, 20 secs
lola: 4300764 markings, 17336517 edges, 165778 markings/sec, 25 secs
lola: 5060460 markings, 19624996 edges, 151939 markings/sec, 30 secs
lola: 5886775 markings, 21854939 edges, 165263 markings/sec, 35 secs
lola: 6463535 markings, 23703125 edges, 115352 markings/sec, 40 secs
lola: 6878450 markings, 25444822 edges, 82983 markings/sec, 45 secs
lola: 7402132 markings, 27362152 edges, 104736 markings/sec, 50 secs
lola: 7885278 markings, 29175499 edges, 96629 markings/sec, 55 secs
lola: 8533368 markings, 31091139 edges, 129618 markings/sec, 60 secs
lola: 8998540 markings, 32849000 edges, 93034 markings/sec, 65 secs
lola: 9466434 markings, 34599955 edges, 93579 markings/sec, 70 secs
lola: 10129095 markings, 36467160 edges, 132532 markings/sec, 75 secs
lola: 10546847 markings, 38120162 edges, 83550 markings/sec, 80 secs
lola: 10975824 markings, 39968375 edges, 85795 markings/sec, 85 secs
lola: 11400824 markings, 41472578 edges, 85000 markings/sec, 90 secs
lola: 11781888 markings, 42888064 edges, 76213 markings/sec, 95 secs
lola: 11884857 markings, 44362141 edges, 20594 markings/sec, 100 secs
lola: 12211459 markings, 46071570 edges, 65320 markings/sec, 105 secs
lola: 12596651 markings, 47702376 edges, 77038 markings/sec, 110 secs
lola: 12916504 markings, 49324223 edges, 63971 markings/sec, 115 secs
lola: 13522805 markings, 51208997 edges, 121260 markings/sec, 120 secs
lola: 13938520 markings, 52812964 edges, 83143 markings/sec, 125 secs
lola: 14433612 markings, 54573862 edges, 99018 markings/sec, 130 secs
lola: 14874046 markings, 56168878 edges, 88087 markings/sec, 135 secs
lola: 15551399 markings, 57861134 edges, 135471 markings/sec, 140 secs
lola: 16211100 markings, 59397829 edges, 131940 markings/sec, 145 secs
lola: 16729364 markings, 60913322 edges, 103653 markings/sec, 150 secs
lola: 17372046 markings, 62248025 edges, 128536 markings/sec, 155 secs
lola: 17751969 markings, 63532140 edges, 75985 markings/sec, 160 secs
lola: 18095594 markings, 64899509 edges, 68725 markings/sec, 165 secs
lola: 18415456 markings, 66347227 edges, 63972 markings/sec, 170 secs
lola: 18883503 markings, 68176843 edges, 93609 markings/sec, 175 secs
lola: 19612939 markings, 70316290 edges, 145887 markings/sec, 180 secs
lola: 20406930 markings, 72512716 edges, 158798 markings/sec, 185 secs
lola: 21114418 markings, 74669996 edges, 141498 markings/sec, 190 secs
lola: 21816077 markings, 76709469 edges, 140332 markings/sec, 195 secs
lola: 22298928 markings, 78411435 edges, 96570 markings/sec, 200 secs
lola: 22734532 markings, 80264838 edges, 87121 markings/sec, 205 secs
lola: 23235182 markings, 81907838 edges, 100130 markings/sec, 210 secs
lola: 23842681 markings, 83814278 edges, 121500 markings/sec, 215 secs
lola: 24362669 markings, 85588117 edges, 103998 markings/sec, 220 secs
lola: 24933349 markings, 87335832 edges, 114136 markings/sec, 225 secs
lola: 25433281 markings, 89015672 edges, 99986 markings/sec, 230 secs
lola: 25779377 markings, 90715846 edges, 69219 markings/sec, 235 secs
lola: 26225891 markings, 92419351 edges, 89303 markings/sec, 240 secs
lola: 26631584 markings, 93838428 edges, 81139 markings/sec, 245 secs
lola: 26876926 markings, 95262134 edges, 49068 markings/sec, 250 secs
lola: 26965798 markings, 96753137 edges, 17774 markings/sec, 255 secs
lola: 27450490 markings, 98530682 edges, 96938 markings/sec, 260 secs
lola: 27742682 markings, 100019410 edges, 58438 markings/sec, 265 secs
lola: 28224199 markings, 101796731 edges, 96303 markings/sec, 270 secs
lola: 28748768 markings, 103486396 edges, 104914 markings/sec, 275 secs
lola: 29196882 markings, 105087631 edges, 89623 markings/sec, 280 secs
lola: 29599658 markings, 106603741 edges, 80555 markings/sec, 285 secs
lola: 30224434 markings, 108324626 edges, 124955 markings/sec, 290 secs
lola: 30963711 markings, 109831598 edges, 147855 markings/sec, 295 secs
lola: 31631510 markings, 111207013 edges, 133560 markings/sec, 300 secs
lola: 32148009 markings, 112652179 edges, 103300 markings/sec, 305 secs
lola: 32519676 markings, 113996366 edges, 74333 markings/sec, 310 secs
lola: 32865110 markings, 115351959 edges, 69087 markings/sec, 315 secs
lola: 33187261 markings, 116768991 edges, 64430 markings/sec, 320 secs
lola: 33505704 markings, 118351554 edges, 63689 markings/sec, 325 secs
lola: 33905909 markings, 119809456 edges, 80041 markings/sec, 330 secs
lola: 34306271 markings, 121430460 edges, 80072 markings/sec, 335 secs
lola: 34647409 markings, 122995771 edges, 68228 markings/sec, 340 secs
lola: 35088685 markings, 124497916 edges, 88255 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 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="SquareGrid-PT-040204"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-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 irma4mcc-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 r162-smll-152705514100185"
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 ;