fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r188-blw3-149581034400142
Last Updated
June 27, 2017

About the Execution of LoLA for FlexibleBarrier-PT-18b

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1455.550 669717.00 1339080.00 282.60 FTFTFFFTTTFFT?TF 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)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is FlexibleBarrier-PT-18b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-blw3-149581034400142
=====================================================================

--------------------
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-ReachabilityCardinality-0
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-1
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-10
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-11
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-12
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-13
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-14
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-15
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-2
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-3
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-4
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-5
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-6
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-7
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-8
FORMULA_NAME FlexibleBarrier-PT-18b-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1496496033850


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ FlexibleBarrier-PT-18b @ 3539 seconds
----- 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: 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-ReachabilityCardinality.task
lola: A (G (((p3548 <= p168) OR (p521 <= p205) OR (1 <= p3205) OR (p2672 <= p909)))) : E (F ((p2174 + 1 <= p3094))) : A (G ((p3347 <= 1))) : A (G ((p1055 <= 2))) : E (F ((3 <= p2964))) : A (G ((p3159 <= p3844))) : E (F ((1 <= p3048))) : A (G ((((p340 <= p3332) AND (p2998 <= p1845) AND (p2649 <= 2)) OR ((p3557 <= 2) AND (p3499 + 1 <= p2565))))) : E (F ((p1429 + 1 <= p4320))) : A (G ((p727 <= p2381))) : A (G (((p2583 + 1 <= p12) OR (p3968 <= 0) OR (3 <= p699)))) : E (F (((p2871 <= p2158) AND (1 <= p453)))) : A (G ((((p429 <= p2057) AND (p1026 <= p3498) AND (p2194 <= p1305)) OR ((p2529 <= p729) AND (3 <= p2076))))) : E (F (((p4134 <= p2549) AND (p703 <= 2) AND (3 <= p1266) AND (p1528 <= p1225) AND (1 <= p2170)))) : E (F (((2 <= p3144) OR (2 <= p2170)))) : A (G (((p4126 <= 1) OR (p3143 + 1 <= p4270) OR (3 <= p3818))))
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 (((p3548 <= p168) OR (p521 <= p205) OR (1 <= p3205) OR (p2672 <= p909))))
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-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 41850 markings, 83138 edges, 8370 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 83670 markings, 168996 edges, 8364 markings/sec, 5 secs
lola: sara is running 10 secs || 125734 markings, 256953 edges, 8413 markings/sec, 10 secs
lola: sara is running 15 secs || 164405 markings, 378953 edges, 7734 markings/sec, 15 secs
lola: sara is running 20 secs || 200605 markings, 523391 edges, 7240 markings/sec, 20 secs
lola: sara is running 25 secs || 232439 markings, 688112 edges, 6367 markings/sec, 25 secs

