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 268K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 6.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K 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.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 103K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is ResAllocation-PT-R003C015, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673584000357
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527971207423


BK_STOP 1527971432378

--------------------
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 ResAllocation-PT-R003C015 as instance name.
Using ResAllocation 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': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 454, 'Memory': 110.91, 'Tool': 'lola'}, {'Time': 581, 'Memory': 111.48, 'Tool': 'lola'}, {'Time': 2152, 'Memory': 2206.04, 'Tool': 'marcie'}, {'Time': 2398, 'Memory': 2206.57, 'Tool': 'marcie'}, {'Time': 3605, 'Memory': 292.97, 'Tool': 'itstools'}, {'Time': 3748, 'Memory': 296.04, 'Tool': 'itstools'}, {'Time': 18137, 'Memory': 522.41, 'Tool': 'gspn'}, {'Time': 19986, 'Memory': 550.27, 'Tool': 'gspn'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola ResAllocation-PT-R003C015...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
ResAllocation-PT-R003C015: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ ResAllocation-PT-R003C015 @ 3538 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 150/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 90 places, 60 transitions, 45 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 105 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C015-ReachabilityFireability.task
lola: E (F ((FIREABLE(t_8_3) AND FIREABLE(t_11_0) AND NOT FIREABLE(t_13_1) AND FIREABLE(t_14_0) AND (NOT FIREABLE(t_12_1) OR NOT FIREABLE(t_3_0)) AND NOT FIREABLE(t_0_0)))) : A (G (())) : E (F ((FIREABLE(t_2_2) AND FIREABLE(t_14_2) AND NOT FIREABLE(t_0_0)))) : A (G (())) : A (G ((NOT FIREABLE(t_3_3) OR NOT FIREABLE(t_13_0) OR (NOT FIREABLE(t_9_1) AND NOT FIREABLE(t_7_1)) OR (FIREABLE(t_3_3) AND FIREABLE(t_1_1)) OR (FIREABLE(t_3_1) AND FIREABLE(t_13_3) AND (FIREABLE(t_6_1) OR FIREABLE(t_8_0)))))) : A (G ((NOT FIREABLE(t_6_3) OR NOT FIREABLE(t_10_2)))) : E (F ((FIREABLE(t_5_2) AND FIREABLE(t_6_3) AND NOT FIREABLE(t_12_3)))) : E (F ((FIREABLE(t_14_0) AND NOT FIREABLE(t_1_3) AND FIREABLE(t_7_0) AND (FIREABLE(t_2_1) OR FIREABLE(t_2_2) OR FIREABLE(t_5_2))))) : E (F ((FIREABLE(t_11_2) AND (NOT FIREABLE(t_1_3) OR NOT FIREABLE(t_7_1)) AND FIREABLE(t_13_0)))) : A (G (())) : A (G ((NOT FIREABLE(t_4_1) OR NOT FIREABLE(t_9_2) OR (NOT FIREABLE(t_10_3) AND NOT FIREABLE(t_13_3)) OR (FIREABLE(t_2_0) AND FIREABLE(t_2_3)) OR NOT FIREABLE(t_2_1) OR NOT FIREABLE(t_7_0)))) : A (G ((NOT FIREABLE(t_5_0) OR NOT FIREABLE(t_6_3)))) : E (F (((NOT FIREABLE(t_3_3) OR NOT FIREABLE(t_1_3)) AND FIREABLE(t_7_2) AND FIREABLE(t_2_3)))) : E (F ((FIREABLE(t_9_0) AND FIREABLE(t_2_2) AND NOT FIREABLE(t_9_1)))) : A (G ((NOT FIREABLE(t_2_0) OR (FIREABLE(t_2_1) AND FIREABLE(t_3_3) AND NOT FIREABLE(t_13_1)) OR NOT FIREABLE(t_0_0) OR NOT FIREABLE(t_9_0) OR (NOT FIREABLE(t_10_0) AND NOT FIREABLE(t_8_2))))) : E (F ((NOT FIREABLE(t_8_3) AND NOT FIREABLE(t_0_1) AND FIREABLE(t_12_0) AND FIREABLE(t_6_1) AND (FIREABLE(t_1_2) OR FIREABLE(t_7_2)) AND FIREABLE(t_9_0))))
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(t_8_3) AND FIREABLE(t_11_0) AND NOT FIREABLE(t_13_1) AND FIREABLE(t_14_0) AND (NOT FIREABLE(t_12_1) OR NOT FIREABLE(t_3_0)) AND NOT FIREABLE(t_0_0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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 56 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability.sara
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_2_2) AND FIREABLE(t_14_2) AND NOT FIREABLE(t_0_0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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 7 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t_3_3) OR NOT FIREABLE(t_13_0) OR (NOT FIREABLE(t_9_1) AND NOT FIREABLE(t_7_1)) OR (FIREABLE(t_3_3) AND FIREABLE(t_1_1)) OR (FIREABLE(t_3_1) AND FIREABLE(t_13_3) AND (FIREABLE(t_6_1) OR FIREABLE(t_8_0))))))
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 8 bytes per marking, with 19 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
sara: try reading problem file ResAllocation-PT-R003C015-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: state equation: Generated DNF with 402 literals and 48 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-4.sara
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t_6_3) OR NOT FIREABLE(t_10_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 8 bytes per marking, with 19 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 4 literals and 1 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
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(t_5_2) AND FIREABLE(t_6_3) AND NOT FIREABLE(t_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 8 bytes per marking, with 19 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 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C015-ReachabilityFireability-6.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_14_0) AND NOT FIREABLE(t_1_3) AND FIREABLE(t_7_0) AND (FIREABLE(t_2_1) OR FIREABLE(t_2_2) OR FIREABLE(t_5_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 8 bytes per marking, with 19 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 35 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_11_2) AND (NOT FIREABLE(t_1_3) OR NOT FIREABLE(t_7_1)) AND FIREABLE(t_13_0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 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 25 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-8.sara
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 90 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C015-ReachabilityFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t_4_1) OR NOT FIREABLE(t_9_2) OR (NOT FIREABLE(t_10_3) AND NOT FIREABLE(t_13_3)) OR (FIREABLE(t_2_0) AND FIREABLE(t_2_3)) OR NOT FIREABLE(t_2_1) OR NOT FIREABLE(t_7_0))))
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 8 bytes per marking, with 19 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 75 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-10.sara
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t_5_0) OR NOT FIREABLE(t_6_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 8 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C015-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 911769 markings, 1846575 edges, 182354 markings/sec, 0 secs
lola: sara is running 5 secs || 1646741 markings, 4101132 edges, 146994 markings/sec, 5 secs
lola: sara is running 10 secs || 2563192 markings, 6271062 edges, 183290 markings/sec, 10 secs
lola: sara is running 15 secs || 3369777 markings, 8439419 edges, 161317 markings/sec, 15 secs
lola: sara is running 20 secs || 4240584 markings, 10778613 edges, 174161 markings/sec, 20 secs
lola: sara is running 25 secs || 5029032 markings, 13122636 edges, 157690 markings/sec, 25 secs
lola: sara is running 30 secs || 5622872 markings, 15972798 edges, 118768 markings/sec, 30 secs
sara: warning, failure of lp_solve (at job 1889)
lola: sara is running 35 secs || 6160824 markings, 18823588 edges, 107590 markings/sec, 35 secs
lola: sara is running 40 secs || 6704704 markings, 21695611 edges, 108776 markings/sec, 40 secs
lola: sara is running 45 secs || 7208884 markings, 24396632 edges, 100836 markings/sec, 45 secs
lola: sara is running 50 secs || 7679105 markings, 27090553 edges, 94044 markings/sec, 50 secs
lola: sara is running 55 secs || 8134223 markings, 29770466 edges, 91024 markings/sec, 55 secs
lola: sara is running 60 secs || 8522918 markings, 32274763 edges, 77739 markings/sec, 60 secs
lola: sara is running 65 secs || 8923883 markings, 34754416 edges, 80193 markings/sec, 65 secs
lola: sara is running 70 secs || 9331538 markings, 36604371 edges, 81531 markings/sec, 70 secs
lola: sara is running 75 secs || 9521534 markings, 38543801 edges, 37999 markings/sec, 75 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 9523311 markings, 39154126 edges
lola: ========================================
lola: subprocess 12 will run for 864 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t_3_3) OR NOT FIREABLE(t_1_3)) AND FIREABLE(t_7_2) AND FIREABLE(t_2_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 8 bytes per marking, with 19 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 4 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C015-ReachabilityFireability-12.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1152 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t_9_0) AND FIREABLE(t_2_2) AND NOT FIREABLE(t_9_1))))
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 8 bytes per marking, with 19 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 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-13.sara
lola: ========================================
lola: subprocess 14 will run for 1728 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t_2_0) OR (FIREABLE(t_2_1) AND FIREABLE(t_3_3) AND NOT FIREABLE(t_13_1)) OR NOT FIREABLE(t_0_0) OR NOT FIREABLE(t_9_0) OR (NOT FIREABLE(t_10_0) AND NOT FIREABLE(t_8_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 8 bytes per marking, with 19 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 94 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to ResAllocation-PT-R003C015-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file ResAllocation-PT-R003C015-ReachabilityFireability-14.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 181)
lola: sara is running 0 secs || 748066 markings, 2184528 edges, 149613 markings/sec, 0 secs
lola: sara is running 5 secs || 1456227 markings, 4651750 edges, 141632 markings/sec, 5 secs
lola: sara is running 10 secs || 2108641 markings, 7313895 edges, 130483 markings/sec, 10 secs
sara: warning: empty constraint in comparison
lola: sara is running 15 secs || 2866793 markings, 9781794 edges, 151630 markings/sec, 15 secs
lola: sara is running 20 secs || 3547371 markings, 12247705 edges, 136116 markings/sec, 20 secs
lola: sara is running 25 secs || 4168848 markings, 14494790 edges, 124295 markings/sec, 25 secs
lola: sara is running 30 secs || 4724067 markings, 16876526 edges, 111044 markings/sec, 30 secs
lola: sara is running 35 secs || 5256060 markings, 19496124 edges, 106399 markings/sec, 35 secs
lola: sara is running 40 secs || 5771405 markings, 22233446 edges, 103069 markings/sec, 40 secs
lola: sara is running 45 secs || 6313561 markings, 24998347 edges, 108431 markings/sec, 45 secs
lola: sara is running 50 secs || 6976038 markings, 27946696 edges, 132495 markings/sec, 50 secs
lola: sara is running 55 secs || 7508440 markings, 30491524 edges, 106480 markings/sec, 55 secs
lola: sara is running 60 secs || 8143329 markings, 33655552 edges, 126978 markings/sec, 60 secs
lola: sara is running 65 secs || 8734483 markings, 36664894 edges, 118231 markings/sec, 65 secs
lola: sara is running 70 secs || 9266275 markings, 39650049 edges, 106358 markings/sec, 70 secs
lola: sara is running 75 secs || 9794549 markings, 42588588 edges, 105655 markings/sec, 75 secs
lola: sara is running 80 secs || 10353354 markings, 45003149 edges, 111761 markings/sec, 80 secs
lola: sara is running 85 secs || 10578524 markings, 47236863 edges, 45034 markings/sec, 85 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 10588839 markings, 47670672 edges
lola: subprocess 15 will run for 3365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t_8_3) AND NOT FIREABLE(t_0_1) AND FIREABLE(t_12_0) AND FIREABLE(t_6_1) AND (FIREABLE(t_1_2) OR FIREABLE(t_7_2)) AND FIREABLE(t_9_0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 19 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes no no no yes yes yes no yes yes yes yes yes
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C015-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R003C015"
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/ResAllocation-PT-R003C015.tgz
mv ResAllocation-PT-R003C015 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 ResAllocation-PT-R003C015, 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 r142-qhx2-152673584000357"
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 ;