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 204K
-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.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 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.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 108 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 346 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 43K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is AutoFlight-PT-06a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r019-qhx1-152646243600126
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526804147153


BK_STOP 1526804263842

--------------------
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 AutoFlight-PT-06a as instance name.
Using AutoFlight 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': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 312, 'Memory': 110.35, 'Tool': 'lola'}, {'Time': 436, 'Memory': 112.54, 'Tool': 'lola'}, {'Time': 3098, 'Memory': 290.26, 'Tool': 'itstools'}, {'Time': 3467, 'Memory': 284.57, 'Tool': 'itstools'}, {'Time': 38079, 'Memory': 2637.09, 'Tool': 'marcie'}, {'Time': 40393, 'Memory': 2637.08, 'Tool': 'marcie'}, {'Time': 80204, 'Memory': 1309.03, 'Tool': 'gspn'}, {'Time': 81530, 'Memory': 1281.67, 'Tool': 'gspn'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola AutoFlight-PT-06a...

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


checking for too many tokens
===========================================================================================
AutoFlight-PT-06a: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ AutoFlight-PT-06a @ 3538 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 312/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 157 places, 155 transitions, 117 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 152 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-06a-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t31) OR NOT FIREABLE(t1) OR NOT FIREABLE(t116) OR (FIREABLE(t116) AND FIREABLE(t95))))) : E (F ((FIREABLE(t126) AND FIREABLE(t32) AND (FIREABLE(t107) OR FIREABLE(t59))))) : A (G ((FIREABLE(t144) OR NOT FIREABLE(t88) OR (FIREABLE(t28) AND NOT FIREABLE(t126) AND FIREABLE(t92) AND FIREABLE(t108) AND (FIREABLE(t122) OR FIREABLE(t45)))))) : A (G ((((NOT FIREABLE(t149) OR NOT FIREABLE(t1)) AND NOT FIREABLE(t46)) OR NOT FIREABLE(t84)))) : A (G ((NOT FIREABLE(t143) OR NOT FIREABLE(t63) OR NOT FIREABLE(t104) OR FIREABLE(t121) OR (FIREABLE(t19) AND (FIREABLE(t79) OR FIREABLE(t150) OR NOT FIREABLE(t15)))))) : E (F ((((NOT FIREABLE(t21) AND NOT FIREABLE(t38)) OR (NOT FIREABLE(t12) AND NOT FIREABLE(t38))) AND FIREABLE(t2)))) : E (F (FIREABLE(t102))) : A (G (NOT FIREABLE(t128))) : A (G (((FIREABLE(t74) AND FIREABLE(t23)) OR (NOT FIREABLE(t93) AND FIREABLE(t117)) OR (NOT FIREABLE(t7) AND NOT FIREABLE(t9))))) : E (F (((FIREABLE(t66) OR NOT FIREABLE(t90)) AND (FIREABLE(t143) OR (FIREABLE(t138) AND FIREABLE(t33))) AND (NOT FIREABLE(t54) OR (FIREABLE(t34) AND FIREABLE(t63) AND NOT FIREABLE(t72)))))) : A (G ((NOT FIREABLE(t107) OR NOT FIREABLE(t113)))) : A (G ((NOT FIREABLE(t126) OR NOT FIREABLE(t20)))) : E (F (FIREABLE(t142))) : A (G (((FIREABLE(t3) AND FIREABLE(t42) AND NOT FIREABLE(t79) AND FIREABLE(t49)) OR NOT FIREABLE(t117)))) : E (F (FIREABLE(t46))) : A (G ((NOT FIREABLE(t143) OR NOT FIREABLE(t87) OR FIREABLE(t35) OR (FIREABLE(t152) AND FIREABLE(t109)))))
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(t31) OR NOT FIREABLE(t1) OR NOT FIREABLE(t116) OR (FIREABLE(t116) AND FIREABLE(t95)))))
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 16 bytes per marking, with 11 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 AutoFlight-PT-06a-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-06a-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15502 markings, 55942 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t126) AND FIREABLE(t32) AND (FIREABLE(t107) OR FIREABLE(t59)))))
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 16 bytes per marking, with 11 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability.sara
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t144) OR NOT FIREABLE(t88) OR (FIREABLE(t28) AND NOT FIREABLE(t126) AND FIREABLE(t92) AND FIREABLE(t108) AND (FIREABLE(t122) OR FIREABLE(t45))))))
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 16 bytes per marking, with 11 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 58 literals and 14 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-2.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: 8 markings, 7 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(t149) OR NOT FIREABLE(t1)) AND NOT FIREABLE(t46)) OR NOT FIREABLE(t84))))
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 16 bytes per marking, with 11 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 AutoFlight-PT-06a-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-06a-ReachabilityFireability-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 363820 markings, 2394988 edges, 72764 markings/sec, 0 secs
lola: sara is running 5 secs || 703671 markings, 4931187 edges, 67970 markings/sec, 5 secs
lola: sara is running 10 secs || 982920 markings, 7638664 edges, 55850 markings/sec, 10 secs
lola: sara is running 15 secs || 1270258 markings, 10056068 edges, 57468 markings/sec, 15 secs
lola: sara is running 20 secs || 1558202 markings, 12611896 edges, 57589 markings/sec, 20 secs
lola: sara is running 25 secs || 1868843 markings, 15323394 edges, 62128 markings/sec, 25 secs
lola: sara is running 30 secs || 2181006 markings, 17968917 edges, 62433 markings/sec, 30 secs
lola: sara is running 35 secs || 2493968 markings, 21019977 edges, 62592 markings/sec, 35 secs
lola: sara is running 40 secs || 2792362 markings, 24095763 edges, 59679 markings/sec, 40 secs
lola: sara is running 45 secs || 3080926 markings, 26874632 edges, 57713 markings/sec, 45 secs
lola: sara is running 50 secs || 3351645 markings, 29888812 edges, 54144 markings/sec, 50 secs
lola: sara is running 55 secs || 3583874 markings, 32639622 edges, 46446 markings/sec, 55 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 3628089 markings, 33687063 edges
lola: ========================================
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t143) OR NOT FIREABLE(t63) OR NOT FIREABLE(t104) OR FIREABLE(t121) OR (FIREABLE(t19) AND (FIREABLE(t79) OR FIREABLE(t150) OR NOT FIREABLE(t15))))))
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 16 bytes per marking, with 11 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 48 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-06a-ReachabilityFireability-4.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 5 will run for 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((NOT FIREABLE(t21) AND NOT FIREABLE(t38)) OR (NOT FIREABLE(t12) AND NOT FIREABLE(t38))) AND FIREABLE(t2))))
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 16 bytes per marking, with 11 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-5.sara
lola: ========================================
lola: subprocess 6 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t102)))
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 16 bytes per marking, with 11 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: 15 markings, 14 edges
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-6.sara
lola: ========================================
lola: subprocess 7 will run for 386 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t128)))
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 16 bytes per marking, with 11 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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-7.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 25 markings, 24 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 8 will run for 434 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t74) AND FIREABLE(t23)) OR (NOT FIREABLE(t93) AND FIREABLE(t117)) OR (NOT FIREABLE(t7) AND NOT FIREABLE(t9)))))
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 16 bytes per marking, with 11 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 18 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-8.sara
lola: ========================================
sara: try reading problem file AutoFlight-PT-06a-ReachabilityFireability-7.sara.
lola: subprocess 9 will run for 496 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t66) OR NOT FIREABLE(t90)) AND (FIREABLE(t143) OR (FIREABLE(t138) AND FIREABLE(t33))) AND (NOT FIREABLE(t54) OR (FIREABLE(t34) AND FIREABLE(t63) AND NOT FIREABLE(t72))))))
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 16 bytes per marking, with 11 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 114 literals and 18 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 102 markings, 268 edges
lola: ========================================
lola: subprocess 10 will run for 579 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t107) OR NOT FIREABLE(t113))))
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 16 bytes per marking, with 11 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
sara: place or transition ordering is non-deterministic
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-10.sara

