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 224K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 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.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K 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 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 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.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 66K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is DES-PT-00b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r055-smll-152646382800165
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526496295780


BK_STOP 1526496597258

--------------------
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 DES-PT-00b as instance name.
Using DES as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLFireability', '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': None, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 565397, 'Memory': 1594.26, 'Tool': 'lola'}, {'Time': 565942, 'Memory': 1589.06, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola DES-PT-00b...

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


checking for too many tokens
===========================================================================================
DES-PT-00b: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLFireability @ DES-PT-00b @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- Start make result stdout -----
----- Start make result stderr -----
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: 501/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 271 places, 230 transitions, 212 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 319 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-00b-CTLFireability.task
lola: ((FIREABLE(t14) OR (NOT(A (F (FIREABLE(t184)))) OR (((FIREABLE(t192) OR FIREABLE(t168)) AND FIREABLE(t0)) OR (FIREABLE(t189) AND FIREABLE(t85) AND NOT FIREABLE(t48))))) AND NOT((FIREABLE(t5) OR E (X ((FIREABLE(t12) AND FIREABLE(t76))))))) : A (((E (X (FIREABLE(t211))) OR (NOT FIREABLE(t19) AND NOT FIREABLE(t76))) U (FIREABLE(t139) OR FIREABLE(t51)))) : (A (G (A (G (NOT FIREABLE(t68))))) OR (E (G ((FIREABLE(t88) AND FIREABLE(t52)))) OR NOT(E (G (NOT FIREABLE(t132)))))) : NOT((NOT(A (F (NOT FIREABLE(t180)))) OR E (G (E (F (FIREABLE(t150))))))) : (A (X (E (F ((FIREABLE(t157) AND FIREABLE(t184)))))) OR FIREABLE(t80)) : A (F (E (X (FIREABLE(t205))))) : E (F (FIREABLE(t44))) : A (G (E (G (E (F (FIREABLE(t209))))))) : A (F (E ((FIREABLE(t12) U FIREABLE(t51))))) : E (X (A (G ((NOT FIREABLE(t127) OR NOT FIREABLE(t212)))))) : (A (F (A (G ((FIREABLE(t129) AND FIREABLE(t122)))))) AND NOT(E (G ((NOT FIREABLE(t16) OR NOT FIREABLE(t126)))))) : NOT(A (F (A (X ((FIREABLE(t159) AND FIREABLE(t40))))))) : E (F ((E (X ((FIREABLE(t31) AND FIREABLE(t14)))) OR FIREABLE(t229)))) : A (G (A (F ((FIREABLE(t88) AND FIREABLE(t1) AND FIREABLE(t120)))))) : ((E ((FIREABLE(t88) U FIREABLE(t145))) OR A (X ((FIREABLE(t25) AND FIREABLE(t165) AND NOT FIREABLE(t206))))) OR (E (G (FIREABLE(t134))) OR (NOT(E (F (FIREABLE(t148)))) OR (FIREABLE(t15) AND FIREABLE(t19))))) : E (G (NOT((((FIREABLE(t104) AND FIREABLE(t229)) OR FIREABLE(t44)) OR A (X (FIREABLE(t222)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(t14) OR (NOT(A (F (FIREABLE(t184)))) OR (((FIREABLE(t192) OR FIREABLE(t168)) AND FIREABLE(t0)) OR (FIREABLE(t189) AND FIREABLE(t85) AND NOT FIREABLE(t48))))) AND NOT((FIREABLE(t5) OR E (X ((FIREABLE(t12) AND FIREABLE(t76)))))))
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: FIREABLE(t14)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t14)
lola: processed formula length: 13
lola: 8 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: processed formula with 0 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(t184)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(t184)))
lola: processed formula length: 29
lola: 10 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 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: 81 markings, 80 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t5)
lola: processed formula length: 16
lola: 8 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((NOT FIREABLE(t12) OR NOT FIREABLE(t76))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((NOT FIREABLE(t12) OR NOT FIREABLE(t76))))
lola: processed formula: A (X ((NOT FIREABLE(t12) OR NOT FIREABLE(t76))))
lola: processed formula length: 49
lola: 8 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 10 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: 2 markings, 1 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((E (X (FIREABLE(t211))) OR (NOT FIREABLE(t19) AND NOT FIREABLE(t76))) U (FIREABLE(t139) OR FIREABLE(t51))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((EX(FIREABLE(t211)) OR (NOT FIREABLE(t19) AND NOT FIREABLE(t76))) U (FIREABLE(t139) OR FIREABLE(t51)))
lola: processed formula length: 105
lola: 2 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 64 markings, 63 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (G (NOT FIREABLE(t68))))) OR (E (G ((FIREABLE(t88) AND FIREABLE(t52)))) OR NOT(E (G (NOT FIREABLE(t132))))))
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 (NOT FIREABLE(t68)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(t88) AND FIREABLE(t52))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT FIREABLE(t88) OR NOT FIREABLE(t52))))
lola: processed formula length: 56
lola: 6 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(t132)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t132)))
lola: processed formula: A (F (FIREABLE(t132)))
lola: processed formula length: 22
lola: 4 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 11 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 48 markings, 47 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((NOT(A (F (NOT FIREABLE(t180)))) OR E (G (E (F (FIREABLE(t150)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT FIREABLE(t180)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (NOT FIREABLE(t180)))
lola: processed formula: A (F (NOT FIREABLE(t180)))
lola: processed formula length: 26
lola: 12 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 11 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (NOT FIREABLE(t150)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (NOT FIREABLE(t150)))))
lola: processed formula: A (F (A (G (NOT FIREABLE(t150)))))
lola: processed formula length: 34
lola: 12 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 10 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: 393091 markings, 644557 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (E (F ((FIREABLE(t157) AND FIREABLE(t184)))))) OR FIREABLE(t80))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((FIREABLE(t157) AND FIREABLE(t184))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (FIREABLE(t157) AND FIREABLE(t184))))
lola: processed formula length: 49
lola: 2 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 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: 705638 markings, 3880035 edges, 141128 markings/sec, 0 secs
lola: 1306979 markings, 7772323 edges, 120268 markings/sec, 5 secs
lola: 1895104 markings, 11591384 edges, 117625 markings/sec, 10 secs
lola: 2526354 markings, 15468259 edges, 126250 markings/sec, 15 secs
lola: 3083836 markings, 19288453 edges, 111496 markings/sec, 20 secs
lola: 3684215 markings, 22983711 edges, 120076 markings/sec, 25 secs
lola: 4194836 markings, 26476944 edges, 102124 markings/sec, 30 secs
lola: 4664387 markings, 30065552 edges, 93910 markings/sec, 35 secs
lola: 5260295 markings, 33639260 edges, 119182 markings/sec, 40 secs
lola: 5774347 markings, 37076973 edges, 102810 markings/sec, 45 secs
lola: 6313673 markings, 40541700 edges, 107865 markings/sec, 50 secs
lola: 6820149 markings, 44024845 edges, 101295 markings/sec, 55 secs
lola: 7346454 markings, 47412069 edges, 105261 markings/sec, 60 secs
lola: 7801517 markings, 50706944 edges, 91013 markings/sec, 65 secs
lola: 8344697 markings, 54168870 edges, 108636 markings/sec, 70 secs
lola: 8872974 markings, 57647523 edges, 105655 markings/sec, 75 secs
lola: 9396392 markings, 61088765 edges, 104684 markings/sec, 80 secs
lola: 9921731 markings, 64562413 edges, 105068 markings/sec, 85 secs
lola: 10454916 markings, 67998792 edges, 106637 markings/sec, 90 secs
lola: 10927932 markings, 71313761 edges, 94603 markings/sec, 95 secs
lola: 11336759 markings, 74709588 edges, 81765 markings/sec, 100 secs
lola: 11720428 markings, 78138679 edges, 76734 markings/sec, 105 secs
lola: 12109387 markings, 81593980 edges, 77792 markings/sec, 110 secs
lola: 12489926 markings, 84973078 edges, 76108 markings/sec, 115 secs
lola: 12812654 markings, 88210277 edges, 64546 markings/sec, 120 secs
lola: 13364243 markings, 91563688 edges, 110318 markings/sec, 125 secs
lola: 13914805 markings, 94940962 edges, 110112 markings/sec, 130 secs
lola: 14427876 markings, 98276517 edges, 102614 markings/sec, 135 secs
lola: 14925111 markings, 101568098 edges, 99447 markings/sec, 140 secs
lola: 15480959 markings, 104946563 edges, 111170 markings/sec, 145 secs
lola: 15964189 markings, 108250057 edges, 96646 markings/sec, 150 secs
lola: 16500309 markings, 111557608 edges, 107224 markings/sec, 155 secs
lola: 16976963 markings, 114767451 edges, 95331 markings/sec, 160 secs
lola: 17414813 markings, 117911863 edges, 87570 markings/sec, 165 secs
lola: 17886399 markings, 121066709 edges, 94317 markings/sec, 170 secs
lola: 18381408 markings, 124225021 edges, 99002 markings/sec, 175 secs
lola: 18842895 markings, 127307957 edges, 92297 markings/sec, 180 secs
lola: 19336419 markings, 130452215 edges, 98705 markings/sec, 185 secs
lola: 19782955 markings, 133531443 edges, 89307 markings/sec, 190 secs
lola: 20253140 markings, 136557192 edges, 94037 markings/sec, 195 secs
lola: 20659944 markings, 139496826 edges, 81361 markings/sec, 200 secs
lola: 21144139 markings, 142650950 edges, 96839 markings/sec, 205 secs
lola: 21647939 markings, 145903335 edges, 100760 markings/sec, 210 secs
lola: 22123323 markings, 149087867 edges, 95077 markings/sec, 215 secs
lola: 22630254 markings, 152342623 edges, 101386 markings/sec, 220 secs
lola: 23106589 markings, 155521455 edges, 95267 markings/sec, 225 secs
lola: 23579140 markings, 158659043 edges, 94510 markings/sec, 230 secs
lola: 23972236 markings, 161688415 edges, 78619 markings/sec, 235 secs
lola: 24356406 markings, 164915568 edges, 76834 markings/sec, 240 secs
lola: 24703903 markings, 168059022 edges, 69499 markings/sec, 245 secs
lola: 25060345 markings, 171226288 edges, 71288 markings/sec, 250 secs
lola: 25412833 markings, 174360447 edges, 70498 markings/sec, 255 secs
lola: 25705614 markings, 177355911 edges, 58556 markings/sec, 260 secs
lola: 26254755 markings, 180575820 edges, 109828 markings/sec, 265 secs
lola: 26776260 markings, 183787055 edges, 104301 markings/sec, 270 secs
lola: 27267871 markings, 186975921 edges, 98322 markings/sec, 275 secs
lola: 27743312 markings, 190094090 edges, 95088 markings/sec, 280 secs
lola: 28273907 markings, 193308201 edges, 106119 markings/sec, 285 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)
----- Kill lola and sara stderr -----
FORMULA DES-PT-00b-CTLFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- 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="DES-PT-00b"
export BK_EXAMINATION="CTLFireability"
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/DES-PT-00b.tgz
mv DES-PT-00b 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 DES-PT-00b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r055-smll-152646382800165"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;