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 312K
-rw-r--r-- 1 mcc users 4.3K 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 4.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.2K 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 2.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 127K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is IBMB2S565S3960-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-152658633000196
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526722458980


BK_STOP 1526722504788

--------------------
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 IBMB2S565S3960-PT-none as instance name.
Using IBMB2S565S3960 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': True, 'Extended Free Choice': True, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 115, 'Memory': 112.73, 'Tool': 'lola'}, {'Time': 266, 'Memory': 111.65, 'Tool': 'lola'}, {'Time': 144660, 'Memory': 3646.48, 'Tool': 'itstools'}, {'Time': 149760, 'Memory': 3395.13, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola IBMB2S565S3960-PT-none...

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


checking for too many tokens
===========================================================================================
IBMB2S565S3960-PT-none: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ IBMB2S565S3960-PT-none @ 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: 452/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 273 places, 179 transitions, 172 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 171 transition conflict sets
lola: TASK
lola: reading formula from IBMB2S565S3960-PT-none-ReachabilityFireability.task
lola: A (G (NOT FIREABLE(callToTask.s00003981.inputCriterion.s00001053))) : E (F ((FIREABLE(decision.s00003021.activate.s00001072) AND (FIREABLE(decision.s00002055.activate.s00001072) OR FIREABLE(decision.s00001126.activate.s00001072)) AND ((FIREABLE(merge.s00001061.activate.s00001067) AND FIREABLE(merge.s00001162.activate.s00001260)) OR FIREABLE(callToTask.s00003971.outputCriterion.s00001055)) AND (NOT FIREABLE(fork.s00001298.fire.s00001073) OR NOT FIREABLE(callToTask.s00003908.outputCriterion.s00001055) OR NOT FIREABLE(callToProcess.s00003859.inputCriterion.s00001053))))) : E (F ((FIREABLE(callToTask.s00003974.outputCriterion.s00001055) AND FIREABLE(decision.s00002760.fire.s00001081) AND (FIREABLE(join.s00002243.fire.s00001069) OR NOT FIREABLE(decision.s00001840.fire.s00001075))))) : A (G ((NOT FIREABLE(callToTask.s00001360.outputCriterion.s00001055) OR ((NOT FIREABLE(merge.s00002239.activate.s00001062) OR NOT FIREABLE(callToProcess.s00003872.outputCriterion.s00001055)) AND NOT FIREABLE(callToTask.s00003913.inputCriterion.s00001053))))) : E (F (((FIREABLE(decision.s00003021.activate.s00001072) OR FIREABLE(callToTask.s00003969.inputCriterion.s00001053)) AND (NOT FIREABLE(fork.s00002500.fire.s00001073) OR NOT FIREABLE(callToProcess.s00003884.outputCriterion.s00001055) OR NOT FIREABLE(callToTask.s00003972.outputCriterion.s00001055))))) : E (F ((FIREABLE(merge.s00001162.activate.s00001067) AND FIREABLE(fork.s00002500.activate.s00001072) AND (NOT FIREABLE(callToTask.s00003981.inputCriterion.s00001053) OR NOT FIREABLE(merge.s00001160.activate.s00001064) OR NOT FIREABLE(join.s00001163.activate.s00001064) OR NOT FIREABLE(fork.s00001298.fire.s00001075))))) : E (F ((FIREABLE(join.s00001163.activate.s00001062) AND (NOT FIREABLE(fork.s00002501.activate.s00001072) OR NOT FIREABLE(callToTask.s00003981.inputCriterion.s00001053) OR NOT FIREABLE(callToTask.s00003975.outputCriterion.s00001055))))) : A (G (NOT FIREABLE(decision.s00002056.activate.s00001072))) : E (F (((FIREABLE(callToTask.s00003973.outputCriterion.s00001055) AND FIREABLE(merge.s00002238.activate.s00001064) AND (FIREABLE(decision.s00003020.activate.s00001072) OR FIREABLE(fork.s00002501.fire.s00001075)) AND NOT FIREABLE(fork.s00001071.fire.s00001073)) OR (NOT FIREABLE(decision.s00001158.activate.s00001072) AND FIREABLE(decision.s00001123.activate.s00001072) AND NOT FIREABLE(callToProcess.s00003880.inputCriterion.s00001053) AND NOT FIREABLE(callToProcess.s00003904.inputCriterion.s00001053))))) : A (G ((NOT FIREABLE(callToTask.s00003965.outputCriterion.s00001055) OR NOT FIREABLE(callToTask.s00003978.outputCriterion.s00001055) OR (NOT FIREABLE(merge.s00001162.activate.s00001064) AND NOT FIREABLE(callToProcess.s00003859.outputCriterion.s00001055)) OR NOT FIREABLE(decision.s00002056.fire.s00001075)))) : A (G ((NOT FIREABLE(fork.s00002500.activate.s00001072) AND (NOT FIREABLE(fork.s00001298.fire.s00001075) OR NOT FIREABLE(merge.s00001160.fire.s00001069) OR NOT FIREABLE(callToTask.s00003974.inputCriterion.s00001053) OR NOT FIREABLE(decision.s00002761.activate.s00001072))))) : E (F (FIREABLE(callToTask.s00003961.inputCriterion.s00001053))) : A (G (NOT FIREABLE(callToTask.s00003966.inputCriterion.s00001053))) : A (G ((FIREABLE(merge.s00001160.activate.s00001062) OR FIREABLE(decision.s00001841.fire.s00001075) OR (FIREABLE(decision.s00002760.fire.s00001078) AND FIREABLE(decision.s00003021.fire.s00001075)) OR NOT FIREABLE(join.s00002243.activate.s00001065) OR FIREABLE(merge.s00002240.activate.s00001062)))) : A (G ((FIREABLE(callToTask.s00003980.outputCriterion.s00001055) OR FIREABLE(callToTask.s00003961.outputCriterion.s00001055) OR NOT FIREABLE(decision.s00001123.activate.s00001072)))) : E (F ((FIREABLE(decision.s00002948.fire.s00001073) AND (NOT FIREABLE(callToTask.s00003962.inputCriterion.s00001053) OR NOT FIREABLE(decision.s00002760.fire.s00001075)) AND (NOT FIREABLE(callToProcess.s00001108.outputCriterion.s00001055) OR NOT FIREABLE(callToTask.s00003971.outputCriterion.s00001055) OR (NOT FIREABLE(fork.s00001403.activate.s00001072) AND NOT FIREABLE(decision.s00001841.fire.s00001075))))))
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(callToTask.s00003981.inputCriterion.s00001053)))
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 688 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 139 markings, 138 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(decision.s00003021.activate.s00001072) AND (FIREABLE(decision.s00002055.activate.s00001072) OR FIREABLE(decision.s00001126.activate.s00001072)) AND ((FIREABLE(merge.s00001061.activate.s00001067) AND FIREABLE(merge.s00001162.activate.s00001260)) OR FIREABLE(callToTask.s00003971.outputCriterion.s00001055)) AND (NOT FIREABLE(fork.s00001298.fire.s00001073) OR NOT FIREABLE(callToTask... (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 688 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 150 literals and 20 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 101 markings, 100 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(callToTask.s00003974.outputCriterion.s00001055) AND FIREABLE(decision.s00002760.fire.s00001081) AND (FIREABLE(join.s00002243.fire.s00001069) OR NOT FIREABLE(decision.s00001840.fire.s00001075)))))
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 688 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1192 markings, 1222 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(callToTask.s00001360.outputCriterion.s00001055) OR ((NOT FIREABLE(merge.s00002239.activate.s00001062) OR NOT FIREABLE(callToProcess.s00003872.outputCriterion.s00001055)) AND NOT FIREABLE(callToTask.s00003913.inputCriterion.s00001053)))))
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 688 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 2 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 178 markings, 177 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(decision.s00003021.activate.s00001072) OR FIREABLE(callToTask.s00003969.inputCriterion.s00001053)) AND (NOT FIREABLE(fork.s00002500.fire.s00001073) OR NOT FIREABLE(callToProcess.s00003884.outputCriterion.s00001055) OR NOT FIREABLE(callToTask.s00003972.outputCriterion.s00001055)))))
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 688 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 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-ReachabilityFireability-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 36 markings, 35 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(merge.s00001162.activate.s00001067) AND FIREABLE(fork.s00002500.activate.s00001072) AND (NOT FIREABLE(callToTask.s00003981.inputCriterion.s00001053) OR NOT FIREABLE(merge.s00001160.activate.s00001064) OR NOT FIREABLE(join.s00001163.activate.s00001064) OR NOT FIREABLE(fork.s00001298.fire.s00001075)))))
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 688 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 28 literals and 7 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-ReachabilityFireability-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 62 markings, 61 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
sara: try reading problem file IBMB2S565S3960-PT-none-ReachabilityFireability-4.sara.
lola: ...considering subproblem: E (F ((FIREABLE(join.s00001163.activate.s00001062) AND (NOT FIREABLE(fork.s00002501.activate.s00001072) OR NOT FIREABLE(callToTask.s00003981.inputCriterion.s00001053) OR NOT FIREABLE(callToTask.s00003975.outputCriterion.s00001055)))))
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 688 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 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-ReachabilityFireability-6.sara
sara: try reading problem file IBMB2S565S3960-PT-none-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 138 markings, 137 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(decision.s00002056.activate.s00001072)))
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 688 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 IBMB2S565S3960-PT-none-ReachabilityFireability-7.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 60 markings, 59 edges
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file IBMB2S565S3960-PT-none-ReachabilityFireability-7.sara.
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(callToTask.s00003973.outputCriterion.s00001055) AND FIREABLE(merge.s00002238.activate.s00001064) AND (FIREABLE(decision.s00003020.activate.s00001072) OR FIREABLE(fork.s00002501.fire.s00001075)) AND NOT FIREABLE(fork.s00001071.fire.s00001073)) OR (NOT FIREABLE(decision.s00001158.activate.s00001072) AND FIREABLE(decision.s00001123.activate.s00001072) AND NOT FIREABLE(callToProcess... (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 688 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 57 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to IBMB2S565S3960-PT-none-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 48 markings, 47 edges
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(callToTask.s00003965.outputCriterion.s00001055) OR NOT FIREABLE(callToTask.s00003978.outputCriterion.s00001055) OR (NOT FIREABLE(merge.s00001162.activate.s00001064) AND NOT FIREABLE(callToProcess.s00003859.outputCriterion.s00001055)) OR NOT FIREABLE(decision.s00002056.fire.s00001075))))
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 688 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 226 markings, 225 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(fork.s00002500.activate.s00001072) AND (NOT FIREABLE(fork.s00001298.fire.s00001075) OR NOT FIREABLE(merge.s00001160.fire.s00001069) OR NOT FIREABLE(callToTask.s00003974.inputCriterion.s00001053) OR NOT FIREABLE(decision.s00002761.activate.s00001072)))))
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 688 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 IBMB2S565S3960-PT-none-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file IBMB2S565S3960-PT-none-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 345 markings, 366 edges
lola: ========================================
sara: lola: place or transition ordering is non-deterministic
subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(callToTask.s00003961.inputCriterion.s00001053)))
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 688 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 130 markings, 129 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(callToTask.s00003966.inputCriterion.s00001053)))
lola: ========================================
lola: SUBTASK
sara: lola: place or transition ordering is non-deterministic
checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 688 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(merge.s00001160.activate.s00001062) OR FIREABLE(decision.s00001841.fire.s00001075) OR (FIREABLE(decision.s00002760.fire.s00001078) AND FIREABLE(decision.s00003021.fire.s00001075)) OR NOT FIREABLE(join.s00002243.activate.s00001065) OR FIREABLE(merge.s00002240.activate.s00001062))))
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 688 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(callToTask.s00003980.outputCriterion.s00001055) OR FIREABLE(callToTask.s00003961.outputCriterion.s00001055) OR NOT FIREABLE(decision.s00001123.activate.s00001072))))
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 688 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 54 markings, 53 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(decision.s00002948.fire.s00001073) AND (NOT FIREABLE(callToTask.s00003962.inputCriterion.s00001053) OR NOT FIREABLE(decision.s00002760.fire.s00001075)) AND (NOT FIREABLE(callToProcess.s00001108.outputCriterion.s00001055) OR NOT FIREABLE(callToTask.s00003971.outputCriterion.s00001055) OR (NOT FIREABLE(fork.s00001403.activate.s00001072) AND NOT FIREABLE(decision.s00001841.fire.s00... (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 688 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 43 markings, 42 edges
lola: RESULT
lola:
SUMMARY: no yes yes no yes yes yes no yes no no yes no no no yes
lola: ========================================



FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IBMB2S565S3960-PT-none-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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="IBMB2S565S3960-PT-none"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="irma4mcc-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/IBMB2S565S3960-PT-none.tgz
mv IBMB2S565S3960-PT-none 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-full"
echo " Input is IBMB2S565S3960-PT-none, 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 r102-smll-152658633000196"
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 ;