sara: try reading problem file AutoFlight-PT-06a-ReachabilityFireability-9.sara.
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-06a-ReachabilityFireability-10.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: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

lola: subprocess 11 will run for 695 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t126) OR NOT FIREABLE(t20))))
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 16 bytes per marking, with 11 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 AutoFlight-PT-06a-ReachabilityFireability-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 27 markings, 26 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 12 will run for 868 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (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 16 bytes per marking, with 11 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
sara: try reading problem file AutoFlight-PT-06a-ReachabilityFireability-11.sara.
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 113 markings, 279 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 13 will run for 1158 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t3) AND FIREABLE(t42) AND NOT FIREABLE(t79) AND FIREABLE(t49)) OR NOT FIREABLE(t117))))
lola: sara: ========================================try reading problem file AutoFlight-PT-06a-ReachabilityFireability-12.sara.

lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)sara:
place or transition ordering is non-deterministic
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 11 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: 7 markings, 6 edges
lola: ========================================

lola: subprocess 14 will run for 1737 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t46)))
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 16 bytes per marking, with 11 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 1 literals and 1 conjunctive subformulas
sara: place or transition ordering is non-deterministic
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-14.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 15 will run for 3475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t143) OR NOT FIREABLE(t87) OR FIREABLE(t35) OR (FIREABLE(t152) AND FIREABLE(t109)))))
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 16 bytes per marking, with 11 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 24 literals and 4 conjunctive subformulas
sara: try reading problem file AutoFlight-PT-06a-ReachabilityFireability-14.sara.
lola: state equation: write sara problem file to AutoFlight-PT-06a-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-06a-ReachabilityFireability-15.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: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes yes yes yes no no yes yes no yes no yes yes
FORMULA AutoFlight-PT-06a-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-06a-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-06a-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-06a-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-06a-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-06a-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-06a-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-06a-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-06a-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-06a-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-06a-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-06a-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-06a-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-06a-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-06a-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-06a-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="AutoFlight-PT-06a"
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/AutoFlight-PT-06a.tgz
mv AutoFlight-PT-06a 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 AutoFlight-PT-06a, 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 r019-qhx1-152646243600126"
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 ;