fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r094-blw7-152650006300238
Last Updated
June 26, 2018

About the Execution of M4M.full for FlexibleBarrier-PT-22b

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
795.360 533947.00 994267.00 185.20 F?TTFFTTTTFTTTFT 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 2.0M
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.8M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is FlexibleBarrier-PT-22b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-blw7-152650006300238
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527520756821


BK_STOP 1527521290768

--------------------
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 FlexibleBarrier-PT-22b as instance name.
Using FlexibleBarrier 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': 758787, 'Memory': 784.36, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola FlexibleBarrier-PT-22b...

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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-22b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ FlexibleBarrier-PT-22b @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 13947/65536 symbol table entries, 4218 collisions
lola: preprocessing...
lola: finding significant places
lola: 6478 places, 7469 transitions, 6454 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 7515 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-22b-ReachabilityFireability.task
lola: E (F ((FIREABLE(t4794) AND FIREABLE(t603) AND NOT FIREABLE(t1328) AND FIREABLE(t730) AND FIREABLE(t4452)))) : E (F ((NOT FIREABLE(t3203) AND NOT FIREABLE(t2537) AND FIREABLE(t1458) AND FIREABLE(t3902) AND NOT FIREABLE(t6642) AND (FIREABLE(t546) OR FIREABLE(t4905))))) : E (F (FIREABLE(t4683))) : E (F ((FIREABLE(t6637) OR FIREABLE(t1031) OR FIREABLE(t4004)))) : E (F ((NOT FIREABLE(t2403) AND NOT FIREABLE(t946) AND FIREABLE(t2480) AND (FIREABLE(t845) OR FIREABLE(t7070) OR (FIREABLE(t6082) AND FIREABLE(t7199))) AND FIREABLE(t2196)))) : A (G ((NOT FIREABLE(t1203) OR NOT FIREABLE(t4656)))) : A (G ((FIREABLE(t7210) OR FIREABLE(t747) OR NOT FIREABLE(t7319) OR FIREABLE(t5474) OR NOT FIREABLE(t228) OR (((FIREABLE(t2037) AND FIREABLE(t2616)) OR (FIREABLE(t7204) AND FIREABLE(t4882))) AND FIREABLE(t1155))))) : E (F (((FIREABLE(t2146) AND FIREABLE(t1690) AND (FIREABLE(t1995) OR FIREABLE(t3146)) AND NOT FIREABLE(t5286) AND NOT FIREABLE(t22)) OR FIREABLE(t4759)))) : E (F (FIREABLE(t928))) : E (F (((((FIREABLE(t6500) AND FIREABLE(t5378)) OR FIREABLE(t3835)) AND (NOT FIREABLE(t7088) OR (FIREABLE(t5290) AND FIREABLE(t5222)))) OR FIREABLE(t1383)))) : E (F ((FIREABLE(t6969) AND FIREABLE(t250)))) : E (F ((NOT FIREABLE(t6427) AND NOT FIREABLE(t6041) AND FIREABLE(t7321) AND FIREABLE(t5595)))) : E (F (((NOT FIREABLE(t4957) OR FIREABLE(t4254)) AND FIREABLE(t5080)))) : E (F (FIREABLE(t6686))) : A (G ((FIREABLE(t1112) OR FIREABLE(t1709) OR (FIREABLE(t6154) AND FIREABLE(t1097)) OR (NOT FIREABLE(t4636) AND NOT FIREABLE(t6457)) OR (FIREABLE(t603) AND (FIREABLE(t1462) OR FIREABLE(t1855)) AND FIREABLE(t5693))))) : E (F ((FIREABLE(t3335) AND FIREABLE(t2952) AND (NOT FIREABLE(t4466) OR NOT FIREABLE(t6385) OR NOT FIREABLE(t6018) OR NOT FIREABLE(t903)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t4794) AND FIREABLE(t603) AND NOT FIREABLE(t1328) AND FIREABLE(t730) AND FIREABLE(t4452))))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability.sara.
lola: sara is running 0 secs || 31029 markings, 59732 edges, 6206 markings/sec, 0 secs
lola: sara is running 5 secs || 63792 markings, 124255 edges, 6553 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 95928 markings, 187280 edges, 6427 markings/sec, 10 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t3203) AND NOT FIREABLE(t2537) AND FIREABLE(t1458) AND FIREABLE(t3902) AND NOT FIREABLE(t6642) AND (FIREABLE(t546) OR FIREABLE(t4905)))))
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 808 bytes per marking, with 10 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 36 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability.sara.
lola: sara is running 0 secs || 37577 markings, 83421 edges, 7515 markings/sec, 0 secs
lola: sara is running 5 secs || 76019 markings, 170295 edges, 7688 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 113155 markings, 264917 edges, 7427 markings/sec, 10 secs
lola: sara is running 15 secs || 149994 markings, 355302 edges, 7368 markings/sec, 15 secs
lola: sara is running 20 secs || 189077 markings, 441445 edges, 7817 markings/sec, 20 secs
lola: sara is running 25 secs || 226523 markings, 534222 edges, 7489 markings/sec, 25 secs
lola: sara is running 30 secs || 262645 markings, 627610 edges, 7224 markings/sec, 30 secs
lola: sara is running 35 secs || 301876 markings, 713982 edges, 7846 markings/sec, 35 secs
lola: sara is running 40 secs || 339438 markings, 803932 edges, 7512 markings/sec, 40 secs
lola: sara is running 45 secs || 376392 markings, 899060 edges, 7391 markings/sec, 45 secs
lola: sara is running 50 secs || 414623 markings, 986446 edges, 7646 markings/sec, 50 secs
lola: sara is running 55 secs || 453646 markings, 1072843 edges, 7805 markings/sec, 55 secs
lola: sara is running 60 secs || 490573 markings, 1168087 edges, 7385 markings/sec, 60 secs
lola: sara is running 65 secs || 527373 markings, 1258889 edges, 7360 markings/sec, 65 secs
lola: sara is running 70 secs || 566389 markings, 1344885 edges, 7803 markings/sec, 70 secs
lola: sara is running 75 secs || 603274 markings, 1434154 edges, 7377 markings/sec, 75 secs
lola: sara is running 80 secs || 638544 markings, 1527327 edges, 7054 markings/sec, 80 secs
lola: sara is running 85 secs || 675975 markings, 1612134 edges, 7486 markings/sec, 85 secs
lola: sara is running 90 secs || 713950 markings, 1696803 edges, 7595 markings/sec, 90 secs
lola: sara is running 95 secs || 750276 markings, 1787565 edges, 7265 markings/sec, 95 secs
lola: sara is running 100 secs || 785314 markings, 1878579 edges, 7008 markings/sec, 100 secs
lola: sara is running 105 secs || 823185 markings, 1963086 edges, 7574 markings/sec, 105 secs
lola: sara is running 110 secs || 861031 markings, 2047783 edges, 7569 markings/sec, 110 secs
lola: sara is running 115 secs || 895663 markings, 2135362 edges, 6926 markings/sec, 115 secs
lola: sara is running 120 secs || 930792 markings, 2226699 edges, 7026 markings/sec, 120 secs
lola: sara is running 125 secs || 966964 markings, 2308352 edges, 7234 markings/sec, 125 secs
lola: sara is running 130 secs || 1004813 markings, 2392735 edges, 7570 markings/sec, 130 secs
lola: sara is running 135 secs || 1041241 markings, 2483824 edges, 7286 markings/sec, 135 secs
lola: sara is running 140 secs || 1076648 markings, 2575676 edges, 7081 markings/sec, 140 secs
lola: sara is running 145 secs || 1114762 markings, 2660261 edges, 7623 markings/sec, 145 secs
lola: sara is running 150 secs || 1147184 markings, 2758032 edges, 6484 markings/sec, 150 secs
lola: sara is running 155 secs || 1178442 markings, 2871820 edges, 6252 markings/sec, 155 secs
lola: sara is running 160 secs || 1209613 markings, 2986664 edges, 6234 markings/sec, 160 secs
lola: sara is running 165 secs || 1240829 markings, 3099513 edges, 6243 markings/sec, 165 secs
lola: sara is running 170 secs || 1271518 markings, 3211079 edges, 6138 markings/sec, 170 secs
lola: sara is running 175 secs || 1303079 markings, 3324203 edges, 6312 markings/sec, 175 secs
lola: sara is running 180 secs || 1334875 markings, 3439036 edges, 6359 markings/sec, 180 secs
lola: sara is running 185 secs || 1366582 markings, 3554051 edges, 6341 markings/sec, 185 secs
lola: sara is running 190 secs || 1398348 markings, 3670499 edges, 6353 markings/sec, 190 secs
lola: sara is running 195 secs || 1430015 markings, 3784037 edges, 6333 markings/sec, 195 secs
lola: sara is running 200 secs || 1461557 markings, 3899003 edges, 6308 markings/sec, 200 secs
lola: sara is running 205 secs || 1492573 markings, 4012067 edges, 6203 markings/sec, 205 secs
lola: sara is running 210 secs || 1523636 markings, 4119426 edges, 6213 markings/sec, 210 secs
lola: sara is running 215 secs || 1554349 markings, 4240759 edges, 6143 markings/sec, 215 secs
lola: sara is running 220 secs || 1580907 markings, 4361581 edges, 5312 markings/sec, 220 secs
lola: sara is running 225 secs || 1603942 markings, 4508131 edges, 4607 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t4683)))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t6637) OR FIREABLE(t1031) OR FIREABLE(t4004))))
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 808 bytes per marking, with 10 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 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 61 markings, 60 edges
lola: ========================================
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t2403) AND NOT FIREABLE(t946) AND FIREABLE(t2480) AND (FIREABLE(t845) OR FIREABLE(t7070) OR (FIREABLE(t6082) AND FIREABLE(t7199))) AND FIREABLE(t2196))))
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 808 bytes per marking, with 10 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 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-4.sara.
lola: sara is running 0 secs || 30997 markings, 59929 edges, 6199 markings/sec, 0 secs
lola: sara is running 5 secs || 63100 markings, 123176 edges, 6421 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 95232 markings, 185979 edges, 6426 markings/sec, 10 secs
lola: sara is running 15 secs || 125697 markings, 248611 edges, 6093 markings/sec, 15 secs

