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 200K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 122 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 360 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 19K 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.9K 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 19 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 37K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is DNAwalker-PT-03track12BlockBoth, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r067-smll-152649739800245
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526662541438


BK_STOP 1526662587613

--------------------
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 DNAwalker-PT-03track12BlockBoth as instance name.
Using DNAwalker 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': None, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 243, 'Memory': 111.3, 'Tool': 'lola'}, {'Time': 269, 'Memory': 103.35, 'Tool': 'gspn'}, {'Time': 312, 'Memory': 113.23, 'Tool': 'lola'}, {'Time': 1738, 'Memory': 130.45, 'Tool': 'gspn'}, {'Time': 2457, 'Memory': 261.06, 'Tool': 'itstools'}, {'Time': 2465, 'Memory': 262.95, 'Tool': 'itstools'}, {'Time': 6070, 'Memory': 7483, 'Tool': 'marcie'}, {'Time': 6105, 'Memory': 7483.23, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 10.11111111111111x far from the best tool lola.
ReachabilityFireability lola DNAwalker-PT-03track12BlockBoth...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
DNAwalker-PT-03track12BlockBoth: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ DNAwalker-PT-03track12BlockBoth @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 98/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 14 places, 84 transitions, 14 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 57 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-03track12BlockBoth-ReachabilityFireability.task
lola: E (F (((NOT FIREABLE(t9_12) OR NOT FIREABLE(t1_5)) AND FIREABLE(t5_2) AND FIREABLE(t3_10)))) : E (F (((NOT FIREABLE(t7_8) OR FIREABLE(t3_10)) AND FIREABLE(tAb9) AND FIREABLE(t7_8)))) : E (F (((FIREABLE(t6_2) OR FIREABLE(t4_9)) AND FIREABLE(t4_10) AND NOT FIREABLE(t11_12) AND FIREABLE(t11_10) AND (FIREABLE(t2_9) OR FIREABLE(t9_4))))) : E (F ((FIREABLE(tAb5) AND NOT FIREABLE(t3_9) AND FIREABLE(t3_6) AND FIREABLE(t9_4)))) : A (G ((FIREABLE(t4_2) OR FIREABLE(t2_1) OR (FIREABLE(t3_7) AND FIREABLE(t2_1)) OR NOT FIREABLE(t5_4) OR NOT FIREABLE(t1_3) OR FIREABLE(t5_7)))) : E (F ((FIREABLE(t7_4) AND NOT FIREABLE(t11_9) AND FIREABLE(t4_5)))) : A (G ((NOT FIREABLE(t9_7) OR NOT FIREABLE(t4_3) OR NOT FIREABLE(t7_8) OR NOT FIREABLE(t7_5)))) : E (F (FIREABLE(t2_1))) : A (G ((((FIREABLE(t9_1) OR FIREABLE(t4_6)) AND NOT FIREABLE(tloop8)) OR NOT FIREABLE(t9_10) OR FIREABLE(tAb5) OR FIREABLE(t11_10) OR FIREABLE(t3_6) OR FIREABLE(t6_3) OR NOT FIREABLE(tloop8)))) : E (F ((((FIREABLE(t6_8) AND FIREABLE(t9_3)) OR FIREABLE(t4_10)) AND (FIREABLE(t5_11) OR FIREABLE(t5_9) OR NOT FIREABLE(t1_9)) AND FIREABLE(t5_7)))) : A (G ((NOT FIREABLE(t6_2) OR NOT FIREABLE(t10_12)))) : A (G ((NOT FIREABLE(t9_2) OR NOT FIREABLE(t2_1) OR FIREABLE(t11_9) OR (((FIREABLE(t7_5) AND FIREABLE(t7_8)) OR (FIREABLE(t7_4) AND FIREABLE(tAb5))) AND FIREABLE(t4_6))))) : A (G ((NOT FIREABLE(t5_10) OR (NOT FIREABLE(t4_9) AND NOT FIREABLE(t6_5)) OR FIREABLE(t5_1) OR (FIREABLE(t9_4) AND FIREABLE(tAb5) AND FIREABLE(t1_4))))) : E (F ((FIREABLE(t9_1) AND FIREABLE(t2_1) AND (FIREABLE(t6_2) OR FIREABLE(t3_9) OR NOT FIREABLE(t1_4)) AND (NOT FIREABLE(t11_12) OR FIREABLE(t11_9))))) : A (G (((NOT FIREABLE(tAb5) AND (NOT FIREABLE(tloop8) OR NOT FIREABLE(t10_3))) OR FIREABLE(tAb5)))) : E (F ((NOT FIREABLE(t9_1) AND FIREABLE(t4_1) AND FIREABLE(t9_2) AND FIREABLE(t5_3))))
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 (((NOT FIREABLE(t9_12) OR NOT FIREABLE(t1_5)) AND FIREABLE(t5_2) AND FIREABLE(t3_10))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-03track12BlockBoth-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1886 markings, 3522 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t7_8) OR FIREABLE(t3_10)) AND FIREABLE(tAb9) AND FIREABLE(t7_8))))
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 56 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 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-03track12BlockBoth-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-03track12BlockBoth-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2903 markings, 4216 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t6_2) OR FIREABLE(t4_9)) AND FIREABLE(t4_10) AND NOT FIREABLE(t11_12) AND FIREABLE(t11_10) AND (FIREABLE(t2_9) OR FIREABLE(t9_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 56 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 DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-2.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2187 markings, 3840 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tAb5) AND NOT FIREABLE(t3_9) AND FIREABLE(t3_6) AND FIREABLE(t9_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 56 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1089 markings, 1359 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t4_2) OR FIREABLE(t2_1) OR (FIREABLE(t3_7) AND FIREABLE(t2_1)) OR NOT FIREABLE(t5_4) OR NOT FIREABLE(t1_3) OR FIREABLE(t5_7))))
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 56 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 62 markings, 65 edges
lola: state equation: write sara problem file to DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-4.sara
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t7_4) AND NOT FIREABLE(t11_9) AND FIREABLE(t4_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 56 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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 3126 markings, 9181 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t9_7) OR NOT FIREABLE(t4_3) OR NOT FIREABLE(t7_8) OR NOT FIREABLE(t7_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 56 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 1 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-6.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1918 markings, 3047 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t2_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 56 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2630 markings, 8255 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(t9_1) OR FIREABLE(t4_6)) AND NOT FIREABLE(tloop8)) OR NOT FIREABLE(t9_10) OR FIREABLE(tAb5) OR FIREABLE(t11_10) OR FIREABLE(t3_6) OR FIREABLE(t6_3) OR NOT FIREABLE(tloop8))))
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 56 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 176 literals and 20 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2699 markings, 5952 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t6_8) AND FIREABLE(t9_3)) OR FIREABLE(t4_10)) AND (FIREABLE(t5_11) OR FIREABLE(t5_9) OR NOT FIREABLE(t1_9)) AND FIREABLE(t5_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 56 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 52 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-9.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2784 markings, 5270 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t6_2) OR NOT FIREABLE(t10_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 56 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 3464 markings, 7811 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t9_2) OR NOT FIREABLE(t2_1) OR FIREABLE(t11_9) OR (((FIREABLE(t7_5) AND FIREABLE(t7_8)) OR (FIREABLE(t7_4) AND FIREABLE(tAb5))) AND FIREABLE(t4_6)))))
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 56 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 192 literals and 28 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2363 markings, 5157 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t5_10) OR (NOT FIREABLE(t4_9) AND NOT FIREABLE(t6_5)) OR FIREABLE(t5_1) OR (FIREABLE(t9_4) AND FIREABLE(tAb5) AND FIREABLE(t1_4)))))
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 56 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 120 literals and 20 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2709 markings, 5944 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t9_1) AND FIREABLE(t2_1) AND (FIREABLE(t6_2) OR FIREABLE(t3_9) OR NOT FIREABLE(t1_4)) AND (NOT FIREABLE(t11_12) OR FIREABLE(t11_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 56 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 82 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2630 markings, 8271 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(tAb5) AND (NOT FIREABLE(tloop8) OR NOT FIREABLE(t10_3))) OR FIREABLE(tAb5))))
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 56 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-14.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 3300 markings, 8356 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t9_1) AND FIREABLE(t4_1) AND FIREABLE(t9_2) AND FIREABLE(t5_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 56 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 7 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2279 markings, 5172 edges
lola: RESULT
lola:
SUMMARY: no no no no yes no yes no yes no yes yes yes no yes no
lola: ========================================
FORMULA DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-03track12BlockBoth-ReachabilityFireability-15 FALSE 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="DNAwalker-PT-03track12BlockBoth"
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/DNAwalker-PT-03track12BlockBoth.tgz
mv DNAwalker-PT-03track12BlockBoth 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 DNAwalker-PT-03track12BlockBoth, 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 r067-smll-152649739800245"
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 ;