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 30M
-rw-r--r-- 1 mcc users 5.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 30M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is PhaseVariation-PT-D30CS100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478800665
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527300337795


BK_STOP 1527300779136

--------------------
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 PhaseVariation-PT-D30CS100 as instance name.
Using PhaseVariation as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 257031, 'Memory': 679.55, 'Tool': 'lola'}, {'Time': 257872, 'Memory': 714.19, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola PhaseVariation-PT-D30CS100...

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


checking for too many tokens
===========================================================================================
PhaseVariation-PT-D30CS100: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ PhaseVariation-PT-D30CS100 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 33679/65536 symbol table entries, 10484 collisions
lola: preprocessing...
lola: finding significant places
lola: 2702 places, 30977 transitions, 1801 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2 transition conflict sets
lola: TASK
lola: reading formula from PhaseVariation-PT-D30CS100-ReachabilityFireability.task
lola: E (F ((((FIREABLE(division2_replicate_2_18_B_3_18) AND FIREABLE(division2_mutate_9_26_B_10_27)) OR (FIREABLE(division2_mutate_5_19_B_4_19) AND FIREABLE(division1_mutate_17_11_A))) AND FIREABLE(division2_replicate_11_11_B_12_12) AND (FIREABLE(division2_replicate_26_13_A_25_13) OR FIREABLE(division2_mutate_2_28_B_3_28) OR (FIREABLE(division2_replicate_6_19_B_7_20) AND FIREABLE(division2_mutate_21_11_B_22_12)) OR (FIREABLE(division2_replicate_16_8_A_15_7) AND (FIREABLE(division2_mutate_27_6_B_28_7) OR FIREABLE(division2_mutate_29_24_B_30_24))))))) : A (G ((NOT FIREABLE(division2_mutate_26_27_A_27_26) OR NOT FIREABLE(division2_replicate_28_13_B_27_13) OR NOT FIREABLE(division2_replicate_25_2_A_26_2) OR FIREABLE(division2_replicate_10_29_B_11_29)))) : A (G (NOT FIREABLE(division2_mutate_8_1_B_7_2))) : A (G ((NOT FIREABLE(division2_mutate_25_20_A_26_21) OR (FIREABLE(division2_mutate_17_12_B_18_11) AND FIREABLE(division1_mutate_25_11_A) AND FIREABLE(division2_mutate_23_30_B_22_29) AND FIREABLE(division2_mutate_7_6_A_6_6)) OR FIREABLE(division2_replicate_22_27_A_22_26)))) : E (F ((FIREABLE(division2_mutate_2_9_B_2_10) AND NOT FIREABLE(division2_mutate_29_20_B_29_19) AND (FIREABLE(division2_replicate_21_24_A_22_23) OR (FIREABLE(division2_mutate_7_19_B_7_20) AND FIREABLE(division1_replicate_13_14_A) AND (FIREABLE(division2_replicate_22_18_A_22_19) OR FIREABLE(division2_mutate_13_4_A_12_3))))))) : E (F ((((FIREABLE(division2_replicate_4_27_B_3_27) AND FIREABLE(division2_mutate_25_26_A_26_25)) OR (FIREABLE(division2_mutate_9_7_A_8_8) AND FIREABLE(division2_replicate_13_12_B_12_11)) OR NOT FIREABLE(division2_replicate_6_28_B_7_27) OR NOT FIREABLE(division2_mutate_25_25_B_25_24)) AND FIREABLE(division2_mutate_10_11_A_11_10)))) : E (F ((FIREABLE(division2_mutate_17_14_A_18_13) AND NOT FIREABLE(division1_mutate_7_5_A)))) : E (F (((FIREABLE(division2_replicate_13_20_A_13_19) AND FIREABLE(division2_replicate_16_22_B_15_23)) OR (FIREABLE(division2_replicate_9_30_A_8_29) AND FIREABLE(division2_mutate_23_8_B_22_8) AND FIREABLE(division2_mutate_29_4_A_30_5) AND FIREABLE(division2_replicate_8_5_A_8_6) AND FIREABLE(division2_replicate_5_3_A_6_2))))) : E (F (((FIREABLE(division2_mutate_25_16_A_26_15) OR FIREABLE(division2_mutate_21_14_A_20_13)) AND (NOT FIREABLE(division2_mutate_23_20_A_23_21) OR NOT FIREABLE(division2_replicate_25_2_A_24_2) OR NOT FIREABLE(division2_replicate_9_26_B_10_25))))) : E (F (FIREABLE(division2_replicate_21_5_B_20_6))) : A (G ((FIREABLE(division1_replicate_14_4_A) OR (NOT FIREABLE(division1_replicate_23_1_A) AND NOT FIREABLE(division2_mutate_24_19_A_25_19)) OR (FIREABLE(division2_replicate_25_6_B_26_6) AND (NOT FIREABLE(division2_mutate_7_29_B_8_28) OR NOT FIREABLE(division2_replicate_16_21_B_17_21)))))) : E (F ((FIREABLE(division2_replicate_1_22_B_2_22) AND FIREABLE(division2_mutate_27_14_A_28_14)))) : E (F ((FIREABLE(division2_mutate_17_8_B_16_8) OR FIREABLE(division2_mutate_30_27_A_30_28) OR FIREABLE(division2_mutate_24_6_A_25_6) OR FIREABLE(division2_replicate_25_25_B_26_24)))) : A (G ((FIREABLE(division1_replicate_7_26_A) OR (NOT FIREABLE(division2_mutate_5_11_B_6_10) AND NOT FIREABLE(division2_replicate_2_17_B_1_17)) OR FIREABLE(division2_replicate_1_15_A_1_16) OR FIREABLE(division2_replicate_9_10_B_8_11) OR NOT FIREABLE(division2_replicate_14_9_B_14_10) OR FIREABLE(division2_replicate_8_4_B_9_3)))) : E (F (FIREABLE(division2_mutate_26_21_A_27_21))) : A (G ((NOT FIREABLE(division2_mutate_25_19_B_26_19) AND NOT FIREABLE(division2_replicate_28_18_B_29_19) AND (NOT FIREABLE(division2_mutate_18_17_A_18_16) OR NOT FIREABLE(division2_mutate_4_20_A_5_19)) AND NOT FIREABLE(division2_replicate_27_29_B_26_29))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(division2_replicate_2_18_B_3_18) AND FIREABLE(division2_mutate_9_26_B_10_27)) OR (FIREABLE(division2_mutate_5_19_B_4_19) AND FIREABLE(division1_mutate_17_11_A))) AND FIREABLE(division2_replicate_11_11_B_12_12) AND (FIREABLE(division2_replicate_26_13_A_25_13) OR FIREABLE(division2_mutate_2_28_B_3_28) OR (FIREABLE(division2_replicate_6_19_B_7_20) AND FIREABLE(division2_mutate_21... (shortened)
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 7204 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 138 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 34 markings, 33 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(division2_mutate_26_27_A_27_26) OR NOT FIREABLE(division2_replicate_28_13_B_27_13) OR NOT FIREABLE(division2_replicate_25_2_A_26_2) OR FIREABLE(division2_replicate_10_29_B_11_29))))
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 7204 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 20 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32 markings, 31 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(division2_mutate_8_1_B_7_2)))
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 7204 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(division2_mutate_25_20_A_26_21) OR (FIREABLE(division2_mutate_17_12_B_18_11) AND FIREABLE(division1_mutate_25_11_A) AND FIREABLE(division2_mutate_23_30_B_22_29) AND FIREABLE(division2_mutate_7_6_A_6_6)) OR FIREABLE(division2_replicate_22_27_A_22_26))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 7204 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 80 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_mutate_2_9_B_2_10) AND NOT FIREABLE(division2_mutate_29_20_B_29_19) AND (FIREABLE(division2_replicate_21_24_A_22_23) OR (FIREABLE(division2_mutate_7_19_B_7_20) AND FIREABLE(division1_replicate_13_14_A) AND (FIREABLE(division2_replicate_22_18_A_22_19) OR FIREABLE(division2_mutate_13_4_A_12_3)))))))
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 7204 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 66 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(division2_replicate_4_27_B_3_27) AND FIREABLE(division2_mutate_25_26_A_26_25)) OR (FIREABLE(division2_mutate_9_7_A_8_8) AND FIREABLE(division2_replicate_13_12_B_12_11)) OR NOT FIREABLE(division2_replicate_6_28_B_7_27) OR NOT FIREABLE(division2_mutate_25_25_B_25_24)) AND FIREABLE(division2_mutate_10_11_A_11_10))))
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 7204 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 34 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_mutate_17_14_A_18_13) AND NOT FIREABLE(division1_mutate_7_5_A))))
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 7204 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(division2_replicate_13_20_A_13_19) AND FIREABLE(division2_replicate_16_22_B_15_23)) OR (FIREABLE(division2_replicate_9_30_A_8_29) AND FIREABLE(division2_mutate_23_8_B_22_8) AND FIREABLE(division2_mutate_29_4_A_30_5) AND FIREABLE(division2_replicate_8_5_A_8_6) AND FIREABLE(division2_replicate_5_3_A_6_2)))))
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 7204 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 21 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-7.sara.
lola: sara is running 0 secs || 590 markings, 824 edges, 118 markings/sec, 0 secs
lola: sara is running 5 secs || 1028 markings, 2226 edges, 88 markings/sec, 5 secs
lola: sara is running 10 secs || 1489 markings, 4143 edges, 92 markings/sec, 10 secs
lola: sara is running 15 secs || 2183 markings, 6958 edges, 139 markings/sec, 15 secs
lola: sara is running 20 secs || 2839 markings, 9849 edges, 131 markings/sec, 20 secs
lola: sara is running 25 secs || 4492 markings, 18029 edges, 331 markings/sec, 25 secs
lola: sara is running 30 secs || 9384 markings, 56450 edges, 978 markings/sec, 30 secs
lola: sara is running 35 secs || 14009 markings, 94656 edges, 925 markings/sec, 35 secs
lola: sara is running 40 secs || 18488 markings, 130254 edges, 896 markings/sec, 40 secs
lola: sara is running 45 secs || 22979 markings, 168448 edges, 898 markings/sec, 45 secs
lola: sara is running 50 secs || 27420 markings, 207593 edges, 888 markings/sec, 50 secs
lola: sara is running 55 secs || 31973 markings, 247554 edges, 911 markings/sec, 55 secs
lola: sara is running 60 secs || 36720 markings, 285342 edges, 949 markings/sec, 60 secs
lola: sara is running 65 secs || 41520 markings, 324469 edges, 960 markings/sec, 65 secs
lola: sara is running 70 secs || 46248 markings, 362566 edges, 946 markings/sec, 70 secs
lola: sara is running 75 secs || 50821 markings, 402709 edges, 915 markings/sec, 75 secs
lola: sara is running 80 secs || 55470 markings, 443879 edges, 930 markings/sec, 80 secs
lola: sara is running 85 secs || 59988 markings, 483662 edges, 904 markings/sec, 85 secs
lola: sara is running 90 secs || 64485 markings, 522944 edges, 899 markings/sec, 90 secs
lola: sara is running 95 secs || 68960 markings, 561746 edges, 895 markings/sec, 95 secs
lola: sara is running 100 secs || 73356 markings, 600424 edges, 879 markings/sec, 100 secs
lola: sara is running 105 secs || 77805 markings, 641824 edges, 890 markings/sec, 105 secs
lola: sara is running 110 secs || 82098 markings, 683302 edges, 859 markings/sec, 110 secs
lola: sara is running 115 secs || 86844 markings, 722089 edges, 949 markings/sec, 115 secs
lola: sara is running 120 secs || 91460 markings, 760737 edges, 923 markings/sec, 120 secs
lola: sara is running 125 secs || 96456 markings, 800152 edges, 999 markings/sec, 125 secs
lola: sara is running 130 secs || 101026 markings, 838397 edges, 914 markings/sec, 130 secs
lola: sara is running 135 secs || 105732 markings, 879543 edges, 941 markings/sec, 135 secs
lola: sara is running 140 secs || 110518 markings, 921657 edges, 957 markings/sec, 140 secs
lola: sara is running 145 secs || 115228 markings, 959673 edges, 942 markings/sec, 145 secs
lola: sara is running 150 secs || 120062 markings, 998732 edges, 967 markings/sec, 150 secs
lola: sara is running 155 secs || 124868 markings, 1037339 edges, 961 markings/sec, 155 secs
lola: sara is running 160 secs || 129640 markings, 1079149 edges, 954 markings/sec, 160 secs
lola: sara is running 165 secs || 134184 markings, 1119571 edges, 909 markings/sec, 165 secs
lola: sara is running 170 secs || 138803 markings, 1160188 edges, 924 markings/sec, 170 secs
lola: sara is running 175 secs || 143316 markings, 1199725 edges, 903 markings/sec, 175 secs
lola: sara is running 180 secs || 147854 markings, 1238812 edges, 908 markings/sec, 180 secs
lola: sara is running 185 secs || 152268 markings, 1277936 edges, 883 markings/sec, 185 secs
lola: sara is running 190 secs || 156612 markings, 1318334 edges, 869 markings/sec, 190 secs
lola: sara is running 195 secs || 161030 markings, 1361128 edges, 884 markings/sec, 195 secs
lola: sara is running 200 secs || 165456 markings, 1401787 edges, 885 markings/sec, 200 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 205 secs || 169836 markings, 1443248 edges, 876 markings/sec, 205 secs
lola: sara is running 210 secs || 174282 markings, 1483968 edges, 889 markings/sec, 210 secs
lola: sara is running 215 secs || 178608 markings, 1525104 edges, 865 markings/sec, 215 secs
lola: sara is running 220 secs || 183045 markings, 1569053 edges, 887 markings/sec, 220 secs
lola: sara is running 225 secs || 187478 markings, 1615098 edges, 887 markings/sec, 225 secs
lola: sara is running 230 secs || 191934 markings, 1655831 edges, 891 markings/sec, 230 secs
lola: sara is running 235 secs || 196559 markings, 1700544 edges, 925 markings/sec, 235 secs
lola: sara is running 240 secs || 201136 markings, 1741682 edges, 915 markings/sec, 240 secs
lola: sara is running 245 secs || 205596 markings, 1784795 edges, 892 markings/sec, 245 secs
lola: sara is running 250 secs || 210117 markings, 1829694 edges, 904 markings/sec, 250 secs
lola: sara is running 255 secs || 214658 markings, 1876443 edges, 908 markings/sec, 255 secs
lola: sara is running 260 secs || 218841 markings, 1917385 edges, 837 markings/sec, 260 secs
lola: sara is running 265 secs || 223231 markings, 1961738 edges, 878 markings/sec, 265 secs
lola: sara is running 270 secs || 227808 markings, 2006337 edges, 915 markings/sec, 270 secs
lola: sara is running 275 secs || 232115 markings, 2050371 edges, 861 markings/sec, 275 secs
lola: sara is running 280 secs || 236378 markings, 2095857 edges, 853 markings/sec, 280 secs
lola: sara is running 285 secs || 240640 markings, 2141353 edges, 852 markings/sec, 285 secs
lola: sara is running 290 secs || 245189 markings, 2177152 edges, 910 markings/sec, 290 secs
lola: sara is running 295 secs || 249723 markings, 2214607 edges, 907 markings/sec, 295 secs
lola: sara is running 300 secs || 254272 markings, 2250411 edges, 910 markings/sec, 300 secs
lola: sara is running 305 secs || 258715 markings, 2288184 edges, 889 markings/sec, 305 secs
lola: sara is running 310 secs || 263186 markings, 2327198 edges, 894 markings/sec, 310 secs
lola: sara is running 315 secs || 267749 markings, 2367602 edges, 913 markings/sec, 315 secs
lola: sara is running 320 secs || 272384 markings, 2404568 edges, 927 markings/sec, 320 secs
lola: sara is running 325 secs || 276972 markings, 2442306 edges, 918 markings/sec, 325 secs
lola: sara is running 330 secs || 281557 markings, 2479058 edges, 917 markings/sec, 330 secs
lola: sara is running 335 secs || 286165 markings, 2518284 edges, 922 markings/sec, 335 secs
lola: sara is running 340 secs || 290650 markings, 2558032 edges, 897 markings/sec, 340 secs
lola: sara is running 345 secs || 295098 markings, 2597745 edges, 890 markings/sec, 345 secs
lola: sara is running 350 secs || 299610 markings, 2636819 edges, 902 markings/sec, 350 secs
lola: sara is running 355 secs || 303942 markings, 2674787 edges, 866 markings/sec, 355 secs
lola: sara is running 360 secs || 308427 markings, 2713652 edges, 897 markings/sec, 360 secs
lola: sara is running 365 secs || 312757 markings, 2753774 edges, 866 markings/sec, 365 secs
lola: sara is running 370 secs || 317181 markings, 2795681 edges, 885 markings/sec, 370 secs
lola: sara is running 375 secs || 321780 markings, 2835946 edges, 920 markings/sec, 375 secs
lola: sara is running 380 secs || 326378 markings, 2872933 edges, 920 markings/sec, 380 secs
lola: sara is running 385 secs || 331008 markings, 2910603 edges, 926 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(division2_mutate_25_16_A_26_15) OR FIREABLE(division2_mutate_21_14_A_20_13)) AND (NOT FIREABLE(division2_mutate_23_20_A_23_21) OR NOT FIREABLE(division2_replicate_25_2_A_24_2) OR NOT FIREABLE(division2_replicate_9_26_B_10_25)))))
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 7204 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 48 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_replicate_21_5_B_20_6)))
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 7204 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 10 will run for 523 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(division1_replicate_14_4_A) OR (NOT FIREABLE(division1_replicate_23_1_A) AND NOT FIREABLE(division2_mutate_24_19_A_25_19)) OR (FIREABLE(division2_replicate_25_6_B_26_6) AND (NOT FIREABLE(division2_mutate_7_29_B_8_28) OR NOT FIREABLE(division2_replicate_16_21_B_17_21))))))
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 7204 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 80 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 11 will run for 628 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_replicate_1_22_B_2_22) AND FIREABLE(division2_mutate_27_14_A_28_14))))
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 7204 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 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: ========================================
lola: subprocess 12 will run for 785 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_mutate_17_8_B_16_8) OR FIREABLE(division2_mutate_30_27_A_30_28) OR FIREABLE(division2_mutate_24_6_A_25_6) OR FIREABLE(division2_replicate_25_25_B_26_24))))
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 7204 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 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 13 will run for 1047 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(division1_replicate_7_26_A) OR (NOT FIREABLE(division2_mutate_5_11_B_6_10) AND NOT FIREABLE(division2_replicate_2_17_B_1_17)) OR FIREABLE(division2_replicate_1_15_A_1_16) OR FIREABLE(division2_replicate_9_10_B_8_11) OR NOT FIREABLE(division2_replicate_14_9_B_14_10) OR FIREABLE(division2_replicate_8_4_B_9_3))))
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 7204 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 320 literals and 32 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 14 will run for 1571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_mutate_26_21_A_27_21)))
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 7204 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 15 will run for 3142 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(division2_mutate_25_19_B_26_19) AND NOT FIREABLE(division2_replicate_28_18_B_29_19) AND (NOT FIREABLE(division2_mutate_18_17_A_18_16) OR NOT FIREABLE(division2_mutate_4_20_A_5_19)) AND NOT FIREABLE(division2_replicate_27_29_B_26_29))))
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 7204 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 15 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: RESULT
lola:
SUMMARY: yes no no no yes yes yes unknown yes yes no yes yes no yes no
lola: ========================================
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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="PhaseVariation-PT-D30CS100"
export BK_EXAMINATION="ReachabilityFireability"
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/PhaseVariation-PT-D30CS100.tgz
mv PhaseVariation-PT-D30CS100 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 PhaseVariation-PT-D30CS100, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-csrt-152666478800665"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;