lola: sara is running 20 secs || 157903 markings, 311262 edges, 6441 markings/sec, 20 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1203) OR NOT FIREABLE(t4656))))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-5.sara.
lola: sara is running 0 secs || 32510 markings, 62439 edges, 6502 markings/sec, 0 secs
lola: sara is running 5 secs || 64882 markings, 126249 edges, 6474 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t7210) OR FIREABLE(t747) OR NOT FIREABLE(t7319) OR FIREABLE(t5474) OR NOT FIREABLE(t228) OR (((FIREABLE(t2037) AND FIREABLE(t2616)) OR (FIREABLE(t7204) AND FIREABLE(t4882))) AND FIREABLE(t1155)))))
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 808 bytes per marking, with 10 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 240 literals and 27 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-6.sara.
lola: sara is running 0 secs || 31325 markings, 60333 edges, 6265 markings/sec, 0 secs
lola: sara is running 5 secs || 63655 markings, 123833 edges, 6466 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 94755 markings, 186421 edges, 6220 markings/sec, 10 secs
lola: sara is running 15 secs || 126526 markings, 249877 edges, 6354 markings/sec, 15 secs
lola: sara is running 20 secs || 157922 markings, 310818 edges, 6279 markings/sec, 20 secs
lola: sara is running 25 secs || 190114 markings, 373959 edges, 6438 markings/sec, 25 secs
lola: sara is running 30 secs || 220640 markings, 436716 edges, 6105 markings/sec, 30 secs
lola: sara is running 35 secs || 252967 markings, 499520 edges, 6465 markings/sec, 35 secs
lola: sara is running 40 secs || 284482 markings, 561244 edges, 6303 markings/sec, 40 secs
lola: sara is running 45 secs || 316242 markings, 624133 edges, 6352 markings/sec, 45 secs
lola: sara is running 50 secs || 347322 markings, 687432 edges, 6216 markings/sec, 50 secs
lola: sara is running 55 secs || 379690 markings, 750316 edges, 6474 markings/sec, 55 secs
lola: sara is running 60 secs || 412010 markings, 813800 edges, 6464 markings/sec, 60 secs
lola: sara is running 65 secs || 443728 markings, 876691 edges, 6344 markings/sec, 65 secs
lola: sara is running 70 secs || 472129 markings, 950227 edges, 5680 markings/sec, 70 secs
lola: sara is running 75 secs || 497479 markings, 1033356 edges, 5070 markings/sec, 75 secs
lola: sara is running 80 secs || 526759 markings, 1097345 edges, 5856 markings/sec, 80 secs
lola: sara is running 85 secs || 550507 markings, 1193322 edges, 4750 markings/sec, 85 secs
lola: sara is running 90 secs || 573959 markings, 1295264 edges, 4690 markings/sec, 90 secs
lola: sara is running 95 secs || 597424 markings, 1397268 edges, 4693 markings/sec, 95 secs
lola: sara is running 100 secs || 620794 markings, 1500405 edges, 4674 markings/sec, 100 secs
lola: sara is running 105 secs || 644448 markings, 1601942 edges, 4731 markings/sec, 105 secs
lola: sara is running 110 secs || 668090 markings, 1704908 edges, 4728 markings/sec, 110 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 7 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t2146) AND FIREABLE(t1690) AND (FIREABLE(t1995) OR FIREABLE(t3146)) AND NOT FIREABLE(t5286) AND NOT FIREABLE(t22)) OR FIREABLE(t4759))))
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 808 bytes per marking, with 10 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 11 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 48 markings, 47 edges
lola: ========================================
lola: subprocess 8 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t928)))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-8.sara.
lola: sara is running 0 secs || 30926 markings, 59777 edges, 6185 markings/sec, 0 secs
lola: sara is running 5 secs || 62501 markings, 121936 edges, 6315 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 93274 markings, 183077 edges, 6155 markings/sec, 10 secs
lola: sara is running 15 secs || 124093 markings, 244410 edges, 6164 markings/sec, 15 secs
lola: sara is running 20 secs || 153719 markings, 314301 edges, 5925 markings/sec, 20 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 443 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((FIREABLE(t6500) AND FIREABLE(t5378)) OR FIREABLE(t3835)) AND (NOT FIREABLE(t7088) OR (FIREABLE(t5290) AND FIREABLE(t5222)))) OR FIREABLE(t1383))))
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 808 bytes per marking, with 10 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 9 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 62 markings, 61 edges
lola: ========================================
lola: subprocess 10 will run for 517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t6969) AND FIREABLE(t250))))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-10.sara.
lola: sara is running 0 secs || 31819 markings, 61671 edges, 6364 markings/sec, 0 secs
lola: sara is running 5 secs || 64478 markings, 125959 edges, 6532 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 97155 markings, 190318 edges, 6535 markings/sec, 10 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 617 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t6427) AND NOT FIREABLE(t6041) AND FIREABLE(t7321) AND FIREABLE(t5595))))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-11.sara.
lola: sara is running 0 secs || 32124 markings, 62339 edges, 6425 markings/sec, 0 secs
lola: sara is running 5 secs || 63751 markings, 124581 edges, 6325 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 96242 markings, 188665 edges, 6498 markings/sec, 10 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 767 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t4957) OR FIREABLE(t4254)) AND FIREABLE(t5080))))
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 808 bytes per marking, with 10 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 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-12.sara.
lola: sara is running 0 secs || 32648 markings, 63507 edges, 6530 markings/sec, 0 secs
lola: sara is running 5 secs || 65329 markings, 127902 edges, 6536 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 97278 markings, 190644 edges, 6390 markings/sec, 10 secs

lola: sara is running 15 secs || 128954 markings, 254083 edges, 6335 markings/sec, 15 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1016 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t6686)))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 42 markings, 41 edges
lola: ========================================
lola: subprocess 14 will run for 1524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1112) OR FIREABLE(t1709) OR (FIREABLE(t6154) AND FIREABLE(t1097)) OR (NOT FIREABLE(t4636) AND NOT FIREABLE(t6457)) OR (FIREABLE(t603) AND (FIREABLE(t1462) OR FIREABLE(t1855)) AND FIREABLE(t5693)))))
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 808 bytes per marking, with 10 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 70 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 69 markings, 68 edges
lola: ========================================
lola: subprocess 15 will run for 3048 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t3335) AND FIREABLE(t2952) AND (NOT FIREABLE(t4466) OR NOT FIREABLE(t6385) OR NOT FIREABLE(t6018) OR NOT FIREABLE(t903)))))
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 808 bytes per marking, with 10 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 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 47 markings, 46 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown yes yes no no yes yes yes yes no yes yes yes no yes
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-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 stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-22b"
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/FlexibleBarrier-PT-22b.tgz
mv FlexibleBarrier-PT-22b 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 FlexibleBarrier-PT-22b, 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 r094-blw7-152650006300238"
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 ;