About the Execution of Irma.struct for PhaseVariation-PT-D30CS010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1288.340 | 387458.00 | 705494.00 | 241.10 | TTTTTFTFTTTFFFFT | normal |
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 4.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K 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 2.8K 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 4.3K 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.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K 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 irma4mcc-structural
Input is PhaseVariation-PT-D30CS010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666474300658
=====================================================================
--------------------
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-D30CS010-ReachabilityFireability-00
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityFireability-01
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityFireability-02
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityFireability-03
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityFireability-04
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityFireability-05
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityFireability-06
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityFireability-07
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityFireability-08
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityFireability-09
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityFireability-10
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityFireability-11
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityFireability-12
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityFireability-13
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityFireability-14
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1527156632874
BK_STOP 1527157020332
--------------------
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 PhaseVariation-PT-D30CS010 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': 713208, 'Memory': 970.1, 'Tool': 'lola'}, {'Time': 714222, 'Memory': 962.36, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityFireability lola PhaseVariation-PT-D30CS010...
Time: 3600 - MCC
----- Start make prepare stderr -----
----- Start make prepare stdout -----
===========================================================================================
PhaseVariation-PT-D30CS010: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
PhaseVariation-PT-D30CS010: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ PhaseVariation-PT-D30CS010 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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-D30CS010-ReachabilityFireability.task
lola: E (F (FIREABLE(division2_mutate_1_7_B_2_6))) : E (F (FIREABLE(division2_mutate_19_29_B_20_29))) : E (F ((NOT FIREABLE(division2_mutate_24_4_B_25_3) AND FIREABLE(division2_mutate_20_19_A_19_18)))) : E (F (((NOT FIREABLE(division2_replicate_27_27_A_28_26) OR NOT FIREABLE(division2_mutate_17_14_A_17_15) OR (NOT FIREABLE(division2_replicate_16_15_B_15_15) AND NOT FIREABLE(division2_replicate_28_24_A_29_24))) AND ((FIREABLE(division2_mutate_4_17_A_3_18) AND (FIREABLE(division2_mutate_9_5_A_9_4) OR FIREABLE(division1_replicate_17_24_A))) OR FIREABLE(division2_replicate_8_21_A_7_21))))) : E (F ((NOT FIREABLE(division1_mutate_8_25_A) AND FIREABLE(division2_mutate_9_3_B_8_3) AND FIREABLE(division2_replicate_19_3_A_20_3) AND FIREABLE(division2_replicate_16_19_B_16_18) AND NOT FIREABLE(division2_replicate_29_4_B_30_5) AND (FIREABLE(division2_mutate_17_9_B_16_10) OR FIREABLE(division2_replicate_8_27_A_7_27))))) : A (G (NOT FIREABLE(division2_replicate_8_23_B_8_22))) : E (F (FIREABLE(division2_mutate_4_5_B_4_4))) : A (G ((FIREABLE(division2_replicate_13_26_A_14_27) OR FIREABLE(division2_mutate_9_22_B_10_22) OR NOT FIREABLE(division2_mutate_12_17_A_12_16) OR NOT FIREABLE(division2_mutate_3_8_A_4_7) OR FIREABLE(division2_replicate_27_12_A_28_13)))) : E (F (FIREABLE(division2_replicate_30_4_B_29_5))) : E (F (((FIREABLE(division2_mutate_23_7_A_22_7) OR FIREABLE(division2_replicate_1_12_B_1_11) OR (FIREABLE(division2_replicate_26_10_A_27_9) AND FIREABLE(division2_replicate_23_3_B_24_2))) AND FIREABLE(division2_mutate_24_21_B_23_22) AND NOT FIREABLE(division2_mutate_7_4_B_8_3)))) : E (F (((FIREABLE(division2_replicate_29_9_B_29_8) OR FIREABLE(division2_replicate_25_19_B_24_19) OR FIREABLE(division2_replicate_14_3_A_14_4) OR FIREABLE(division2_mutate_17_24_A_16_25)) AND (NOT FIREABLE(division2_mutate_15_5_A_15_4) OR FIREABLE(division1_replicate_22_15_B)) AND ((FIREABLE(division2_mutate_5_29_B_6_30) AND FIREABLE(division2_replicate_6_28_B_6_29)) OR FIREABLE(division2_mutate_3_27_A_2_28) OR NOT FIREABLE(division2_mutate_25_27_B_24_27))))) : A (G ((FIREABLE(division2_mutate_15_27_B_14_27) OR (FIREABLE(division2_mutate_18_22_B_17_21) AND FIREABLE(division1_replicate_22_28_A) AND FIREABLE(division2_mutate_1_10_B_1_9) AND FIREABLE(division1_replicate_2_24_A)) OR ((NOT FIREABLE(division2_replicate_15_29_B_16_29) OR NOT FIREABLE(division2_replicate_8_20_B_9_21)) AND (NOT FIREABLE(division1_mutate_29_30_A) OR NOT FIREABLE(division2_replicate_29_23_B_30_23)))))) : E (F (((FIREABLE(division1_mutate_27_19_B) OR FIREABLE(division2_replicate_30_15_B_30_14)) AND NOT FIREABLE(division2_mutate_24_23_A_25_23) AND FIREABLE(division2_replicate_17_15_A_17_14) AND FIREABLE(division1_replicate_25_29_A) AND (((FIREABLE(division1_replicate_21_6_A) OR FIREABLE(division2_mutate_12_9_B_11_8)) AND (FIREABLE(division2_mutate_26_20_A_25_21) OR FIREABLE(division2_replicate_28_23_B_27_23))) OR (FIREABLE(division2_replicate_20_12_B_21_11) AND (FIREABLE(division2_mutate_5_5_A_5_4) OR FIREABLE(division2_mutate_4_15_A_4_14))))))) : A (G (NOT FIREABLE(division2_replicate_3_13_A_4_12))) : A (G ((NOT FIREABLE(division2_replicate_13_7_A_12_8) OR FIREABLE(division2_replicate_27_3_A_28_2) OR NOT FIREABLE(division2_mutate_26_20_B_26_21)))) : E (F (FIREABLE(division2_replicate_21_29_B_20_28)))
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_mutate_1_7_B_2_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-D30CS010-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_mutate_19_29_B_20_29)))
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-D30CS010-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(division2_mutate_24_4_B_25_3) AND FIREABLE(division2_mutate_20_19_A_19_18))))
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-D30CS010-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(division2_replicate_27_27_A_28_26) OR NOT FIREABLE(division2_mutate_17_14_A_17_15) OR (NOT FIREABLE(division2_replicate_16_15_B_15_15) AND NOT FIREABLE(division2_replicate_28_24_A_29_24))) AND ((FIREABLE(division2_mutate_4_17_A_3_18) AND (FIREABLE(division2_mutate_9_5_A_9_4) OR FIREABLE(division1_replicate_17_24_A))) OR FIREABLE(division2_replicate_8_21_A_7_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 156 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(division1_mutate_8_25_A) AND FIREABLE(division2_mutate_9_3_B_8_3) AND FIREABLE(division2_replicate_19_3_A_20_3) AND FIREABLE(division2_replicate_16_19_B_16_18) AND NOT FIREABLE(division2_replicate_29_4_B_30_5) AND (FIREABLE(division2_mutate_17_9_B_16_10) OR FIREABLE(division2_replicate_8_27_A_7_27)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
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 112 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(division2_replicate_8_23_B_8_22)))
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: ========================================
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-D30CS010-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_mutate_4_5_B_4_4)))
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-D30CS010-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(division2_replicate_13_26_A_14_27) OR FIREABLE(division2_mutate_9_22_B_10_22) OR NOT FIREABLE(division2_mutate_12_17_A_12_16) OR NOT FIREABLE(division2_mutate_3_8_A_4_7) OR FIREABLE(division2_replicate_27_12_A_28_13))))
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 72 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_replicate_30_4_B_29_5)))
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-D30CS010-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(division2_mutate_23_7_A_22_7) OR FIREABLE(division2_replicate_1_12_B_1_11) OR (FIREABLE(division2_replicate_26_10_A_27_9) AND FIREABLE(division2_replicate_23_3_B_24_2))) AND FIREABLE(division2_mutate_24_21_B_23_22) AND NOT FIREABLE(division2_mutate_7_4_B_8_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 48 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(division2_replicate_29_9_B_29_8) OR FIREABLE(division2_replicate_25_19_B_24_19) OR FIREABLE(division2_replicate_14_3_A_14_4) OR FIREABLE(division2_mutate_17_24_A_16_25)) AND (NOT FIREABLE(division2_mutate_15_5_A_15_4) OR FIREABLE(division1_replicate_22_15_B)) AND ((FIREABLE(division2_mutate_5_29_B_6_30) AND FIREABLE(division2_replicate_6_28_B_6_29)) OR FIREABLE(division2_muta... (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 356 literals and 48 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(division2_mutate_15_27_B_14_27) OR (FIREABLE(division2_mutate_18_22_B_17_21) AND FIREABLE(division1_replicate_22_28_A) AND FIREABLE(division2_mutate_1_10_B_1_9) AND FIREABLE(division1_replicate_2_24_A)) OR ((NOT FIREABLE(division2_replicate_15_29_B_16_29) OR NOT FIREABLE(division2_replicate_8_20_B_9_21)) AND (NOT FIREABLE(division1_mutate_29_30_A) OR NOT FIREABLE(division2_repl... (shortened)
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 256 literals and 32 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 12 will run for 883 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(division1_mutate_27_19_B) OR FIREABLE(division2_replicate_30_15_B_30_14)) AND NOT FIREABLE(division2_mutate_24_23_A_25_23) AND FIREABLE(division2_replicate_17_15_A_17_14) AND FIREABLE(division1_replicate_25_29_A) AND (((FIREABLE(division1_replicate_21_6_A) OR FIREABLE(division2_mutate_12_9_B_11_8)) AND (FIREABLE(division2_mutate_26_20_A_25_21) OR FIREABLE(division2_replicate_28... (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 384 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-12.sara.
lola: sara is running 0 secs || 708 markings, 857 edges, 142 markings/sec, 0 secs
lola: sara is running 5 secs || 1192 markings, 1461 edges, 97 markings/sec, 5 secs
lola: sara is running 10 secs || 1715 markings, 2098 edges, 105 markings/sec, 10 secs
lola: sara is running 15 secs || 2234 markings, 2738 edges, 104 markings/sec, 15 secs
lola: sara is running 20 secs || 2826 markings, 3660 edges, 118 markings/sec, 20 secs
lola: sara is running 25 secs || 3462 markings, 4969 edges, 127 markings/sec, 25 secs
lola: sara is running 30 secs || 6930 markings, 28985 edges, 694 markings/sec, 30 secs
lola: sara is running 35 secs || 11463 markings, 66429 edges, 907 markings/sec, 35 secs
lola: sara is running 40 secs || 15978 markings, 104239 edges, 903 markings/sec, 40 secs
lola: sara is running 45 secs || 20448 markings, 143186 edges, 894 markings/sec, 45 secs
lola: sara is running 50 secs || 24969 markings, 180206 edges, 904 markings/sec, 50 secs
lola: sara is running 55 secs || 29470 markings, 217719 edges, 900 markings/sec, 55 secs
lola: sara is running 60 secs || 33978 markings, 255417 edges, 902 markings/sec, 60 secs
lola: sara is running 65 secs || 38434 markings, 294898 edges, 891 markings/sec, 65 secs
lola: sara is running 70 secs || 42882 markings, 334574 edges, 890 markings/sec, 70 secs
lola: sara is running 75 secs || 47300 markings, 374842 edges, 884 markings/sec, 75 secs
lola: sara is running 80 secs || 51697 markings, 416157 edges, 879 markings/sec, 80 secs
lola: sara is running 85 secs || 56083 markings, 459349 edges, 877 markings/sec, 85 secs
lola: sara is running 90 secs || 60688 markings, 496404 edges, 921 markings/sec, 90 secs
lola: sara is running 95 secs || 65250 markings, 533610 edges, 912 markings/sec, 95 secs
lola: sara is running 100 secs || 69805 markings, 572569 edges, 911 markings/sec, 100 secs
lola: sara is running 105 secs || 74217 markings, 612456 edges, 882 markings/sec, 105 secs
lola: sara is running 110 secs || 78776 markings, 648622 edges, 912 markings/sec, 110 secs
lola: sara is running 115 secs || 83298 markings, 684922 edges, 904 markings/sec, 115 secs
lola: sara is running 120 secs || 87740 markings, 723581 edges, 888 markings/sec, 120 secs
lola: sara is running 125 secs || 92065 markings, 762741 edges, 865 markings/sec, 125 secs
lola: sara is running 130 secs || 96474 markings, 802194 edges, 882 markings/sec, 130 secs
lola: sara is running 135 secs || 100866 markings, 841175 edges, 878 markings/sec, 135 secs
lola: sara is running 140 secs || 105154 markings, 882619 edges, 858 markings/sec, 140 secs
lola: sara is running 145 secs || 109325 markings, 924011 edges, 834 markings/sec, 145 secs
lola: sara is running 150 secs || 113462 markings, 965231 edges, 827 markings/sec, 150 secs
lola: sara is running 155 secs || 117633 markings, 1007220 edges, 834 markings/sec, 155 secs
lola: sara is running 160 secs || 121825 markings, 1051275 edges, 838 markings/sec, 160 secs
lola: sara is running 165 secs || 125952 markings, 1096498 edges, 825 markings/sec, 165 secs
lola: sara is running 170 secs || 130206 markings, 1139153 edges, 851 markings/sec, 170 secs
lola: sara is running 175 secs || 134450 markings, 1183016 edges, 849 markings/sec, 175 secs
lola: sara is running 180 secs || 138690 markings, 1227048 edges, 848 markings/sec, 180 secs
lola: sara is running 185 secs || 142910 markings, 1272253 edges, 844 markings/sec, 185 secs
lola: sara is running 190 secs || 147064 markings, 1317617 edges, 831 markings/sec, 190 secs
lola: sara is running 195 secs || 151217 markings, 1364283 edges, 831 markings/sec, 195 secs
lola: sara is running 200 secs || 155405 markings, 1411303 edges, 838 markings/sec, 200 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 205 secs || 159501 markings, 1458468 edges, 819 markings/sec, 205 secs
lola: sara is running 210 secs || 163826 markings, 1500903 edges, 865 markings/sec, 210 secs
lola: sara is running 215 secs || 168354 markings, 1538378 edges, 906 markings/sec, 215 secs
lola: sara is running 220 secs || 172889 markings, 1575700 edges, 907 markings/sec, 220 secs
lola: sara is running 225 secs || 177409 markings, 1614647 edges, 904 markings/sec, 225 secs
lola: sara is running 230 secs || 181896 markings, 1652266 edges, 897 markings/sec, 230 secs
lola: sara is running 235 secs || 186392 markings, 1689454 edges, 899 markings/sec, 235 secs
lola: sara is running 240 secs || 190892 markings, 1727156 edges, 900 markings/sec, 240 secs
lola: sara is running 245 secs || 195346 markings, 1765923 edges, 891 markings/sec, 245 secs
lola: sara is running 250 secs || 199778 markings, 1805328 edges, 886 markings/sec, 250 secs
lola: sara is running 255 secs || 204178 markings, 1846370 edges, 880 markings/sec, 255 secs
lola: sara is running 260 secs || 208369 markings, 1885013 edges, 838 markings/sec, 260 secs
lola: sara is running 265 secs || 212586 markings, 1925499 edges, 843 markings/sec, 265 secs
lola: sara is running 270 secs || 216948 markings, 1968510 edges, 872 markings/sec, 270 secs
lola: sara is running 275 secs || 221133 markings, 2010747 edges, 837 markings/sec, 275 secs
lola: sara is running 280 secs || 225426 markings, 2054445 edges, 859 markings/sec, 280 secs
lola: sara is running 285 secs || 229690 markings, 2098963 edges, 853 markings/sec, 285 secs
lola: sara is running 290 secs || 233969 markings, 2143095 edges, 856 markings/sec, 290 secs
lola: sara is running 295 secs || 238325 markings, 2187147 edges, 871 markings/sec, 295 secs
lola: sara is running 300 secs || 242616 markings, 2229955 edges, 858 markings/sec, 300 secs
lola: sara is running 305 secs || 246914 markings, 2275016 edges, 860 markings/sec, 305 secs
lola: sara is running 310 secs || 251126 markings, 2321113 edges, 842 markings/sec, 310 secs
lola: sara is running 315 secs || 255394 markings, 2368373 edges, 854 markings/sec, 315 secs
lola: sara is running 320 secs || 259634 markings, 2413887 edges, 848 markings/sec, 320 secs
lola: sara is running 325 secs || 263801 markings, 2461063 edges, 833 markings/sec, 325 secs
lola: sara is running 330 secs || 268050 markings, 2505409 edges, 850 markings/sec, 330 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: subprocess 13 will run for 1065 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(division2_replicate_3_13_A_4_12)))
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: ========================================
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-D30CS010-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 14 will run for 1598 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(division2_replicate_13_7_A_12_8) OR FIREABLE(division2_replicate_27_3_A_28_2) OR NOT FIREABLE(division2_mutate_26_20_B_26_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 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 15 will run for 3196 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_replicate_21_29_B_20_28)))
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-D30CS010-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes no yes no yes yes yes no no no no yes
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityFireability-15 TRUE 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-D30CS010"
export BK_EXAMINATION="ReachabilityFireability"
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/PhaseVariation-PT-D30CS010.tgz
mv PhaseVariation-PT-D30CS010 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 PhaseVariation-PT-D30CS010, 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 r115-csrt-152666474300658"
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 '
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 ;