fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r128-smll-149441681200126
Last Updated
June 27, 2017

About the Execution of LoLA for S_PhaseVariation-PT-D20CS010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
315.220 212831.00 424246.00 939.90 FTTFTTTFTTTTFTTT 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)
...........................................................
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_PhaseVariation-PT-D20CS010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681200126
=====================================================================


--------------------
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-D20CS010-ReachabilityFireability-0
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-1
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-10
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-11
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-12
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-13
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-14
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-15
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-2
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-3
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-4
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-5
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-6
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-7
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-8
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityFireability-9

=== Now, execution of the tool begins

BK_START 1496295264941


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


checking for too many tokens
===========================================================================================
S_PhaseVariation-PT-D20CS010: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_PhaseVariation-PT-D20CS010 @ 3539 seconds
----- 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: 14659/65536 symbol table entries, 2626 collisions
lola: preprocessing...
lola: finding significant places
lola: 1202 places, 13457 transitions, 801 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-D20CS010-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(division2_replicate_16_8_B_15_9) OR NOT FIREABLE(division2_mutate_16_10_A_17_10) OR (FIREABLE(division2_mutate_12_12_A_11_11) AND FIREABLE(division2_replicate_17_18_A_18_17)) OR NOT FIREABLE(division2_mutate_8_12_A_7_12) OR (FIREABLE(division2_replicate_16_11_B_17_11) AND (NOT FIREABLE(division1_mutate_2_19_B) OR (FIREABLE(division1_mutate_1_9_A) AND FIREABLE(division2_mutate_5_8_B_5_9))))))) : E (F (FIREABLE(division2_mutate_6_19_A_5_20))) : E (F (FIREABLE(division2_mutate_6_8_B_5_9))) : E (F (FIREABLE(division2_replicate_1_16_A_1_17))) : E (F (FIREABLE(division2_mutate_6_3_B_6_4))) : E (F ((FIREABLE(division2_mutate_20_20_B_19_19) OR FIREABLE(division1_replicate_8_11_A) OR (FIREABLE(division2_mutate_5_2_B_5_1) AND FIREABLE(division2_mutate_13_13_A_13_12))))) : A (G (NOT FIREABLE(division2_replicate_17_16_B_18_16))) : E (F ((((NOT FIREABLE(division2_mutate_19_7_B_18_7) AND FIREABLE(division2_replicate_8_6_B_9_7)) OR (NOT FIREABLE(division2_replicate_14_7_A_15_6) AND NOT FIREABLE(division2_mutate_12_13_B_13_13))) AND (FIREABLE(division2_mutate_20_15_A_19_15) OR FIREABLE(division2_replicate_6_18_B_7_17) OR (FIREABLE(division2_mutate_11_9_A_12_10) AND FIREABLE(division2_replicate_13_13_B_14_13)) OR FIREABLE(division2_replicate_13_2_A_14_1))))) : E (F (((FIREABLE(division2_mutate_9_20_B_8_20) OR FIREABLE(division2_mutate_6_5_A_7_6)) AND (NOT FIREABLE(division2_replicate_11_7_A_10_7) OR NOT FIREABLE(division2_replicate_10_2_B_11_3) OR NOT FIREABLE(division2_mutate_12_9_B_11_9) OR NOT FIREABLE(division2_mutate_10_19_B_11_20))))) : E (F (FIREABLE(division2_replicate_9_17_B_9_16))) : A (G ((NOT FIREABLE(division2_mutate_7_13_B_8_13) OR NOT FIREABLE(division1_mutate_17_17_A) OR FIREABLE(division2_mutate_18_18_B_19_18) OR FIREABLE(division2_replicate_5_8_A_4_8)))) : E (F (FIREABLE(division1_replicate_16_15_B))) : E (F (FIREABLE(division2_replicate_1_8_B_2_7))) : E (F (((FIREABLE(division1_mutate_9_18_B) AND (NOT FIREABLE(division2_replicate_19_14_B_19_13) OR NOT FIREABLE(division2_replicate_12_14_A_12_15))) OR FIREABLE(division2_replicate_18_8_A_17_7)))) : A (G ((NOT FIREABLE(division2_replicate_7_12_A_6_12) OR NOT FIREABLE(division2_mutate_15_5_B_14_6) OR NOT FIREABLE(division2_replicate_3_8_B_2_7) OR NOT FIREABLE(division2_mutate_16_4_B_15_5)))) : E (F (FIREABLE(division1_replicate_15_4_B)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(division2_replicate_16_8_B_15_9) OR NOT FIREABLE(division2_mutate_16_10_A_17_10) OR (FIREABLE(division2_mutate_12_12_A_11_11) AND FIREABLE(division2_replicate_17_18_A_18_17)) OR NOT FIREABLE(division2_mutate_8_12_A_7_12) OR (FIREABLE(division2_replicate_16_11_B_17_11) AND (NOT FIREABLE(division1_mutate_2_19_B) OR (FIREABLE(division1_mutate_1_9_A) AND FIREABLE(division2_mut... (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 3204 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 312 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_mutate_6_19_A_5_20)))
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 3204 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-D20CS010-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_mutate_6_8_B_5_9)))
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 3204 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-D20CS010-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_replicate_1_16_A_1_17)))
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 3204 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-D20CS010-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_mutate_6_3_B_6_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 3204 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-D20CS010-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_mutate_20_20_B_19_19) OR FIREABLE(division1_replicate_8_11_A) OR (FIREABLE(division2_mutate_5_2_B_5_1) AND FIREABLE(division2_mutate_13_13_A_13_12)))))
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 3204 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 3 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(division2_replicate_17_16_B_18_16)))
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 3204 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-D20CS010-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((NOT FIREABLE(division2_mutate_19_7_B_18_7) AND FIREABLE(division2_replicate_8_6_B_9_7)) OR (NOT FIREABLE(division2_replicate_14_7_A_15_6) AND NOT FIREABLE(division2_mutate_12_13_B_13_13))) AND (FIREABLE(division2_mutate_20_15_A_19_15) OR FIREABLE(division2_replicate_6_18_B_7_17) OR (FIREABLE(division2_mutate_11_9_A_12_10) AND FIREABLE(division2_replicate_13_13_B_14_13)) OR FIREABLE(di... (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 3204 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 154 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(division2_mutate_9_20_B_8_20) OR FIREABLE(division2_mutate_6_5_A_7_6)) AND (NOT FIREABLE(division2_replicate_11_7_A_10_7) OR NOT FIREABLE(division2_replicate_10_2_B_11_3) OR NOT FIREABLE(division2_mutate_12_9_B_11_9) OR NOT FIREABLE(division2_mutate_10_19_B_11_20)))))
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 3204 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 64 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_replicate_9_17_B_9_16)))
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 3204 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-D20CS010-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(division2_mutate_7_13_B_8_13) OR NOT FIREABLE(division1_mutate_17_17_A) OR FIREABLE(division2_mutate_18_18_B_19_18) OR FIREABLE(division2_replicate_5_8_A_4_8))))
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 3204 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 32 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-10.sara.
lola: sara is running 0 secs || 1988 markings, 9451 edges, 398 markings/sec, 0 secs
lola: sara is running 5 secs || 8212 markings, 75849 edges, 1245 markings/sec, 5 secs
lola: sara is running 10 secs || 14332 markings, 143410 edges, 1224 markings/sec, 10 secs
lola: sara is running 15 secs || 20289 markings, 219082 edges, 1191 markings/sec, 15 secs
lola: sara is running 20 secs || 25991 markings, 304243 edges, 1140 markings/sec, 20 secs
lola: sara is running 25 secs || 32067 markings, 376444 edges, 1215 markings/sec, 25 secs
lola: sara is running 30 secs || 38037 markings, 452343 edges, 1194 markings/sec, 30 secs
lola: sara is running 35 secs || 43726 markings, 538033 edges, 1138 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 40 secs || 49796 markings, 608994 edges, 1214 markings/sec, 40 secs
lola: sara is running 45 secs || 55720 markings, 684706 edges, 1185 markings/sec, 45 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 696 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division1_replicate_16_15_B)))
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 3204 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-D20CS010-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-11.sara.
lola: sara is running 0 secs || 2530 markings, 16175 edges, 506 markings/sec, 0 secs
lola: sara is running 5 secs || 8733 markings, 82683 edges, 1241 markings/sec, 5 secs
lola: sara is running 10 secs || 14966 markings, 147581 edges, 1247 markings/sec, 10 secs
lola: sara is running 15 secs || 20920 markings, 223385 edges, 1191 markings/sec, 15 secs
lola: sara is running 20 secs || 26593 markings, 309200 edges, 1135 markings/sec, 20 secs
lola: sara is running 25 secs || 32816 markings, 375917 edges, 1245 markings/sec, 25 secs
lola: sara is running 30 secs || 38802 markings, 451244 edges, 1197 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 35 secs || 44559 markings, 533934 edges, 1151 markings/sec, 35 secs

