fond

jQuery Multi Level CSS Menu Css3Menu.com

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

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

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1581.730 466016.00 851496.00 198.20 FTTTF?TTTFFFTTTF 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 1.4M
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K 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 7.3K 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 15K 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.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.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.2M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is FlexibleBarrier-PT-18b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-blw7-152650006200210
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527514198845


BK_STOP 1527514664861

--------------------
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-18b 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': 352438, 'Memory': 2912.1, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola FlexibleBarrier-PT-18b...

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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-18b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ FlexibleBarrier-PT-18b @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 9407/65536 symbol table entries, 2286 collisions
lola: preprocessing...
lola: finding significant places
lola: 4370 places, 5037 transitions, 4350 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5075 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-18b-ReachabilityFireability.task
lola: E (F (((NOT FIREABLE(t1628) OR NOT FIREABLE(t1789)) AND NOT FIREABLE(t861) AND FIREABLE(t3485) AND (FIREABLE(t4828) OR FIREABLE(t3397))))) : E (F ((FIREABLE(t4293) AND FIREABLE(t2533) AND (FIREABLE(t1573) OR FIREABLE(t1778)) AND (FIREABLE(t3895) OR (FIREABLE(t650) AND FIREABLE(t1403))) AND FIREABLE(t1099)))) : E (F ((FIREABLE(t4198) OR (FIREABLE(t1626) AND (NOT FIREABLE(t2319) OR FIREABLE(t917)))))) : E (F (FIREABLE(t4922))) : A (G ((NOT FIREABLE(t2857) OR NOT FIREABLE(t4130) OR NOT FIREABLE(t1898) OR FIREABLE(t1510)))) : E (F ((FIREABLE(t2422) AND FIREABLE(t3586) AND (FIREABLE(t591) OR FIREABLE(t1944)) AND (FIREABLE(t1041) OR FIREABLE(t2170) OR (FIREABLE(t1945) AND FIREABLE(t2764))) AND (NOT FIREABLE(t2597) OR NOT FIREABLE(t179) OR NOT FIREABLE(t3158) OR NOT FIREABLE(t1045))))) : E (F (FIREABLE(t3719))) : E (F (FIREABLE(t4418))) : E (F ((NOT FIREABLE(t1255) AND FIREABLE(t1703) AND FIREABLE(t3352) AND FIREABLE(t814) AND (NOT FIREABLE(t4131) OR NOT FIREABLE(t865))))) : A (G ((((FIREABLE(t132) OR FIREABLE(t5005) OR (FIREABLE(t127) AND FIREABLE(t4015))) AND FIREABLE(t2660)) OR NOT FIREABLE(t3139)))) : A (G (((NOT FIREABLE(t2483) OR NOT FIREABLE(t1900) OR (NOT FIREABLE(t3402) AND NOT FIREABLE(t657))) AND NOT FIREABLE(t363)))) : A (G (NOT FIREABLE(t2686))) : E (F (FIREABLE(t772))) : E (F ((FIREABLE(t3663) OR (NOT FIREABLE(t4229) AND NOT FIREABLE(t4256) AND (FIREABLE(t2989) OR FIREABLE(t160) OR (FIREABLE(t4066) AND FIREABLE(t3744))))))) : E (F (FIREABLE(t1927))) : A (G ((FIREABLE(t1498) OR FIREABLE(t2153) OR (FIREABLE(t1703) AND FIREABLE(t524)) OR (FIREABLE(t4195) AND NOT FIREABLE(t1763)) OR NOT FIREABLE(t4635))))
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 (((NOT FIREABLE(t1628) OR NOT FIREABLE(t1789)) AND NOT FIREABLE(t861) AND FIREABLE(t3485) AND (FIREABLE(t4828) OR FIREABLE(t3397)))))
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 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 53065 markings, 96177 edges, 10613 markings/sec, 0 secs
lola: sara is running 5 secs || 105870 markings, 193679 edges, 10561 markings/sec, 5 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 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t4293) AND FIREABLE(t2533) AND (FIREABLE(t1573) OR FIREABLE(t1778)) AND (FIREABLE(t3895) OR (FIREABLE(t650) AND FIREABLE(t1403))) AND FIREABLE(t1099))))
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 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 22 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 48934 markings, 95298 edges, 9787 markings/sec, 0 secs
lola: sara is running 5 secs || 98596 markings, 194393 edges, 9932 markings/sec, 5 secs

