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 332K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.8K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.9K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 156K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is Raft-PT-08, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-qhx2-152673581300154
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527791062675


BK_STOP 1527791117458

--------------------
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 Raft-PT-08 as instance name.
Using Raft 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': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': True, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 177, 'Memory': 111.71, 'Tool': 'lola'}, {'Time': 352, 'Memory': 110.97, 'Tool': 'lola'}, {'Time': 3705, 'Memory': 347.34, 'Tool': 'itstools'}, {'Time': 3958, 'Memory': 347.54, 'Tool': 'itstools'}, {'Time': 136885, 'Memory': 3212.73, 'Tool': 'marcie'}, {'Time': 146283, 'Memory': 3212.98, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola Raft-PT-08...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
Raft-PT-08: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ Raft-PT-08 @ 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: 896/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 328 places, 568 transitions, 264 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 559 transition conflict sets
lola: TASK
lola: reading formula from Raft-PT-08-ReachabilityFireability.task
lola: A (G ((FIREABLE(t273) OR FIREABLE(t110) OR FIREABLE(t485) OR FIREABLE(t180) OR FIREABLE(t440) OR NOT FIREABLE(t405) OR (FIREABLE(t190) AND (FIREABLE(t447) OR FIREABLE(t151) OR (FIREABLE(t208) AND FIREABLE(t411))))))) : A (G ((NOT FIREABLE(t105) OR NOT FIREABLE(t37) OR (FIREABLE(t454) AND FIREABLE(t167) AND (FIREABLE(t42) OR FIREABLE(t299))) OR NOT FIREABLE(t437) OR NOT FIREABLE(t128) OR (FIREABLE(t426) AND FIREABLE(t213) AND FIREABLE(t284))))) : E (F ((FIREABLE(t242) AND (NOT FIREABLE(t455) OR NOT FIREABLE(t230)) AND FIREABLE(t3)))) : A (G ((NOT FIREABLE(t60) OR NOT FIREABLE(t430) OR (NOT FIREABLE(t196) AND NOT FIREABLE(t81)) OR (FIREABLE(t203) AND FIREABLE(t303) AND (FIREABLE(t360) OR FIREABLE(t27)) AND (FIREABLE(t233) OR FIREABLE(t499) OR (FIREABLE(t543) AND FIREABLE(t476))))))) : A (G ((FIREABLE(t534) OR FIREABLE(t389) OR (FIREABLE(t68) AND FIREABLE(t188)) OR (NOT FIREABLE(t379) AND NOT FIREABLE(t552)) OR FIREABLE(t528)))) : E (F ((FIREABLE(t130) AND (FIREABLE(t235) OR FIREABLE(t546)) AND FIREABLE(t337) AND FIREABLE(t108) AND FIREABLE(t470) AND FIREABLE(t156) AND (((FIREABLE(t59) OR FIREABLE(t263)) AND NOT FIREABLE(t4)) OR FIREABLE(t262))))) : E (F ((FIREABLE(t246) AND (NOT FIREABLE(t273) OR NOT FIREABLE(t418) OR ((FIREABLE(t490) OR FIREABLE(t333)) AND (FIREABLE(t489) OR FIREABLE(t221))))))) : E (F ((FIREABLE(t386) AND NOT FIREABLE(t25) AND FIREABLE(t378) AND FIREABLE(t93) AND (FIREABLE(t230) OR FIREABLE(t354)) AND (NOT FIREABLE(t468) OR NOT FIREABLE(t115) OR (NOT FIREABLE(t425) AND NOT FIREABLE(t267)))))) : E (F ((NOT FIREABLE(t115) AND NOT FIREABLE(t530) AND FIREABLE(t329) AND (NOT FIREABLE(t513) OR FIREABLE(t533))))) : E (F ((NOT FIREABLE(t529) AND (NOT FIREABLE(t499) OR NOT FIREABLE(t436)) AND FIREABLE(t444) AND (FIREABLE(t396) OR FIREABLE(t442)) AND FIREABLE(t353)))) : E (F ((FIREABLE(t536) AND FIREABLE(t197) AND FIREABLE(t334) AND FIREABLE(t229) AND NOT FIREABLE(t432) AND NOT FIREABLE(t222) AND (NOT FIREABLE(t502) OR NOT FIREABLE(t476))))) : E (F ((FIREABLE(t33) AND NOT FIREABLE(t17)))) : A (G ((NOT FIREABLE(t317) OR NOT FIREABLE(t168) OR (NOT FIREABLE(t211) AND NOT FIREABLE(t156)) OR FIREABLE(t535)))) : E (F ((FIREABLE(t499) AND NOT FIREABLE(t531)))) : E (F ((FIREABLE(t312) AND (FIREABLE(t322) OR FIREABLE(t172)) AND FIREABLE(t49) AND (FIREABLE(t36) OR (FIREABLE(t146) AND FIREABLE(t427)) OR (NOT FIREABLE(t393) AND (FIREABLE(t201) OR FIREABLE(t498))))))) : A (G ((NOT FIREABLE(t376) OR (FIREABLE(t359) AND NOT FIREABLE(t445)))))
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 ((FIREABLE(t273) OR FIREABLE(t110) OR FIREABLE(t485) OR FIREABLE(t180) OR FIREABLE(t440) OR NOT FIREABLE(t405) OR (FIREABLE(t190) AND (FIREABLE(t447) OR FIREABLE(t151) OR (FIREABLE(t208) AND FIREABLE(t411)))))))
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 36 bytes per marking, with 24 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 608 literals and 64 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 120 markings, 431 edges
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t105) OR NOT FIREABLE(t37) OR (FIREABLE(t454) AND FIREABLE(t167) AND (FIREABLE(t42) OR FIREABLE(t299))) OR NOT FIREABLE(t437) OR NOT FIREABLE(t128) OR (FIREABLE(t426) AND FIREABLE(t213) AND FIREABLE(t284)))))
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 36 bytes per marking, with 24 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: calling and running sara
lola: ========================================
lola: state equation: Generated DNF with 210 literals and 25 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 11 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t242) AND (NOT FIREABLE(t455) OR NOT FIREABLE(t230)) AND FIREABLE(t3))))
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 36 bytes per marking, with 24 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 Raft-PT-08-ReachabilityFireability.sara.
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
sara: 64: error near '': syntax error, unexpected $end, expecting FINALM
sara: error while parsing the sara problem file -- aborting [#05]
sara: see manual for a documentation of this error
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t60) OR NOT FIREABLE(t430) OR (NOT FIREABLE(t196) AND NOT FIREABLE(t81)) OR (FIREABLE(t203) AND FIREABLE(t303) AND (FIREABLE(t360) OR FIREABLE(t27)) AND (FIREABLE(t233) OR FIREABLE(t499) OR (FIREABLE(t543) AND FIREABLE(t476)))))))
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 36 bytes per marking, with 24 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 361 literals and 42 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-08-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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t534) OR FIREABLE(t389) OR (FIREABLE(t68) AND FIREABLE(t188)) OR (NOT FIREABLE(t379) AND NOT FIREABLE(t552)) OR FIREABLE(t528))))
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 36 bytes per marking, with 24 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: state equation: Generated DNF with 144 literals and 24 conjunctive subformulas
lola: The predicate is not invariant.
lola: 10 markings, 33 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t130) AND (FIREABLE(t235) OR FIREABLE(t546)) AND FIREABLE(t337) AND FIREABLE(t108) AND FIREABLE(t470) AND FIREABLE(t156) AND (((FIREABLE(t59) OR FIREABLE(t263)) AND NOT FIREABLE(t4)) OR FIREABLE(t262)))))
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 36 bytes per marking, with 24 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 6 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 Raft-PT-08-ReachabilityFireability-5.sara
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t246) AND (NOT FIREABLE(t273) OR NOT FIREABLE(t418) OR ((FIREABLE(t490) OR FIREABLE(t333)) AND (FIREABLE(t489) OR FIREABLE(t221)))))))
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 36 bytes per marking, with 24 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 33 literals and 7 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 8 edges
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-6.sara
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t386) AND NOT FIREABLE(t25) AND FIREABLE(t378) AND FIREABLE(t93) AND (FIREABLE(t230) OR FIREABLE(t354)) AND (NOT FIREABLE(t468) OR NOT FIREABLE(t115) OR (NOT FIREABLE(t425) AND NOT FIREABLE(t267))))))
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 36 bytes per marking, with 24 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 10 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-7.sara
lola: 9 markings, 24 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t115) AND NOT FIREABLE(t530) AND FIREABLE(t329) AND (NOT FIREABLE(t513) OR FIREABLE(t533)))))
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 36 bytes per marking, with 24 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 Raft-PT-08-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-08-ReachabilityFireability-8.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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t529) AND (NOT FIREABLE(t499) OR NOT FIREABLE(t436)) AND FIREABLE(t444) AND (FIREABLE(t396) OR FIREABLE(t442)) AND FIREABLE(t353))))
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 36 bytes per marking, with 24 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 96 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 39 edges
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-9.sara
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t536) AND FIREABLE(t197) AND FIREABLE(t334) AND FIREABLE(t229) AND NOT FIREABLE(t432) AND NOT FIREABLE(t222) AND (NOT FIREABLE(t502) OR NOT FIREABLE(t476)))))
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 36 bytes per marking, with 24 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 88 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 10 edges
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-10.sara
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t33) AND NOT FIREABLE(t17))))
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 36 bytes per marking, with 24 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-11.sara
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t317) OR NOT FIREABLE(t168) OR (NOT FIREABLE(t211) AND NOT FIREABLE(t156)) OR FIREABLE(t535))))
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 36 bytes per marking, with 24 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 4 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 33 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t499) AND NOT FIREABLE(t531))))
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 36 bytes per marking, with 24 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)
sara: lola: try reading problem file Raft-PT-08-ReachabilityFireability-12.sara.
RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 13 edges
lola: ========================================
lola: subprocess 14 will run for 1768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t312) AND (FIREABLE(t322) OR FIREABLE(t172)) AND FIREABLE(t49) AND (FIREABLE(t36) OR (FIREABLE(t146) AND FIREABLE(t427)) OR (NOT FIREABLE(t393) AND (FIREABLE(t201) OR FIREABLE(t498)))))))
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 36 bytes per marking, with 24 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 Raft-PT-08-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Raft-PT-08-ReachabilityFireability-14.sara.
sara: place or transition ordering is non-deterministic

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: ========================================
lola: subprocess 15 will run for 3536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t376) OR (FIREABLE(t359) AND NOT FIREABLE(t445)))))
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 36 bytes per marking, with 24 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 28 edges
lola: state equation: write sara problem file to Raft-PT-08-ReachabilityFireability-15.sara
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no no yes yes yes yes yes yes yes no yes no no
FORMULA Raft-PT-08-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-08-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-08-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-08-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-08-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-08-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-08-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-08-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-08-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-08-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-08-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-08-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-08-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-08-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-08-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Raft-PT-08-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

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