lola: sara is running 40 secs || 50840 markings, 598558 edges, 1256 markings/sec, 40 secs
lola: sara is running 45 secs || 56766 markings, 675294 edges, 1185 markings/sec, 45 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 858 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_replicate_1_8_B_2_7)))
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 3204 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-D20CS010-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1144 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(division1_mutate_9_18_B) AND (NOT FIREABLE(division2_replicate_19_14_B_19_13) OR NOT FIREABLE(division2_replicate_12_14_A_12_15))) OR FIREABLE(division2_replicate_18_8_A_17_7))))
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 3204 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 19 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1716 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(division2_replicate_7_12_A_6_12) OR NOT FIREABLE(division2_mutate_15_5_B_14_6) OR NOT FIREABLE(division2_replicate_3_8_B_2_7) OR NOT FIREABLE(division2_mutate_16_4_B_15_5))))
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 3204 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 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-14.sara.
lola: sara is running 0 secs || 2323 markings, 9746 edges, 465 markings/sec, 0 secs
lola: sara is running 5 secs || 9009 markings, 65886 edges, 1337 markings/sec, 5 secs
lola: sara is running 10 secs || 15664 markings, 123084 edges, 1331 markings/sec, 10 secs
lola: sara is running 15 secs || 22230 markings, 184156 edges, 1313 markings/sec, 15 secs
lola: sara is running 20 secs || 28900 markings, 241654 edges, 1334 markings/sec, 20 secs
lola: sara is running 25 secs || 35545 markings, 299721 edges, 1329 markings/sec, 25 secs
lola: sara is running 30 secs || 41872 markings, 356023 edges, 1265 markings/sec, 30 secs
lola: sara is running 35 secs || 48038 markings, 416875 edges, 1233 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 40 secs || 54159 markings, 479136 edges, 1224 markings/sec, 40 secs
lola: sara is running 45 secs || 60258 markings, 542573 edges, 1220 markings/sec, 45 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 3379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division1_replicate_15_4_B)))
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 3204 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-D20CS010-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityFireability-15.sara.
lola: sara is running 0 secs || 2703 markings, 19618 edges, 541 markings/sec, 0 secs
lola: sara is running 5 secs || 8887 markings, 89273 edges, 1237 markings/sec, 5 secs
lola: sara is running 10 secs || 15138 markings, 156338 edges, 1250 markings/sec, 10 secs
lola: sara is running 15 secs || 21075 markings, 235082 edges, 1187 markings/sec, 15 secs
lola: sara is running 20 secs || 26743 markings, 323214 edges, 1134 markings/sec, 20 secs
lola: sara is running 25 secs || 32998 markings, 391111 edges, 1251 markings/sec, 25 secs
lola: sara is running 30 secs || 38937 markings, 470144 edges, 1188 markings/sec, 30 secs
lola: sara is running 35 secs || 44556 markings, 559996 edges, 1124 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 40 secs || 50854 markings, 625570 edges, 1260 markings/sec, 40 secs
lola: sara is running 45 secs || 56764 markings, 704882 edges, 1182 markings/sec, 45 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes yes yes no yes yes yes yes no yes yes yes no
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496295477772

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="S_PhaseVariation-PT-D20CS010"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
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/S_PhaseVariation-PT-D20CS010.tgz
mv S_PhaseVariation-PT-D20CS010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_PhaseVariation-PT-D20CS010, 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 r128-smll-149441681200126"
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 ;