About the Execution of M4M.full for DLCshifumi-PT-5b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 909.600 | 328487.00 | 569913.00 | 1509.00 | FTT?TFTFFTTTFFTT | normal |
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 9.9M
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.7K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 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 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.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 9.7M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DLCshifumi-PT-5b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-152649743000210
=====================================================================
--------------------
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 DLCshifumi-PT-5b-ReachabilityFireability-00
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityFireability-01
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityFireability-02
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityFireability-03
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityFireability-04
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityFireability-05
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityFireability-06
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityFireability-07
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityFireability-08
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityFireability-09
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityFireability-10
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityFireability-11
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityFireability-12
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityFireability-13
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityFireability-14
FORMULA_NAME DLCshifumi-PT-5b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1526734859290
BK_STOP 1526735187777
--------------------
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 DLCshifumi-PT-5b as instance name.
Using DLCshifumi 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': 970460, 'Memory': 624.66, 'Tool': 'lola'}, {'Time': 973752, 'Memory': 608.42, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola DLCshifumi-PT-5b...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
DLCshifumi-PT-5b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
DLCshifumi-PT-5b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ DLCshifumi-PT-5b @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 66995/65536 symbol table entries, 38693 collisions
lola: preprocessing...
lola: finding significant places
lola: 27146 places, 39849 transitions, 25768 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 54873 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-5b-ReachabilityFireability.task
lola: A (G ((FIREABLE(t38678) OR ((FIREABLE(t2833) OR NOT FIREABLE(t12322)) AND (NOT FIREABLE(t27406) OR NOT FIREABLE(t16208)))))) : E (F (FIREABLE(t36107))) : E (F ((FIREABLE(t32710) AND (NOT FIREABLE(t25966) OR NOT FIREABLE(t30025) OR FIREABLE(t2821) OR FIREABLE(t21918) OR (FIREABLE(t20659) AND FIREABLE(t38343)))))) : E (F ((FIREABLE(t27148) OR (FIREABLE(t7016) AND FIREABLE(t7019) AND (FIREABLE(t33321) OR FIREABLE(t18051))) OR (NOT FIREABLE(t7416) AND (FIREABLE(t39561) OR FIREABLE(t39329)) AND FIREABLE(t14794) AND FIREABLE(t21928) AND FIREABLE(t27852))))) : E (F (FIREABLE(t11633))) : A (G ((NOT FIREABLE(t37105) AND ((NOT FIREABLE(t8827) AND NOT FIREABLE(t39281)) OR FIREABLE(t6105))))) : E (F ((FIREABLE(t14778) AND FIREABLE(t7531)))) : A (G ((FIREABLE(t11724) OR (NOT FIREABLE(t15856) AND NOT FIREABLE(t8225)) OR FIREABLE(t1000)))) : A (G (((NOT FIREABLE(t2272) AND NOT FIREABLE(t36401)) OR (FIREABLE(t165) AND FIREABLE(t1245) AND FIREABLE(t4964)) OR (NOT FIREABLE(t27733) AND FIREABLE(t35310) AND (FIREABLE(t1039) OR FIREABLE(t4750)))))) : E (F (((NOT FIREABLE(t5848) OR NOT FIREABLE(t29860) OR FIREABLE(t6063)) AND (FIREABLE(t21439) OR FIREABLE(t35198))))) : E (F (FIREABLE(t4379))) : E (F ((((FIREABLE(t22757) AND FIREABLE(t13117) AND (FIREABLE(t28790) OR FIREABLE(t10668))) OR (NOT FIREABLE(t39577) AND (FIREABLE(t31342) OR FIREABLE(t922)))) AND (FIREABLE(t31527) OR FIREABLE(t33568) OR (FIREABLE(t1963) AND FIREABLE(t13901)) OR FIREABLE(t14200))))) : A (G ((NOT FIREABLE(t21710) OR NOT FIREABLE(t30868) OR FIREABLE(t21997) OR FIREABLE(t18756)))) : A (G (NOT FIREABLE(t25051))) : E (F (FIREABLE(t12309))) : E (F (FIREABLE(t13299)))
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(t38678) OR ((FIREABLE(t2833) OR NOT FIREABLE(t12322)) AND (NOT FIREABLE(t27406) OR NOT FIREABLE(t16208))))))
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 3224 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 14 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5b-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 306 markings, 305 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t36107)))
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 3224 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5b-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1034 markings, 1033 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t32710) AND (NOT FIREABLE(t25966) OR NOT FIREABLE(t30025) OR FIREABLE(t2821) OR FIREABLE(t21918) OR (FIREABLE(t20659) AND FIREABLE(t38343))))))
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 3224 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 20 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5b-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1046 markings, 1045 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t27148) OR (FIREABLE(t7016) AND FIREABLE(t7019) AND (FIREABLE(t33321) OR FIREABLE(t18051))) OR (NOT FIREABLE(t7416) AND (FIREABLE(t39561) OR FIREABLE(t39329)) AND FIREABLE(t14794) AND FIREABLE(t21928) AND FIREABLE(t27852)))))
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 3224 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 22 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5b-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5b-ReachabilityFireability-3.sara.
lola: sara is running 0 secs || 3371 markings, 3732 edges, 674 markings/sec, 0 secs
lola: sara is running 5 secs || 5550 markings, 6355 edges, 436 markings/sec, 5 secs
lola: sara is running 10 secs || 7432 markings, 8672 edges, 376 markings/sec, 10 secs
lola: sara is running 15 secs || 9152 markings, 10819 edges, 344 markings/sec, 15 secs
lola: sara is running 20 secs || 12485 markings, 14916 edges, 667 markings/sec, 20 secs
lola: sara is running 25 secs || 15934 markings, 19149 edges, 690 markings/sec, 25 secs
lola: sara is running 30 secs || 19421 markings, 23429 edges, 697 markings/sec, 30 secs
lola: sara is running 35 secs || 22624 markings, 27242 edges, 641 markings/sec, 35 secs
lola: sara is running 40 secs || 25196 markings, 30563 edges, 514 markings/sec, 40 secs
lola: sara is running 45 secs || 27724 markings, 33834 edges, 506 markings/sec, 45 secs
lola: sara is running 50 secs || 30377 markings, 37212 edges, 531 markings/sec, 50 secs
lola: sara is running 55 secs || 32963 markings, 40518 edges, 517 markings/sec, 55 secs
lola: sara is running 60 secs || 35584 markings, 43892 edges, 524 markings/sec, 60 secs
lola: sara is running 65 secs || 37602 markings, 46506 edges, 404 markings/sec, 65 secs
lola: sara is running 70 secs || 38778 markings, 48056 edges, 235 markings/sec, 70 secs
lola: sara is running 75 secs || 40062 markings, 49647 edges, 257 markings/sec, 75 secs
lola: sara is running 80 secs || 42909 markings, 53339 edges, 569 markings/sec, 80 secs
lola: sara is running 85 secs || 45803 markings, 57040 edges, 579 markings/sec, 85 secs
lola: sara is running 90 secs || 48697 markings, 60781 edges, 579 markings/sec, 90 secs
lola: sara is running 95 secs || 51462 markings, 64219 edges, 553 markings/sec, 95 secs
lola: sara is running 100 secs || 53754 markings, 67265 edges, 458 markings/sec, 100 secs
lola: sara is running 105 secs || 55663 markings, 69713 edges, 382 markings/sec, 105 secs
lola: sara is running 110 secs || 56787 markings, 71164 edges, 225 markings/sec, 110 secs
lola: sara is running 115 secs || 59089 markings, 74107 edges, 460 markings/sec, 115 secs
lola: sara is running 120 secs || 61442 markings, 77146 edges, 471 markings/sec, 120 secs
lola: sara is running 125 secs || 63494 markings, 79777 edges, 410 markings/sec, 125 secs
lola: sara is running 130 secs || 65597 markings, 82473 edges, 421 markings/sec, 130 secs
lola: sara is running 135 secs || 67707 markings, 85186 edges, 422 markings/sec, 135 secs
lola: sara is running 140 secs || 69727 markings, 87763 edges, 404 markings/sec, 140 secs
lola: sara is running 145 secs || 71950 markings, 90629 edges, 445 markings/sec, 145 secs
lola: sara is running 150 secs || 74300 markings, 93649 edges, 470 markings/sec, 150 secs
lola: sara is running 155 secs || 76915 markings, 97005 edges, 523 markings/sec, 155 secs
lola: sara is running 160 secs || 79501 markings, 100327 edges, 517 markings/sec, 160 secs
lola: sara is running 165 secs || 82052 markings, 103606 edges, 510 markings/sec, 165 secs
lola: sara is running 170 secs || 84571 markings, 106832 edges, 504 markings/sec, 170 secs
lola: sara is running 175 secs || 86810 markings, 109707 edges, 448 markings/sec, 175 secs
lola: sara is running 180 secs || 89282 markings, 112888 edges, 494 markings/sec, 180 secs
lola: sara is running 185 secs || 92011 markings, 116371 edges, 546 markings/sec, 185 secs
lola: sara is running 190 secs || 94714 markings, 119810 edges, 541 markings/sec, 190 secs
lola: sara is running 195 secs || 97374 markings, 123154 edges, 532 markings/sec, 195 secs
lola: sara is running 200 secs || 100089 markings, 126582 edges, 543 markings/sec, 200 secs
lola: sara is running 205 secs || 102821 markings, 130031 edges, 546 markings/sec, 205 secs
lola: sara is running 210 secs || 105530 markings, 133464 edges, 542 markings/sec, 210 secs
lola: sara is running 215 secs || 108231 markings, 136891 edges, 540 markings/sec, 215 secs
lola: sara is running 220 secs || 111348 markings, 140825 edges, 623 markings/sec, 220 secs
lola: sara is running 225 secs || 114448 markings, 145020 edges, 620 markings/sec, 225 secs
lola: sara is running 230 secs || 117686 markings, 149625 edges, 648 markings/sec, 230 secs
lola: sara is running 235 secs || 120754 markings, 153994 edges, 614 markings/sec, 235 secs
lola: sara is running 240 secs || 123727 markings, 158084 edges, 595 markings/sec, 240 secs
lola: sara is running 245 secs || 126889 markings, 162605 edges, 632 markings/sec, 245 secs
lola: sara is running 250 secs || 129788 markings, 166685 edges, 580 markings/sec, 250 secs
lola: sara is running 255 secs || 132512 markings, 170292 edges, 545 markings/sec, 255 secs
lola: sara is running 260 secs || 135367 markings, 174282 edges, 571 markings/sec, 260 secs
lola: sara is running 265 secs || 138306 markings, 178515 edges, 588 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t11633)))
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 3224 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5b-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1167 markings, 1166 edges
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t37105) AND ((NOT FIREABLE(t8827) AND NOT FIREABLE(t39281)) OR FIREABLE(t6105)))))
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 3224 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5b-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 41 markings, 40 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t14778) AND FIREABLE(t7531))))
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 3224 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5b-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 840 markings, 839 edges
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t11724) OR (NOT FIREABLE(t15856) AND NOT FIREABLE(t8225)) OR FIREABLE(t1000))))
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 3224 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5b-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1115 markings, 1242 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t2272) AND NOT FIREABLE(t36401)) OR (FIREABLE(t165) AND FIREABLE(t1245) AND FIREABLE(t4964)) OR (NOT FIREABLE(t27733) AND FIREABLE(t35310) AND (FIREABLE(t1039) OR FIREABLE(t4750))))))
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 3224 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 96 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5b-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 230 markings, 229 edges
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t5848) OR NOT FIREABLE(t29860) OR FIREABLE(t6063)) AND (FIREABLE(t21439) OR FIREABLE(t35198)))))
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 3224 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 20 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5b-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 120 markings, 119 edges
lola: ========================================
lola: subprocess 10 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t4379)))
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 3224 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5b-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5052 markings, 5728 edges
lola: ========================================
lola: subprocess 11 will run for 652 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t22757) AND FIREABLE(t13117) AND (FIREABLE(t28790) OR FIREABLE(t10668))) OR (NOT FIREABLE(t39577) AND (FIREABLE(t31342) OR FIREABLE(t922)))) AND (FIREABLE(t31527) OR FIREABLE(t33568) OR (FIREABLE(t1963) AND FIREABLE(t13901)) OR FIREABLE(t14200)))))
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 3224 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 76 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5b-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5b-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1425 markings, 1521 edges
lola: ========================================
lola: subprocess 12 will run for 814 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t21710) OR NOT FIREABLE(t30868) OR FIREABLE(t21997) OR FIREABLE(t18756))))
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 3224 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5b-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 846 markings, 845 edges
lola: ========================================
lola: subprocess 13 will run for 1086 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t25051)))
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 3224 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5b-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2569 markings, 2834 edges
lola: ========================================
lola: subprocess 14 will run for 1628 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t12309)))
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 3224 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5b-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 1387 markings, 1386 edges
lola: ========================================
lola: subprocess 15 will run for 3257 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t13299)))
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 3224 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-5b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-5b-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 64 markings, 63 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes unknown yes no yes no no yes yes yes no no yes yes
FORMULA DLCshifumi-PT-5b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5b-ReachabilityFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5b-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5b-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5b-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5b-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5b-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5b-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-5b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCshifumi-PT-5b"
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/DLCshifumi-PT-5b.tgz
mv DLCshifumi-PT-5b 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 DLCshifumi-PT-5b, 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 r070-smll-152649743000210"
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 '
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 ;