lola: sara is running 30 secs || 270891 markings, 790281 edges, 7690 markings/sec, 30 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 1 will run for 233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p2174 + 1 <= p3094)))
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-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 250 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p3347 <= 1)))
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-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 44030 markings, 86377 edges, 8806 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: subprocess 3 will run for 269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1055 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
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-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 43654 markings, 85418 edges, 8731 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 290 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p2964)))
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-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 43823 markings, 80673 edges, 8765 markings/sec, 0 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 316 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p3159 <= p3844)))
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-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 40566 markings, 103340 edges, 8113 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 80651 markings, 208595 edges, 8017 markings/sec, 5 secs
lola: sara is running 10 secs || 119527 markings, 316813 edges, 7775 markings/sec, 10 secs
lola: sara is running 15 secs || 158912 markings, 423006 edges, 7877 markings/sec, 15 secs
lola: sara is running 20 secs || 198979 markings, 524041 edges, 8013 markings/sec, 20 secs
lola: sara is running 25 secs || 237979 markings, 631953 edges, 7800 markings/sec, 25 secs
lola: sara is running 30 secs || 276960 markings, 740118 edges, 7796 markings/sec, 30 secs
lola: sara is running 35 secs || 317363 markings, 842834 edges, 8081 markings/sec, 35 secs
lola: sara is running 40 secs || 356768 markings, 947642 edges, 7881 markings/sec, 40 secs
lola: sara is running 45 secs || 395783 markings, 1056124 edges, 7803 markings/sec, 45 secs
lola: sara is running 50 secs || 430623 markings, 1144201 edges, 6968 markings/sec, 50 secs
lola: sara is running 55 secs || 470562 markings, 1254484 edges, 7988 markings/sec, 55 secs
lola: sara is running 60 secs || 507794 markings, 1378245 edges, 7446 markings/sec, 60 secs
lola: sara is running 65 secs || 540967 markings, 1528331 edges, 6635 markings/sec, 65 secs
lola: sara is running 70 secs || 574126 markings, 1679666 edges, 6632 markings/sec, 70 secs
lola: sara is running 75 secs || 607373 markings, 1829031 edges, 6649 markings/sec, 75 secs
lola: sara is running 80 secs || 639954 markings, 1976985 edges, 6516 markings/sec, 80 secs
lola: sara is running 85 secs || 671126 markings, 2133994 edges, 6234 markings/sec, 85 secs
lola: sara is running 90 secs || 699930 markings, 2308839 edges, 5761 markings/sec, 90 secs
lola: sara is running 95 secs || 728486 markings, 2474820 edges, 5711 markings/sec, 95 secs
lola: sara is running 100 secs || 754892 markings, 2654657 edges, 5281 markings/sec, 100 secs
lola: sara is running 105 secs || 783824 markings, 2815384 edges, 5786 markings/sec, 105 secs
lola: sara is running 110 secs || 819693 markings, 2930966 edges, 7174 markings/sec, 110 secs
sara: warning, failure of lp_solve (at job 218)
lola: sara is running 115 secs || 859822 markings, 3038168 edges, 8026 markings/sec, 115 secs
lola: sara is running 120 secs || 900786 markings, 3141913 edges, 8193 markings/sec, 120 secs
lola: sara is running 125 secs || 941798 markings, 3245804 edges, 8202 markings/sec, 125 secs
lola: sara is running 130 secs || 982072 markings, 3352891 edges, 8055 markings/sec, 130 secs
lola: sara is running 135 secs || 1022336 markings, 3459498 edges, 8053 markings/sec, 135 secs
lola: sara is running 140 secs || 1062777 markings, 3562356 edges, 8088 markings/sec, 140 secs
lola: sara is running 145 secs || 1103924 markings, 3666412 edges, 8229 markings/sec, 145 secs
lola: sara is running 150 secs || 1137392 markings, 3798952 edges, 6694 markings/sec, 150 secs
lola: sara is running 155 secs || 1171145 markings, 3932802 edges, 6751 markings/sec, 155 secs
lola: sara is running 160 secs || 1205101 markings, 4068016 edges, 6791 markings/sec, 160 secs
lola: sara is running 165 secs || 1237165 markings, 4206955 edges, 6413 markings/sec, 165 secs
lola: sara is running 170 secs || 1266682 markings, 4371342 edges, 5903 markings/sec, 170 secs
lola: sara is running 175 secs || 1295139 markings, 4529705 edges, 5691 markings/sec, 175 secs
lola: sara is running 180 secs || 1322720 markings, 4702706 edges, 5516 markings/sec, 180 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 6 will run for 329 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p3048)))
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-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 45551 markings, 81532 edges, 9110 markings/sec, 0 secs
lola: sara is running 5 secs || 89789 markings, 162575 edges, 8848 markings/sec, 5 secs
lola: sara is running 10 secs || 134038 markings, 243622 edges, 8850 markings/sec, 10 secs
lola: sara is running 15 secs || 178764 markings, 325122 edges, 8945 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 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p340 <= p3332) AND (p2998 <= p1845) AND (p2649 <= 2)) OR ((p3557 <= 2) AND (p3499 + 1 <= p2565)))))
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 12 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 46399 markings, 83972 edges, 9280 markings/sec, 0 secs
lola: sara is running 5 secs || 90994 markings, 166803 edges, 8919 markings/sec, 5 secs
lola: sara is running 10 secs || 137319 markings, 251704 edges, 9265 markings/sec, 10 secs
lola: sara is running 15 secs || 182741 markings, 335791 edges, 9084 markings/sec, 15 secs
lola: sara is running 20 secs || 227231 markings, 418303 edges, 8898 markings/sec, 20 secs
lola: sara is running 25 secs || 272414 markings, 505072 edges, 9037 markings/sec, 25 secs
lola: sara is running 30 secs || 308177 markings, 632742 edges, 7153 markings/sec, 30 secs
lola: sara is running 35 secs || 344170 markings, 761187 edges, 7199 markings/sec, 35 secs
lola: sara is running 40 secs || 380163 markings, 889378 edges, 7199 markings/sec, 40 secs
lola: sara is running 45 secs || 414472 markings, 1011914 edges, 6862 markings/sec, 45 secs
lola: sara is running 50 secs || 447982 markings, 1146310 edges, 6702 markings/sec, 50 secs
lola: sara is running 55 secs || 481971 markings, 1279855 edges, 6798 markings/sec, 55 secs
lola: sara is running 60 secs || 515904 markings, 1397249 edges, 6787 markings/sec, 60 secs
lola: sara is running 65 secs || 558995 markings, 1481832 edges, 8618 markings/sec, 65 secs
lola: sara is running 70 secs || 603432 markings, 1564200 edges, 8887 markings/sec, 70 secs
lola: sara is running 75 secs || 648770 markings, 1647727 edges, 9068 markings/sec, 75 secs
lola: sara is running 80 secs || 687940 markings, 1720089 edges, 7834 markings/sec, 80 secs
lola: sara is running 85 secs || 734080 markings, 1804497 edges, 9228 markings/sec, 85 secs
lola: sara is running 90 secs || 779254 markings, 1888117 edges, 9035 markings/sec, 90 secs
lola: sara is running 95 secs || 816627 markings, 2001539 edges, 7475 markings/sec, 95 secs
lola: sara is running 100 secs || 852592 markings, 2129843 edges, 7193 markings/sec, 100 secs
lola: sara is running 105 secs || 888540 markings, 2258279 edges, 7190 markings/sec, 105 secs
lola: sara is running 110 secs || 922333 markings, 2387934 edges, 6759 markings/sec, 110 secs
lola: sara is running 115 secs || 956524 markings, 2509409 edges, 6838 markings/sec, 115 secs
lola: sara is running 120 secs || 990110 markings, 2647680 edges, 6717 markings/sec, 120 secs
lola: sara is running 125 secs || 1023547 markings, 2773308 edges, 6687 markings/sec, 125 secs
lola: sara is running 130 secs || 1063587 markings, 2864854 edges, 8008 markings/sec, 130 secs
lola: sara is running 135 secs || 1107752 markings, 2946690 edges, 8833 markings/sec, 135 secs
lola: sara is running 140 secs || 1153247 markings, 3029735 edges, 9099 markings/sec, 140 secs
lola: sara is running 145 secs || 1199057 markings, 3114737 edges, 9162 markings/sec, 145 secs
lola: sara is running 150 secs || 1243772 markings, 3197814 edges, 8943 markings/sec, 150 secs
lola: sara is running 155 secs || 1289756 markings, 3281558 edges, 9197 markings/sec, 155 secs
lola: sara is running 160 secs || 1324021 markings, 3366872 edges, 6853 markings/sec, 160 secs
lola: sara is running 165 secs || 1359774 markings, 3494515 edges, 7151 markings/sec, 165 secs
lola: sara is running 170 secs || 1394765 markings, 3619676 edges, 6998 markings/sec, 170 secs
lola: sara is running 175 secs || 1429081 markings, 3754238 edges, 6863 markings/sec, 175 secs
lola: sara is running 180 secs || 1464070 markings, 3867089 edges, 6998 markings/sec, 180 secs
lola: sara is running 185 secs || 1497614 markings, 4005884 edges, 6709 markings/sec, 185 secs
lola: sara is running 190 secs || 1531116 markings, 4142704 edges, 6700 markings/sec, 190 secs
sara: warning, failure of lp_solve (at job 343)
lola: sara is running 195 secs || 1567420 markings, 4246374 edges, 7261 markings/sec, 195 secs
lola: sara is running 200 secs || 1610792 markings, 4326601 edges, 8674 markings/sec, 200 secs
lola: sara is running 205 secs || 1655615 markings, 4409489 edges, 8965 markings/sec, 205 secs
lola: sara is running 210 secs || 1701262 markings, 4492742 edges, 9129 markings/sec, 210 secs
lola: sara is running 215 secs || 1745720 markings, 4575336 edges, 8892 markings/sec, 215 secs
lola: sara is running 220 secs || 1790124 markings, 4658139 edges, 8881 markings/sec, 220 secs
lola: sara is running 225 secs || 1833951 markings, 4741493 edges, 8765 markings/sec, 225 secs
lola: sara is running 230 secs || 1869152 markings, 4867190 edges, 7040 markings/sec, 230 secs
lola: sara is running 235 secs || 1904499 markings, 4992853 edges, 7069 markings/sec, 235 secs
lola: sara is running 240 secs || 1939329 markings, 5117436 edges, 6966 markings/sec, 240 secs
lola: sara is running 245 secs || 1972251 markings, 5236583 edges, 6584 markings/sec, 245 secs
lola: sara is running 250 secs || 2004720 markings, 5363201 edges, 6494 markings/sec, 250 secs
lola: sara is running 255 secs || 2037490 markings, 5497256 edges, 6554 markings/sec, 255 secs
lola: sara is running 260 secs || 2070184 markings, 5613387 edges, 6539 markings/sec, 260 secs
lola: sara is running 265 secs || 2111068 markings, 5700785 edges, 8177 markings/sec, 265 secs
lola: sara is running 270 secs || 2154359 markings, 5780726 edges, 8658 markings/sec, 270 secs
lola: sara is running 275 secs || 2198401 markings, 5862412 edges, 8808 markings/sec, 275 secs
lola: sara is running 280 secs || 2242192 markings, 5943512 edges, 8758 markings/sec, 280 secs
lola: sara is running 285 secs || 2287557 markings, 6026239 edges, 9073 markings/sec, 285 secs
lola: sara is running 290 secs || 2332136 markings, 6108729 edges, 8916 markings/sec, 290 secs
lola: sara is running 295 secs || 2370423 markings, 6210697 edges, 7657 markings/sec, 295 secs
lola: sara is running 300 secs || 2405563 markings, 6335901 edges, 7028 markings/sec, 300 secs
lola: sara is running 305 secs || 2440854 markings, 6461419 edges, 7058 markings/sec, 305 secs
lola: sara is running 310 secs || 2473912 markings, 6594165 edges, 6612 markings/sec, 310 secs
lola: sara is running 315 secs || 2507643 markings, 6703510 edges, 6746 markings/sec, 315 secs
lola: sara is running 320 secs || 2535391 markings, 6816739 edges, 5550 markings/sec, 320 secs
lola: sara is running 325 secs || 2568164 markings, 6943390 edges, 6555 markings/sec, 325 secs
lola: sara is running 330 secs || 2602149 markings, 7058710 edges, 6797 markings/sec, 330 secs
lola: sara is running 335 secs || 2646162 markings, 7140717 edges, 8803 markings/sec, 335 secs
lola: sara is running 340 secs || 2690523 markings, 7221427 edges, 8872 markings/sec, 340 secs
lola: sara is running 345 secs || 2734169 markings, 7302375 edges, 8729 markings/sec, 345 secs
lola: sara is running 350 secs || 2778266 markings, 7384132 edges, 8819 markings/sec, 350 secs
lola: sara is running 355 secs || 2822667 markings, 7466827 edges, 8880 markings/sec, 355 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p1429 + 1 <= p4320)))
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-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 9 will run for 415 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p727 <= p2381)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
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-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 43803 markings, 85731 edges, 8761 markings/sec, 0 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 10 will run for 482 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2583 + 1 <= p12) OR (p3968 <= 0) OR (3 <= p699))))
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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 579 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p2871 <= p2158) AND (1 <= p453))))
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-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 724 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p429 <= p2057) AND (p1026 <= p3498) AND (p2194 <= p1305)) OR ((p2529 <= p729) AND (3 <= p2076)))))
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 12 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 965 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p4134 <= p2549) AND (p703 <= 2) AND (3 <= p1266) AND (p1528 <= p1225) AND (1 <= p2170))))
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 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 44183 markings, 86747 edges, 8837 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1444 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p3144) OR (2 <= p2170))))
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 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 43813 markings, 85676 edges, 8763 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 5 secs || 85640 markings, 180034 edges, 8365 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 15 will run for 2878 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p4126 <= 1) OR (p3143 + 1 <= p4270) OR (3 <= p3818))))
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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 43636 markings, 85398 edges, 8727 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes no no yes unknown yes no no yes no no no yes
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496496703567

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="ReachabilityCardinality"
export BK_TOOL="lola"
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

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is FlexibleBarrier-PT-18b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r188-blw3-149581034400142"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;