lola: sara is running 10 secs || 148683 markings, 292750 edges, 10017 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 2 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t4198) OR (FIREABLE(t1626) AND (NOT FIREABLE(t2319) OR FIREABLE(t917))))))
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 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 61 markings, 60 edges
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t4922)))
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 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-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 292 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t2857) OR NOT FIREABLE(t4130) OR NOT FIREABLE(t1898) OR FIREABLE(t1510))))
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 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 51945 markings, 94865 edges, 10389 markings/sec, 0 secs
lola: sara is running 5 secs || 105119 markings, 192212 edges, 10635 markings/sec, 5 secs
lola: sara is running 10 secs || 157592 markings, 289457 edges, 10495 markings/sec, 10 secs
lola: sara is running 15 secs || 210062 markings, 386536 edges, 10494 markings/sec, 15 secs
lola: sara is running 20 secs || 261705 markings, 482022 edges, 10329 markings/sec, 20 secs
lola: sara is running 25 secs || 303747 markings, 616895 edges, 8408 markings/sec, 25 secs
lola: sara is running 30 secs || 344419 markings, 762000 edges, 8134 markings/sec, 30 secs
sara: warning, failure of lp_solve (at job 79)
lola: sara is running 35 secs || 384021 markings, 910379 edges, 7920 markings/sec, 35 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2422) AND FIREABLE(t3586) AND (FIREABLE(t591) OR FIREABLE(t1944)) AND (FIREABLE(t1041) OR FIREABLE(t2170) OR (FIREABLE(t1945) AND FIREABLE(t2764))) AND (NOT FIREABLE(t2597) OR NOT FIREABLE(t179) OR NOT FIREABLE(t3158) OR NOT FIREABLE(t1045)))))
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 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 128 literals and 24 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 49699 markings, 97090 edges, 9940 markings/sec, 0 secs
lola: sara is running 5 secs || 99665 markings, 200312 edges, 9993 markings/sec, 5 secs
lola: sara is running 10 secs || 149766 markings, 304459 edges, 10020 markings/sec, 10 secs
lola: sara is running 15 secs || 200231 markings, 404760 edges, 10093 markings/sec, 15 secs
lola: sara is running 20 secs || 250203 markings, 502665 edges, 9994 markings/sec, 20 secs
lola: sara is running 25 secs || 296044 markings, 620838 edges, 9168 markings/sec, 25 secs
lola: sara is running 30 secs || 336474 markings, 765886 edges, 8086 markings/sec, 30 secs
lola: sara is running 35 secs || 377055 markings, 911706 edges, 8116 markings/sec, 35 secs
lola: sara is running 40 secs || 415879 markings, 1040244 edges, 7765 markings/sec, 40 secs
lola: sara is running 45 secs || 452306 markings, 1203647 edges, 7285 markings/sec, 45 secs
lola: sara is running 50 secs || 486345 markings, 1374957 edges, 6808 markings/sec, 50 secs
lola: sara is running 55 secs || 525995 markings, 1501375 edges, 7930 markings/sec, 55 secs
lola: sara is running 60 secs || 574711 markings, 1607106 edges, 9743 markings/sec, 60 secs
lola: sara is running 65 secs || 623902 markings, 1705003 edges, 9838 markings/sec, 65 secs
lola: sara is running 70 secs || 673195 markings, 1811529 edges, 9859 markings/sec, 70 secs
lola: sara is running 75 secs || 724186 markings, 1912046 edges, 10198 markings/sec, 75 secs
lola: sara is running 80 secs || 775534 markings, 2013365 edges, 10270 markings/sec, 80 secs
lola: sara is running 85 secs || 823852 markings, 2124737 edges, 9664 markings/sec, 85 secs
lola: sara is running 90 secs || 864865 markings, 2271479 edges, 8203 markings/sec, 90 secs
lola: sara is running 95 secs || 906026 markings, 2419685 edges, 8232 markings/sec, 95 secs
lola: sara is running 100 secs || 946103 markings, 2550571 edges, 8015 markings/sec, 100 secs
lola: sara is running 105 secs || 983015 markings, 2714240 edges, 7382 markings/sec, 105 secs
lola: sara is running 110 secs || 1018038 markings, 2892399 edges, 7005 markings/sec, 110 secs
lola: sara is running 115 secs || 1057676 markings, 3021253 edges, 7928 markings/sec, 115 secs
lola: sara is running 120 secs || 1105195 markings, 3129400 edges, 9504 markings/sec, 120 secs
lola: sara is running 125 secs || 1155096 markings, 3227121 edges, 9980 markings/sec, 125 secs
lola: sara is running 130 secs || 1204496 markings, 3333303 edges, 9880 markings/sec, 130 secs
lola: sara is running 135 secs || 1254354 markings, 3433734 edges, 9972 markings/sec, 135 secs
lola: sara is running 140 secs || 1305737 markings, 3535041 edges, 10277 markings/sec, 140 secs
lola: sara is running 145 secs || 1355701 markings, 3642606 edges, 9993 markings/sec, 145 secs
lola: sara is running 150 secs || 1396755 markings, 3789650 edges, 8211 markings/sec, 150 secs
lola: sara is running 155 secs || 1438122 markings, 3938202 edges, 8273 markings/sec, 155 secs
lola: sara is running 160 secs || 1478640 markings, 4068998 edges, 8104 markings/sec, 160 secs
lola: sara is running 165 secs || 1515630 markings, 4232524 edges, 7398 markings/sec, 165 secs
lola: sara is running 170 secs || 1550746 markings, 4407546 edges, 7023 markings/sec, 170 secs
lola: sara is running 175 secs || 1589718 markings, 4542309 edges, 7794 markings/sec, 175 secs
lola: sara is running 180 secs || 1637082 markings, 4652185 edges, 9473 markings/sec, 180 secs
lola: sara is running 185 secs || 1687143 markings, 4750405 edges, 10012 markings/sec, 185 secs
lola: sara is running 190 secs || 1735473 markings, 4856430 edges, 9666 markings/sec, 190 secs
lola: sara is running 195 secs || 1786408 markings, 4956832 edges, 10187 markings/sec, 195 secs
lola: sara is running 200 secs || 1837729 markings, 5058077 edges, 10264 markings/sec, 200 secs
lola: sara is running 205 secs || 1887919 markings, 5162001 edges, 10038 markings/sec, 205 secs
lola: sara is running 210 secs || 1928837 markings, 5308638 edges, 8184 markings/sec, 210 secs
lola: sara is running 215 secs || 1970093 markings, 5456690 edges, 8251 markings/sec, 215 secs
lola: sara is running 220 secs || 2010904 markings, 5585212 edges, 8162 markings/sec, 220 secs
lola: sara is running 225 secs || 2047777 markings, 5747583 edges, 7375 markings/sec, 225 secs
lola: sara is running 230 secs || 2083401 markings, 5921274 edges, 7125 markings/sec, 230 secs
lola: sara is running 235 secs || 2121671 markings, 6061827 edges, 7654 markings/sec, 235 secs
lola: sara is running 240 secs || 2168812 markings, 6176198 edges, 9428 markings/sec, 240 secs
lola: sara is running 245 secs || 2219742 markings, 6277665 edges, 10186 markings/sec, 245 secs
lola: sara is running 250 secs || 2270439 markings, 6386316 edges, 10139 markings/sec, 250 secs
lola: sara is running 255 secs || 2321985 markings, 6488064 edges, 10309 markings/sec, 255 secs
lola: sara is running 260 secs || 2373553 markings, 6589845 edges, 10314 markings/sec, 260 secs
lola: sara is running 265 secs || 2423668 markings, 6694498 edges, 10023 markings/sec, 265 secs
lola: sara is running 270 secs || 2464766 markings, 6841291 edges, 8220 markings/sec, 270 secs
lola: sara is running 275 secs || 2505924 markings, 6989103 edges, 8232 markings/sec, 275 secs
lola: sara is running 280 secs || 2546808 markings, 7117668 edges, 8177 markings/sec, 280 secs
lola: sara is running 285 secs || 2583530 markings, 7281248 edges, 7344 markings/sec, 285 secs
lola: sara is running 290 secs || 2619226 markings, 7454152 edges, 7139 markings/sec, 290 secs
lola: sara is running 295 secs || 2657558 markings, 7594194 edges, 7666 markings/sec, 295 secs
lola: sara is running 300 secs || 2704997 markings, 7707917 edges, 9488 markings/sec, 300 secs
lola: sara is running 305 secs || 2755374 markings, 7808971 edges, 10075 markings/sec, 305 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t3719)))
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 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 53 markings, 52 edges
lola: ========================================
lola: subprocess 7 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t4418)))
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 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 8 will run for 394 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t1255) AND FIREABLE(t1703) AND FIREABLE(t3352) AND FIREABLE(t814) AND (NOT FIREABLE(t4131) OR NOT FIREABLE(t865)))))
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 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 58 markings, 57 edges
lola: ========================================
lola: subprocess 9 will run for 450 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(t132) OR FIREABLE(t5005) OR (FIREABLE(t127) AND FIREABLE(t4015))) AND FIREABLE(t2660)) OR NOT FIREABLE(t3139))))
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 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 39 markings, 38 edges
lola: ========================================
lola: subprocess 10 will run for 526 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t2483) OR NOT FIREABLE(t1900) OR (NOT FIREABLE(t3402) AND NOT FIREABLE(t657))) AND NOT FIREABLE(t363))))
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 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 11 will run for 631 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t2686)))
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 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 12 will run for 789 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t772)))
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 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40 markings, 39 edges
lola: ========================================
lola: subprocess 13 will run for 1052 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t3663) OR (NOT FIREABLE(t4229) AND NOT FIREABLE(t4256) AND (FIREABLE(t2989) OR FIREABLE(t160) OR (FIREABLE(t4066) AND FIREABLE(t3744)))))))
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 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 11 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 50964 markings, 99878 edges, 10193 markings/sec, 0 secs
lola: sara is running 5 secs || 102168 markings, 200940 edges, 10241 markings/sec, 5 secs
lola: sara is running 10 secs || 153445 markings, 301793 edges, 10255 markings/sec, 10 secs
lola: sara is running 15 secs || 203901 markings, 402476 edges, 10091 markings/sec, 15 secs
lola: sara is running 20 secs || 254809 markings, 502786 edges, 10182 markings/sec, 20 secs
lola: sara is running 25 secs || 298206 markings, 634150 edges, 8679 markings/sec, 25 secs
lola: sara is running 30 secs || 341772 markings, 766952 edges, 8713 markings/sec, 30 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1558 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1927)))
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 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 15 will run for 3117 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1498) OR FIREABLE(t2153) OR (FIREABLE(t1703) AND FIREABLE(t524)) OR (FIREABLE(t4195) AND NOT FIREABLE(t1763)) OR NOT FIREABLE(t4635))))
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 544 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 28 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 45 markings, 44 edges
lola: RESULT
lola:
SUMMARY: no yes yes yes no unknown yes yes yes no no no yes yes yes no
lola: ========================================
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

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