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 432K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 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 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K 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.4K 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 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 266K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is Echo-PT-d02r09, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-blw3-152649946200427
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527069840009


BK_STOP 1527069993429

--------------------
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 Echo-PT-d02r09 as instance name.
Using Echo 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': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 154, 'Memory': 111.14, 'Tool': 'lola'}, {'Time': 227, 'Memory': 112.34, 'Tool': 'lola'}, {'Time': 129846, 'Memory': 3598.75, 'Tool': 'itstools'}, {'Time': 132608, 'Memory': 3595.56, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola Echo-PT-d02r09...

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


checking for too many tokens
===========================================================================================
Echo-PT-d02r09: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ Echo-PT-d02r09 @ 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: 1305/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 735 places, 570 transitions, 366 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1128 transition conflict sets
lola: TASK
lola: reading formula from Echo-PT-d02r09-ReachabilityFireability.task
lola: E (F ((FIREABLE(t421) AND FIREABLE(t519) AND NOT FIREABLE(t107) AND (FIREABLE(t371) OR FIREABLE(t102)) AND (((FIREABLE(t241) OR FIREABLE(t370)) AND (FIREABLE(t167) OR FIREABLE(t101))) OR FIREABLE(t142))))) : A (G (((NOT FIREABLE(t386) AND NOT FIREABLE(t396)) OR (NOT FIREABLE(t139) AND NOT FIREABLE(t208)) OR FIREABLE(t360) OR NOT FIREABLE(t124) OR FIREABLE(t156) OR FIREABLE(t396) OR NOT FIREABLE(t76)))) : E (F ((FIREABLE(t19) AND FIREABLE(t26) AND NOT FIREABLE(t227)))) : E (F ((NOT FIREABLE(t527) AND NOT FIREABLE(t87) AND (NOT FIREABLE(t282) OR NOT FIREABLE(t459)) AND ((FIREABLE(t157) AND FIREABLE(t464) AND (FIREABLE(t418) OR FIREABLE(t225))) OR (FIREABLE(t301) AND (FIREABLE(t286) OR FIREABLE(t424))))))) : E (F ((NOT FIREABLE(t97) AND FIREABLE(t70)))) : E (F (FIREABLE(t306))) : A (G ((NOT FIREABLE(t465) OR NOT FIREABLE(t273) OR (NOT FIREABLE(t530) AND NOT FIREABLE(t64)) OR FIREABLE(t348)))) : E (F (FIREABLE(t438))) : E (F (((FIREABLE(t277) AND FIREABLE(t169) AND (FIREABLE(t364) OR FIREABLE(t335)) AND NOT FIREABLE(t375)) OR (FIREABLE(t27) AND FIREABLE(t157) AND FIREABLE(t239) AND (NOT FIREABLE(t353) OR NOT FIREABLE(t97)))))) : A (G ((FIREABLE(t260) OR (NOT FIREABLE(t90) AND NOT FIREABLE(t339)) OR NOT FIREABLE(t197)))) : E (F ((NOT FIREABLE(t327) AND NOT FIREABLE(t189) AND NOT FIREABLE(t510) AND NOT FIREABLE(t481) AND NOT FIREABLE(t517) AND FIREABLE(t380)))) : E (F ((FIREABLE(t467) AND FIREABLE(t34)))) : E (F ((FIREABLE(t337) AND (FIREABLE(t437) OR FIREABLE(t24)) AND FIREABLE(t331) AND FIREABLE(t214) AND NOT FIREABLE(t88) AND FIREABLE(t50) AND FIREABLE(t35) AND (FIREABLE(t554) OR FIREABLE(t55))))) : E (F (FIREABLE(t566))) : E (F ((FIREABLE(t428) AND NOT FIREABLE(t57) AND FIREABLE(t147) AND NOT FIREABLE(t88)))) : E (F (FIREABLE(t193)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t421) AND FIREABLE(t519) AND NOT FIREABLE(t107) AND (FIREABLE(t371) OR FIREABLE(t102)) AND (((FIREABLE(t241) OR FIREABLE(t370)) AND (FIREABLE(t167) OR FIREABLE(t101))) OR FIREABLE(t142)))))
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 48 bytes per marking, with 18 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 328 literals and 20 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r09-ReachabilityFireability.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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t386) AND NOT FIREABLE(t396)) OR (NOT FIREABLE(t139) AND NOT FIREABLE(t208)) OR FIREABLE(t360) OR NOT FIREABLE(t124) OR FIREABLE(t156) OR FIREABLE(t396) OR NOT FIREABLE(t76))))
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 48 bytes per marking, with 18 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 832 literals and 64 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t19) AND FIREABLE(t26) AND NOT FIREABLE(t227))))
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 48 bytes per marking, with 18 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 Echo-PT-d02r09-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r09-ReachabilityFireability-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1880266 markings, 1961292 edges, 376053 markings/sec, 0 secs
lola: sara is running 5 secs || 3697427 markings, 3908947 edges, 363432 markings/sec, 5 secs
lola: sara is running 10 secs || 5573598 markings, 5962013 edges, 375234 markings/sec, 10 secs
lola: sara is running 15 secs || 7600337 markings, 8018026 edges, 405348 markings/sec, 15 secs
lola: sara is running 20 secs || 9562229 markings, 10010773 edges, 392378 markings/sec, 20 secs
lola: sara is running 25 secs || 11334706 markings, 11809184 edges, 354495 markings/sec, 25 secs
lola: sara is running 30 secs || 13123827 markings, 13636680 edges, 357824 markings/sec, 30 secs
lola: sara is running 35 secs || 14912059 markings, 15490695 edges, 357646 markings/sec, 35 secs
lola: sara is running 40 secs || 16666989 markings, 17312762 edges, 350986 markings/sec, 40 secs
lola: sara is running 45 secs || 18456987 markings, 19160055 edges, 358000 markings/sec, 45 secs
lola: sara is running 50 secs || 20225277 markings, 21025547 edges, 353658 markings/sec, 50 secs
lola: sara is running 55 secs || 21900015 markings, 22831118 edges, 334948 markings/sec, 55 secs
lola: sara is running 60 secs || 23678717 markings, 24746286 edges, 355740 markings/sec, 60 secs
lola: sara is running 65 secs || 25493220 markings, 26587428 edges, 362901 markings/sec, 65 secs
lola: sara is running 70 secs || 27289559 markings, 28411724 edges, 359268 markings/sec, 70 secs
lola: sara is running 75 secs || 29052144 markings, 30200695 edges, 352517 markings/sec, 75 secs
lola: sara is running 80 secs || 30889150 markings, 32084774 edges, 367401 markings/sec, 80 secs
lola: sara is running 85 secs || 32717578 markings, 33972296 edges, 365686 markings/sec, 85 secs
lola: sara is running 90 secs || 34520814 markings, 35847970 edges, 360647 markings/sec, 90 secs
lola: sara is running 95 secs || 36210695 markings, 37595738 edges, 337976 markings/sec, 95 secs
lola: sara is running 100 secs || 37823622 markings, 39299764 edges, 322585 markings/sec, 100 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t527) AND NOT FIREABLE(t87) AND (NOT FIREABLE(t282) OR NOT FIREABLE(t459)) AND ((FIREABLE(t157) AND FIREABLE(t464) AND (FIREABLE(t418) OR FIREABLE(t225))) OR (FIREABLE(t301) AND (FIREABLE(t286) OR FIREABLE(t424)))))))
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 48 bytes per marking, with 18 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: 25 markings, 24 edges
lola: ========================================
lola: subprocess 4 will run for 285 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t97) AND FIREABLE(t70))))
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 48 bytes per marking, with 18 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 5 will run for 311 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t306)))
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 48 bytes per marking, with 18 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 Echo-PT-d02r09-ReachabilityFireability-4.sara.
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t465) OR NOT FIREABLE(t273) OR (NOT FIREABLE(t530) AND NOT FIREABLE(t64)) OR FIREABLE(t348))))
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 48 bytes per marking, with 18 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 60 literals and 6 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t438)))
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 48 bytes per marking, with 18 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: 11 markings, 10 edges
lola: ========================================
lola: subprocess 8 will run for 428 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t277) AND FIREABLE(t169) AND (FIREABLE(t364) OR FIREABLE(t335)) AND NOT FIREABLE(t375)) OR (FIREABLE(t27) AND FIREABLE(t157) AND FIREABLE(t239) AND (NOT FIREABLE(t353) OR NOT FIREABLE(t97))))))
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 48 bytes per marking, with 18 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: 18 markings, 17 edges
lola: ========================================
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t260) OR (NOT FIREABLE(t90) AND NOT FIREABLE(t339)) OR NOT FIREABLE(t197))))
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 48 bytes per marking, with 18 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: 10 markings, 9 edges
lola: ========================================
lola: subprocess 10 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t327) AND NOT FIREABLE(t189) AND NOT FIREABLE(t510) AND NOT FIREABLE(t481) AND NOT FIREABLE(t517) AND FIREABLE(t380))))
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 48 bytes per marking, with 18 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 3072 literals and 384 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
sara: try reading problem file Echo-PT-d02r09-ReachabilityFireability-6.sara.
lola: subprocess 11 will run for 686 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t467) AND FIREABLE(t34))))
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 48 bytes per marking, with 18 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 6 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability-11.sara
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r09-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 12 will run for 857 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t337) AND (FIREABLE(t437) OR FIREABLE(t24)) AND FIREABLE(t331) AND FIREABLE(t214) AND NOT FIREABLE(t88) AND FIREABLE(t50) AND FIREABLE(t35) AND (FIREABLE(t554) OR FIREABLE(t55)))))
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 48 bytes per marking, with 18 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 164 literals and 8 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r09-ReachabilityFireability-12.sara.
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 1143 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t566)))
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 48 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 14 will run for 1715 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t428) AND NOT FIREABLE(t57) AND FIREABLE(t147) AND NOT FIREABLE(t88))))
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 48 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 32 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r09-ReachabilityFireability-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 15 will run for 3430 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t193)))
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 48 bytes per marking, with 18 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 Echo-PT-d02r09-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: RESULT
lola:
SUMMARY: yes no yes yes yes yes no yes yes no yes yes no yes yes yes
lola: ========================================

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Echo-PT-d02r09"
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/Echo-PT-d02r09.tgz
mv Echo-PT-d02r09 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 Echo-PT-d02r09, 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 r078-blw3-152649946200427"
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 ;