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 1.5M
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K 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 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 1.4M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Echo-PT-d02r19, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-blw3-152649949800448
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527427595024


BK_STOP 1527427959121

--------------------
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-d02r19 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': 207, 'Memory': 111.77, 'Tool': 'lola'}, {'Time': 327, 'Memory': 112.53, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola Echo-PT-d02r19...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
Echo-PT-d02r19: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ Echo-PT-d02r19 @ 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: 6185/65536 symbol table entries, 806 collisions
lola: preprocessing...
lola: finding significant places
lola: 3455 places, 2730 transitions, 1726 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5448 transition conflict sets
lola: TASK
lola: reading formula from Echo-PT-d02r19-ReachabilityFireability.task
lola: A (G ((FIREABLE(t2595) OR FIREABLE(t1666) OR NOT FIREABLE(t2048)))) : E (F (FIREABLE(t1585))) : E (F ((FIREABLE(t2526) OR FIREABLE(t1263) OR FIREABLE(t962)))) : E (F ((NOT FIREABLE(t2526) AND NOT FIREABLE(t2683) AND NOT FIREABLE(t2392) AND ((FIREABLE(t51) AND FIREABLE(t436)) OR NOT FIREABLE(t2709)) AND (FIREABLE(t2381) OR FIREABLE(t956))))) : A (G ((NOT FIREABLE(t1307) OR (NOT FIREABLE(t525) AND NOT FIREABLE(t2452))))) : A (G ((NOT FIREABLE(t731) OR NOT FIREABLE(t365) OR (NOT FIREABLE(t4) AND NOT FIREABLE(t1608)) OR (FIREABLE(t636) AND NOT FIREABLE(t807))))) : E (F ((FIREABLE(t2330) AND (NOT FIREABLE(t2606) OR NOT FIREABLE(t1239)) AND NOT FIREABLE(t2664)))) : E (F ((FIREABLE(t1731) AND FIREABLE(t2569) AND FIREABLE(t1983) AND FIREABLE(t2635)))) : E (F (FIREABLE(t1651))) : A (G ((NOT FIREABLE(t596) OR NOT FIREABLE(t1711) OR FIREABLE(t2117) OR NOT FIREABLE(t1437)))) : A (G (NOT FIREABLE(t2035))) : E (F (((FIREABLE(t2175) OR FIREABLE(t2157)) AND NOT FIREABLE(t1342)))) : E (F (FIREABLE(t2373))) : E (F ((FIREABLE(t1878) OR (NOT FIREABLE(t2367) AND NOT FIREABLE(t2200) AND (FIREABLE(t1184) OR FIREABLE(t2120)))))) : A (G (((NOT FIREABLE(t1453) OR (NOT FIREABLE(t1214) AND NOT FIREABLE(t1316))) AND (FIREABLE(t424) OR FIREABLE(t2576) OR FIREABLE(t1791) OR NOT FIREABLE(t314))))) : E (F (FIREABLE(t708)))
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(t2595) OR FIREABLE(t1666) OR NOT FIREABLE(t2048))))
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 216 bytes per marking, with 2 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 8 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1585)))
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 216 bytes per marking, with 2 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-d02r19-ReachabilityFireability.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2526) OR FIREABLE(t1263) OR FIREABLE(t962))))
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 216 bytes per marking, with 2 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 3 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityFireability-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t2526) AND NOT FIREABLE(t2683) AND NOT FIREABLE(t2392) AND ((FIREABLE(t51) AND FIREABLE(t436)) OR NOT FIREABLE(t2709)) AND (FIREABLE(t2381) OR FIREABLE(t956)))))
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 216 bytes per marking, with 2 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: 12 markings, 11 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1307) OR (NOT FIREABLE(t525) AND NOT FIREABLE(t2452)))))
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 216 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityFireability-4.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: 15 markings, 14 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t731) OR NOT FIREABLE(t365) OR (NOT FIREABLE(t4) AND NOT FIREABLE(t1608)) OR (FIREABLE(t636) AND NOT FIREABLE(t807)))))
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 216 bytes per marking, with 2 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 92 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r19-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 859030 markings, 867070 edges, 171806 markings/sec, 0 secs
lola: sara is running 5 secs || 1763103 markings, 1784810 edges, 180815 markings/sec, 5 secs
lola: sara is running 10 secs || 2673045 markings, 2706603 edges, 181988 markings/sec, 10 secs
lola: sara is running 15 secs || 3560710 markings, 3624692 edges, 177533 markings/sec, 15 secs
lola: sara is running 20 secs || 4383810 markings, 4483907 edges, 164620 markings/sec, 20 secs
lola: sara is running 25 secs || 5244472 markings, 5348535 edges, 172132 markings/sec, 25 secs
lola: sara is running 30 secs || 6095258 markings, 6203224 edges, 170157 markings/sec, 30 secs
lola: sara is running 35 secs || 6945502 markings, 7058430 edges, 170049 markings/sec, 35 secs
lola: sara is running 40 secs || 7786474 markings, 7903200 edges, 168194 markings/sec, 40 secs
lola: sara is running 45 secs || 8681198 markings, 8802239 edges, 178945 markings/sec, 45 secs
lola: sara is running 50 secs || 9609087 markings, 9734461 edges, 185578 markings/sec, 50 secs
lola: sara is running 55 secs || 10517517 markings, 10647241 edges, 181686 markings/sec, 55 secs
lola: sara is running 60 secs || 11443000 markings, 11577899 edges, 185097 markings/sec, 60 secs
lola: sara is running 65 secs || 12351885 markings, 12492151 edges, 181777 markings/sec, 65 secs
lola: sara is running 70 secs || 13265443 markings, 13412630 edges, 182712 markings/sec, 70 secs
lola: sara is running 75 secs || 14175321 markings, 14328675 edges, 181976 markings/sec, 75 secs
lola: sara is running 80 secs || 15085872 markings, 15255106 edges, 182110 markings/sec, 80 secs
lola: sara is running 85 secs || 15992939 markings, 16173855 edges, 181413 markings/sec, 85 secs
lola: sara is running 90 secs || 16902247 markings, 17098493 edges, 181862 markings/sec, 90 secs
lola: sara is running 95 secs || 17780452 markings, 18029756 edges, 175641 markings/sec, 95 secs
lola: sara is running 100 secs || 18718384 markings, 18971944 edges, 187586 markings/sec, 100 secs
lola: sara is running 105 secs || 19641355 markings, 19899097 edges, 184594 markings/sec, 105 secs
lola: sara is running 110 secs || 20562474 markings, 20825453 edges, 184224 markings/sec, 110 secs
lola: sara is running 115 secs || 21484198 markings, 21751282 edges, 184345 markings/sec, 115 secs
lola: sara is running 120 secs || 22384461 markings, 22656019 edges, 180053 markings/sec, 120 secs
lola: sara is running 125 secs || 23306967 markings, 23582711 edges, 184501 markings/sec, 125 secs
lola: sara is running 130 secs || 24207058 markings, 24487108 edges, 180018 markings/sec, 130 secs
lola: sara is running 135 secs || 25132329 markings, 25417555 edges, 185054 markings/sec, 135 secs
lola: sara is running 140 secs || 26038284 markings, 26328867 edges, 181191 markings/sec, 140 secs
lola: sara is running 145 secs || 26944996 markings, 27242473 edges, 181342 markings/sec, 145 secs
lola: sara is running 150 secs || 27804425 markings, 28166108 edges, 171886 markings/sec, 150 secs
lola: sara is running 155 secs || 28705806 markings, 29112105 edges, 180276 markings/sec, 155 secs
lola: sara is running 160 secs || 29601525 markings, 30045222 edges, 179144 markings/sec, 160 secs
lola: sara is running 165 secs || 30464643 markings, 30974207 edges, 172624 markings/sec, 165 secs
lola: sara is running 170 secs || 31334035 markings, 31906649 edges, 173878 markings/sec, 170 secs
lola: sara is running 175 secs || 32211468 markings, 32843555 edges, 175487 markings/sec, 175 secs
lola: sara is running 180 secs || 33053823 markings, 33771884 edges, 168471 markings/sec, 180 secs
lola: sara is running 185 secs || 33866309 markings, 34704324 edges, 162497 markings/sec, 185 secs
lola: sara is running 190 secs || 34696627 markings, 35631699 edges, 166064 markings/sec, 190 secs
lola: sara is running 195 secs || 35631804 markings, 36577335 edges, 187035 markings/sec, 195 secs
lola: sara is running 200 secs || 36562696 markings, 37517536 edges, 186178 markings/sec, 200 secs
lola: sara is running 205 secs || 37480214 markings, 38443920 edges, 183504 markings/sec, 205 secs
lola: sara is running 210 secs || 38384910 markings, 39359118 edges, 180939 markings/sec, 210 secs
lola: sara is running 215 secs || 39329272 markings, 40310484 edges, 188872 markings/sec, 215 secs
lola: sara is running 220 secs || 40241958 markings, 41227621 edges, 182537 markings/sec, 220 secs
lola: sara is running 225 secs || 41144639 markings, 42137657 edges, 180536 markings/sec, 225 secs
lola: sara is running 230 secs || 42040904 markings, 43056165 edges, 179253 markings/sec, 230 secs
lola: sara is running 235 secs || 42946355 markings, 43973562 edges, 181090 markings/sec, 235 secs
lola: sara is running 240 secs || 43852345 markings, 44884222 edges, 181198 markings/sec, 240 secs
lola: sara is running 245 secs || 44760907 markings, 45802880 edges, 181712 markings/sec, 245 secs
lola: sara is running 250 secs || 45654262 markings, 46706709 edges, 178671 markings/sec, 250 secs
lola: sara is running 255 secs || 46560099 markings, 47622747 edges, 181167 markings/sec, 255 secs
lola: sara is running 260 secs || 47461671 markings, 48533078 edges, 180314 markings/sec, 260 secs
lola: sara is running 265 secs || 48351728 markings, 49434191 edges, 178011 markings/sec, 265 secs
lola: sara is running 270 secs || 49239372 markings, 50326890 edges, 177529 markings/sec, 270 secs
lola: sara is running 275 secs || 50129215 markings, 51223450 edges, 177969 markings/sec, 275 secs
lola: sara is running 280 secs || 51056626 markings, 52154705 edges, 185482 markings/sec, 280 secs
lola: sara is running 285 secs || 51990381 markings, 53092028 edges, 186751 markings/sec, 285 secs
lola: sara is running 290 secs || 52925012 markings, 54030225 edges, 186926 markings/sec, 290 secs
lola: sara is running 295 secs || 53856203 markings, 54964983 edges, 186238 markings/sec, 295 secs
lola: sara is running 300 secs || 54785691 markings, 55898645 edges, 185898 markings/sec, 300 secs
lola: sara is running 305 secs || 55705202 markings, 56821669 edges, 183902 markings/sec, 305 secs
lola: sara is running 310 secs || 56622761 markings, 57742740 edges, 183512 markings/sec, 310 secs
lola: sara is running 315 secs || 57536867 markings, 58660960 edges, 182821 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2330) AND (NOT FIREABLE(t2606) OR NOT FIREABLE(t1239)) AND NOT FIREABLE(t2664))))
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 216 bytes per marking, with 2 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 144 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityFireability-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1731) AND FIREABLE(t2569) AND FIREABLE(t1983) AND FIREABLE(t2635))))
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 216 bytes per marking, with 2 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 13 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 52 markings, 51 edges
lola: ========================================
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1651)))
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 216 bytes per marking, with 2 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-d02r19-ReachabilityFireability-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t596) OR NOT FIREABLE(t1711) OR FIREABLE(t2117) OR NOT FIREABLE(t1437))))
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 216 bytes per marking, with 2 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 27 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityFireability-9.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 10 will run for 536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t2035)))
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 216 bytes per marking, with 2 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-d02r19-ReachabilityFireability-10.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 11 will run for 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t2175) OR FIREABLE(t2157)) AND NOT FIREABLE(t1342))))
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 216 bytes per marking, with 2 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 Echo-PT-d02r19-ReachabilityFireability-11.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t2373)))
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 216 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityFireability-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 13 will run for 1073 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1878) OR (NOT FIREABLE(t2367) AND NOT FIREABLE(t2200) AND (FIREABLE(t1184) OR FIREABLE(t2120))))))
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 216 bytes per marking, with 2 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 146 literals and 33 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 14 will run for 1609 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t1453) OR (NOT FIREABLE(t1214) AND NOT FIREABLE(t1316))) AND (FIREABLE(t424) OR FIREABLE(t2576) OR FIREABLE(t1791) OR NOT FIREABLE(t314)))))
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 216 bytes per marking, with 2 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 232 literals and 34 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityFireability-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 15 will run for 3219 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t708)))
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 216 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r19-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes no unknown yes yes yes no no yes yes yes no yes
FORMULA Echo-PT-d02r19-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r19-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 stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Echo-PT-d02r19"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="mcc4mcc-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-d02r19.tgz
mv Echo-PT-d02r19 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 mcc4mcc-full"
echo " Input is Echo-PT-d02r19, 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 r082-blw3-152649949800448"
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 ;