About the Execution of Irma.full for PhaseVariation-PT-D30CS010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1250.750 | 1370956.00 | 2679611.00 | 212.70 | FFFFFFFFFFFTFTFT | 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 30M
-rw-r--r-- 1 mcc users 4.4K 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 4.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.5K 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.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 30M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PhaseVariation-PT-D30CS010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-csrt-152666473000656
=====================================================================
--------------------
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 PhaseVariation-PT-D30CS010-ReachabilityCardinality-00
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityCardinality-01
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityCardinality-02
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityCardinality-03
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityCardinality-04
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityCardinality-05
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityCardinality-06
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityCardinality-07
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityCardinality-08
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityCardinality-09
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityCardinality-10
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityCardinality-11
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityCardinality-12
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityCardinality-13
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityCardinality-14
FORMULA_NAME PhaseVariation-PT-D30CS010-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1527144429308
BK_STOP 1527145800264
--------------------
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 PhaseVariation-PT-D30CS010 as instance name.
Using PhaseVariation as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, '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': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 1649872, 'Memory': 1124.14, 'Tool': 'lola'}, {'Time': 1851335, 'Memory': 1097.37, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'gspn'}].
ReachabilityCardinality lola PhaseVariation-PT-D30CS010...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
PhaseVariation-PT-D30CS010: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
PhaseVariation-PT-D30CS010: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ PhaseVariation-PT-D30CS010 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 33679/65536 symbol table entries, 10484 collisions
lola: preprocessing...
lola: finding significant places
lola: 2702 places, 30977 transitions, 1801 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2 transition conflict sets
lola: TASK
lola: reading formula from PhaseVariation-PT-D30CS010-ReachabilityCardinality.task
lola: A (G ((cell___29_16__A_ <= pool__25_1_))) : A (G ((((cell___30_27__B_ + 1 <= pool__25_1_) AND (cell___17_7__B_ <= 2)) OR (cell___30_17__B_ <= cell___27_14__A_)))) : A (G ((cell___9_29__A_ <= cell___4_5__A_))) : E (F (((2 <= cell___12_26__A_) AND (3 <= pool__12_12_)))) : A (G (((cell___13_7__A_ <= cell___30_14__A_) OR (cell___30_22__A_ <= cell___13_14__A_)))) : E (F (((2 <= pool__19_14_) OR (3 <= cell___27_1__B_)))) : A (G (((2 <= cell___4_27__B_) OR (2 <= cell___28_26__B_) OR (cell___5_6__A_ <= cell___20_21__B_) OR (3 <= cell___8_15__A_)))) : A (G ((cell___27_15__A_ <= pool__26_5_))) : E (F ((((cell___29_20__A_ <= cell___18_1__A_) AND (3 <= cell___20_2__B_) AND (2 <= pool__7_3_)) OR (3 <= pool__30_15_)))) : E (F (((3 <= cell___14_17__A_) AND (pool__8_24_ <= cell___15_18__A_)))) : E (F (((cell___27_19__B_ <= pool__6_17_) AND (3 <= cell___2_17__B_) AND ((cell___26_19__A_ <= pool__26_26_) OR (3 <= cell___11_12__A_)) AND ((cell___6_21__A_ <= cell___4_11__B_) OR (cell___22_11__A_ <= cell___23_27__A_) OR ((cell___21_15__A_ <= cell___3_14__A_) AND (1 <= cell___22_28__A_)))))) : E (F (((cell___26_15__B_ + 1 <= cell___8_29__B_) AND ((cell___24_8__B_ <= cell___3_7__A_) OR (1 <= cell___8_24__B_)) AND ((cell___29_23__A_ <= 2) OR (cell___21_26__A_ <= 1))))) : A (G ((pool__7_2_ <= pool__19_13_))) : E (F (((pool__8_12_ <= cell___15_19__A_) OR (2 <= pool__18_26_)))) : A (G (((cell___14_30__A_ <= 0) OR ((2 <= cell___13_9__B_) AND (1 <= cell___15_29__B_) AND (cell___5_22__A_ <= cell___27_21__A_) AND (cell___25_16__A_ <= pool__28_20_))))) : E (F (((cell___26_21__A_ + 1 <= cell___20_2__B_) OR (cell___15_15__B_ + 1 <= cell___9_5__B_) OR (pool__23_21_ <= 0))))
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 ((cell___29_16__A_ <= pool__25_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 7204 bytes per marking, with 0 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 PhaseVariation-PT-D30CS010-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((cell___30_27__B_ + 1 <= pool__25_1_) AND (cell___17_7__B_ <= 2)) OR (cell___30_17__B_ <= cell___27_14__A_))))
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 7204 bytes per marking, with 0 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 PhaseVariation-PT-D30CS010-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cell___9_29__A_ <= cell___4_5__A_)))
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 7204 bytes per marking, with 0 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 PhaseVariation-PT-D30CS010-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cell___12_26__A_) AND (3 <= pool__12_12_))))
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 7204 bytes per marking, with 0 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 PhaseVariation-PT-D30CS010-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 486 markings, 485 edges, 97 markings/sec, 0 secs
lola: sara is running 5 secs || 901 markings, 900 edges, 83 markings/sec, 5 secs
lola: sara is running 10 secs || 1358 markings, 1470 edges, 91 markings/sec, 10 secs
lola: sara is running 15 secs || 1777 markings, 2209 edges, 84 markings/sec, 15 secs
lola: sara is running 20 secs || 3359 markings, 12951 edges, 316 markings/sec, 20 secs
lola: sara is running 25 secs || 7708 markings, 57585 edges, 870 markings/sec, 25 secs
lola: sara is running 30 secs || 11960 markings, 107975 edges, 850 markings/sec, 30 secs
lola: sara is running 35 secs || 16316 markings, 153018 edges, 871 markings/sec, 35 secs
lola: sara is running 40 secs || 20356 markings, 202345 edges, 808 markings/sec, 40 secs
lola: sara is running 45 secs || 24296 markings, 252603 edges, 788 markings/sec, 45 secs
lola: sara is running 50 secs || 28113 markings, 306609 edges, 763 markings/sec, 50 secs
lola: sara is running 55 secs || 32365 markings, 352390 edges, 850 markings/sec, 55 secs
lola: sara is running 60 secs || 36495 markings, 398821 edges, 826 markings/sec, 60 secs
lola: sara is running 65 secs || 40521 markings, 443562 edges, 805 markings/sec, 65 secs
lola: sara is running 70 secs || 44617 markings, 487394 edges, 819 markings/sec, 70 secs
lola: sara is running 75 secs || 48616 markings, 539175 edges, 800 markings/sec, 75 secs
lola: sara is running 80 secs || 52448 markings, 588904 edges, 766 markings/sec, 80 secs
lola: sara is running 85 secs || 56269 markings, 642627 edges, 764 markings/sec, 85 secs
lola: sara is running 90 secs || 60239 markings, 694160 edges, 794 markings/sec, 90 secs
lola: sara is running 95 secs || 64025 markings, 749664 edges, 757 markings/sec, 95 secs
lola: sara is running 100 secs || 68034 markings, 800518 edges, 802 markings/sec, 100 secs
lola: sara is running 105 secs || 71926 markings, 856008 edges, 778 markings/sec, 105 secs
lola: sara is running 110 secs || 75616 markings, 912474 edges, 738 markings/sec, 110 secs
lola: sara is running 115 secs || 79373 markings, 971618 edges, 751 markings/sec, 115 secs
lola: sara is running 120 secs || 83331 markings, 1024676 edges, 792 markings/sec, 120 secs
lola: sara is running 125 secs || 87550 markings, 1069728 edges, 844 markings/sec, 125 secs
lola: sara is running 130 secs || 91713 markings, 1116635 edges, 833 markings/sec, 130 secs
lola: sara is running 135 secs || 95959 markings, 1161921 edges, 849 markings/sec, 135 secs
lola: sara is running 140 secs || 99992 markings, 1212332 edges, 807 markings/sec, 140 secs
lola: sara is running 145 secs || 103907 markings, 1263198 edges, 783 markings/sec, 145 secs
lola: sara is running 150 secs || 107695 markings, 1317784 edges, 758 markings/sec, 150 secs
lola: sara is running 155 secs || 111875 markings, 1360458 edges, 836 markings/sec, 155 secs
lola: sara is running 160 secs || 115883 markings, 1408214 edges, 802 markings/sec, 160 secs
lola: sara is running 165 secs || 120057 markings, 1450579 edges, 835 markings/sec, 165 secs
lola: sara is running 170 secs || 124111 markings, 1496818 edges, 811 markings/sec, 170 secs
lola: sara is running 175 secs || 128015 markings, 1547639 edges, 781 markings/sec, 175 secs
lola: sara is running 180 secs || 131927 markings, 1599389 edges, 782 markings/sec, 180 secs
lola: sara is running 185 secs || 135850 markings, 1653376 edges, 785 markings/sec, 185 secs
lola: sara is running 190 secs || 139888 markings, 1706070 edges, 808 markings/sec, 190 secs
lola: sara is running 195 secs || 143791 markings, 1760830 edges, 781 markings/sec, 195 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 200 secs || 147835 markings, 1813376 edges, 809 markings/sec, 200 secs
lola: sara is running 205 secs || 151587 markings, 1869618 edges, 750 markings/sec, 205 secs
lola: sara is running 210 secs || 155303 markings, 1926242 edges, 743 markings/sec, 210 secs
lola: sara is running 215 secs || 158948 markings, 1985576 edges, 729 markings/sec, 215 secs
lola: sara is running 220 secs || 162859 markings, 2039323 edges, 782 markings/sec, 220 secs
lola: sara is running 225 secs || 166825 markings, 2089025 edges, 793 markings/sec, 225 secs
lola: sara is running 230 secs || 170723 markings, 2140062 edges, 780 markings/sec, 230 secs
lola: sara is running 235 secs || 174691 markings, 2189592 edges, 794 markings/sec, 235 secs
lola: sara is running 240 secs || 178595 markings, 2245571 edges, 781 markings/sec, 240 secs
lola: sara is running 245 secs || 182451 markings, 2303037 edges, 771 markings/sec, 245 secs
lola: sara is running 250 secs || 186200 markings, 2363762 edges, 750 markings/sec, 250 secs
lola: sara is running 255 secs || 190311 markings, 2413122 edges, 822 markings/sec, 255 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cell___13_7__A_ <= cell___30_14__A_) OR (cell___30_22__A_ <= cell___13_14__A_))))
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 7204 bytes per marking, with 0 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 PhaseVariation-PT-D30CS010-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 24 markings, 23 edges
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pool__19_14_) OR (3 <= cell___27_1__B_))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 7204 bytes per marking, with 0 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 PhaseVariation-PT-D30CS010-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 701 markings, 1679 edges, 140 markings/sec, 0 secs
lola: sara is running 5 secs || 1163 markings, 2912 edges, 92 markings/sec, 5 secs
lola: sara is running 10 secs || 1741 markings, 4458 edges, 116 markings/sec, 10 secs
lola: sara is running 15 secs || 2161 markings, 5580 edges, 84 markings/sec, 15 secs
lola: sara is running 20 secs || 4353 markings, 18787 edges, 438 markings/sec, 20 secs
lola: sara is running 25 secs || 8698 markings, 57986 edges, 869 markings/sec, 25 secs
lola: sara is running 30 secs || 12903 markings, 100579 edges, 841 markings/sec, 30 secs
lola: sara is running 35 secs || 17232 markings, 139191 edges, 866 markings/sec, 35 secs
lola: sara is running 40 secs || 21348 markings, 184715 edges, 823 markings/sec, 40 secs
lola: sara is running 45 secs || 25428 markings, 231402 edges, 816 markings/sec, 45 secs
lola: sara is running 50 secs || 29414 markings, 281845 edges, 797 markings/sec, 50 secs
lola: sara is running 55 secs || 33778 markings, 320762 edges, 873 markings/sec, 55 secs
lola: sara is running 60 secs || 37938 markings, 363635 edges, 832 markings/sec, 60 secs
lola: sara is running 65 secs || 42194 markings, 400439 edges, 851 markings/sec, 65 secs
lola: sara is running 70 secs || 46300 markings, 443377 edges, 821 markings/sec, 70 secs
lola: sara is running 75 secs || 50466 markings, 489352 edges, 833 markings/sec, 75 secs
lola: sara is running 80 secs || 54495 markings, 539484 edges, 806 markings/sec, 80 secs
lola: sara is running 85 secs || 58530 markings, 587311 edges, 807 markings/sec, 85 secs
lola: sara is running 90 secs || 62586 markings, 635120 edges, 811 markings/sec, 90 secs
lola: sara is running 95 secs || 66678 markings, 686012 edges, 818 markings/sec, 95 secs
lola: sara is running 100 secs || 70851 markings, 734568 edges, 835 markings/sec, 100 secs
lola: sara is running 105 secs || 74839 markings, 788731 edges, 798 markings/sec, 105 secs
lola: sara is running 110 secs || 78753 markings, 843704 edges, 783 markings/sec, 110 secs
lola: sara is running 115 secs || 82626 markings, 896824 edges, 775 markings/sec, 115 secs
lola: sara is running 120 secs || 87041 markings, 935811 edges, 883 markings/sec, 120 secs
lola: sara is running 125 secs || 91336 markings, 979830 edges, 859 markings/sec, 125 secs
lola: sara is running 130 secs || 95766 markings, 1018886 edges, 886 markings/sec, 130 secs
lola: sara is running 135 secs || 99988 markings, 1065286 edges, 844 markings/sec, 135 secs
lola: sara is running 140 secs || 104182 markings, 1112965 edges, 839 markings/sec, 140 secs
lola: sara is running 145 secs || 108212 markings, 1163640 edges, 806 markings/sec, 145 secs
lola: sara is running 150 secs || 112643 markings, 1203076 edges, 886 markings/sec, 150 secs
lola: sara is running 155 secs || 116824 markings, 1246066 edges, 836 markings/sec, 155 secs
lola: sara is running 160 secs || 121162 markings, 1284314 edges, 868 markings/sec, 160 secs
lola: sara is running 165 secs || 125326 markings, 1328089 edges, 833 markings/sec, 165 secs
lola: sara is running 170 secs || 129432 markings, 1373514 edges, 821 markings/sec, 170 secs
lola: sara is running 175 secs || 133404 markings, 1423600 edges, 794 markings/sec, 175 secs
lola: sara is running 180 secs || 137529 markings, 1471231 edges, 825 markings/sec, 180 secs
lola: sara is running 185 secs || 141614 markings, 1520451 edges, 817 markings/sec, 185 secs
lola: sara is running 190 secs || 145598 markings, 1569987 edges, 797 markings/sec, 190 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 195 secs || 149698 markings, 1617281 edges, 820 markings/sec, 195 secs
lola: sara is running 200 secs || 153644 markings, 1671312 edges, 789 markings/sec, 200 secs
lola: sara is running 205 secs || 157507 markings, 1725354 edges, 773 markings/sec, 205 secs
lola: sara is running 210 secs || 161322 markings, 1780496 edges, 763 markings/sec, 210 secs
lola: sara is running 215 secs || 165498 markings, 1825772 edges, 835 markings/sec, 215 secs
lola: sara is running 220 secs || 169508 markings, 1874457 edges, 802 markings/sec, 220 secs
lola: sara is running 225 secs || 173648 markings, 1919203 edges, 828 markings/sec, 225 secs
lola: sara is running 230 secs || 177663 markings, 1968422 edges, 803 markings/sec, 230 secs
lola: sara is running 235 secs || 181618 markings, 2019149 edges, 791 markings/sec, 235 secs
lola: sara is running 240 secs || 185472 markings, 2073479 edges, 771 markings/sec, 240 secs
lola: sara is running 245 secs || 189572 markings, 2122533 edges, 820 markings/sec, 245 secs
lola: sara is running 250 secs || 193676 markings, 2168259 edges, 821 markings/sec, 250 secs
lola: sara is running 255 secs || 197734 markings, 2215768 edges, 812 markings/sec, 255 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= cell___4_27__B_) OR (2 <= cell___28_26__B_) OR (cell___5_6__A_ <= cell___20_21__B_) OR (3 <= cell___8_15__A_))))
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 7204 bytes per marking, with 0 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 PhaseVariation-PT-D30CS010-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 7 will run for 334 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cell___27_15__A_ <= pool__26_5_)))
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 7204 bytes per marking, with 0 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 PhaseVariation-PT-D30CS010-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 8 will run for 376 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((cell___29_20__A_ <= cell___18_1__A_) AND (3 <= cell___20_2__B_) AND (2 <= pool__7_3_)) OR (3 <= pool__30_15_))))
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 7204 bytes per marking, with 0 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 PhaseVariation-PT-D30CS010-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 697 markings, 2038 edges, 139 markings/sec, 0 secs
lola: sara is running 5 secs || 1222 markings, 3743 edges, 105 markings/sec, 5 secs
lola: sara is running 10 secs || 1819 markings, 6352 edges, 119 markings/sec, 10 secs
lola: sara is running 15 secs || 2221 markings, 8630 edges, 80 markings/sec, 15 secs
lola: sara is running 20 secs || 3708 markings, 19286 edges, 297 markings/sec, 20 secs
lola: sara is running 25 secs || 8120 markings, 64666 edges, 882 markings/sec, 25 secs
lola: sara is running 30 secs || 12169 markings, 113001 edges, 810 markings/sec, 30 secs
lola: sara is running 35 secs || 16328 markings, 156358 edges, 832 markings/sec, 35 secs
lola: sara is running 40 secs || 20338 markings, 204670 edges, 802 markings/sec, 40 secs
lola: sara is running 45 secs || 24272 markings, 253682 edges, 787 markings/sec, 45 secs
lola: sara is running 50 secs || 28221 markings, 308083 edges, 790 markings/sec, 50 secs
lola: sara is running 55 secs || 32301 markings, 355151 edges, 816 markings/sec, 55 secs
lola: sara is running 60 secs || 36365 markings, 398769 edges, 813 markings/sec, 60 secs
lola: sara is running 65 secs || 40506 markings, 446131 edges, 828 markings/sec, 65 secs
lola: sara is running 70 secs || 44687 markings, 490646 edges, 836 markings/sec, 70 secs
lola: sara is running 75 secs || 48608 markings, 539733 edges, 784 markings/sec, 75 secs
lola: sara is running 80 secs || 52778 markings, 594594 edges, 834 markings/sec, 80 secs
lola: sara is running 85 secs || 56753 markings, 650316 edges, 795 markings/sec, 85 secs
lola: sara is running 90 secs || 60667 markings, 701223 edges, 783 markings/sec, 90 secs
lola: sara is running 95 secs || 64675 markings, 759322 edges, 802 markings/sec, 95 secs
lola: sara is running 100 secs || 68625 markings, 809994 edges, 790 markings/sec, 100 secs
lola: sara is running 105 secs || 72413 markings, 864152 edges, 758 markings/sec, 105 secs
lola: sara is running 110 secs || 76333 markings, 923594 edges, 784 markings/sec, 110 secs
lola: sara is running 115 secs || 80209 markings, 985438 edges, 775 markings/sec, 115 secs
lola: sara is running 120 secs || 84114 markings, 1036274 edges, 781 markings/sec, 120 secs
lola: sara is running 125 secs || 88285 markings, 1080746 edges, 834 markings/sec, 125 secs
lola: sara is running 130 secs || 92465 markings, 1127658 edges, 836 markings/sec, 130 secs
lola: sara is running 135 secs || 96681 markings, 1172625 edges, 843 markings/sec, 135 secs
lola: sara is running 140 secs || 100633 markings, 1221934 edges, 790 markings/sec, 140 secs
lola: sara is running 145 secs || 104516 markings, 1272503 edges, 777 markings/sec, 145 secs
lola: sara is running 150 secs || 108385 markings, 1327132 edges, 774 markings/sec, 150 secs
lola: sara is running 155 secs || 112659 markings, 1371782 edges, 855 markings/sec, 155 secs
lola: sara is running 160 secs || 116799 markings, 1420728 edges, 828 markings/sec, 160 secs
lola: sara is running 165 secs || 121113 markings, 1464713 edges, 863 markings/sec, 165 secs
lola: sara is running 170 secs || 125126 markings, 1512736 edges, 803 markings/sec, 170 secs
lola: sara is running 175 secs || 129132 markings, 1562976 edges, 801 markings/sec, 175 secs
lola: sara is running 180 secs || 133085 markings, 1616968 edges, 791 markings/sec, 180 secs
lola: sara is running 185 secs || 136982 markings, 1670801 edges, 779 markings/sec, 185 secs
lola: sara is running 190 secs || 140977 markings, 1722941 edges, 799 markings/sec, 190 secs
lola: sara is running 195 secs || 144825 markings, 1775713 edges, 770 markings/sec, 195 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 200 secs || 148815 markings, 1827830 edges, 798 markings/sec, 200 secs
lola: sara is running 205 secs || 152775 markings, 1887565 edges, 792 markings/sec, 205 secs
lola: sara is running 210 secs || 156626 markings, 1947321 edges, 770 markings/sec, 210 secs
lola: sara is running 215 secs || 160214 markings, 2009615 edges, 718 markings/sec, 215 secs
lola: sara is running 220 secs || 164256 markings, 2057591 edges, 808 markings/sec, 220 secs
lola: sara is running 225 secs || 168145 markings, 2108750 edges, 778 markings/sec, 225 secs
lola: sara is running 230 secs || 172104 markings, 2159615 edges, 792 markings/sec, 230 secs
lola: sara is running 235 secs || 176162 markings, 2210903 edges, 812 markings/sec, 235 secs
lola: sara is running 240 secs || 180123 markings, 2268842 edges, 792 markings/sec, 240 secs
lola: sara is running 245 secs || 183949 markings, 2325862 edges, 765 markings/sec, 245 secs
lola: sara is running 250 secs || 187777 markings, 2383797 edges, 766 markings/sec, 250 secs
lola: sara is running 255 secs || 191917 markings, 2434765 edges, 828 markings/sec, 255 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cell___14_17__A_) AND (pool__8_24_ <= cell___15_18__A_))))
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 7204 bytes per marking, with 0 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 PhaseVariation-PT-D30CS010-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 622 markings, 870 edges, 124 markings/sec, 0 secs
lola: sara is running 5 secs || 1125 markings, 1564 edges, 101 markings/sec, 5 secs
lola: sara is running 10 secs || 1682 markings, 2661 edges, 111 markings/sec, 10 secs
lola: sara is running 15 secs || 2048 markings, 3773 edges, 73 markings/sec, 15 secs
lola: sara is running 20 secs || 4211 markings, 19942 edges, 433 markings/sec, 20 secs
lola: sara is running 25 secs || 8290 markings, 62671 edges, 816 markings/sec, 25 secs
lola: sara is running 30 secs || 12212 markings, 109891 edges, 784 markings/sec, 30 secs
lola: sara is running 35 secs || 16496 markings, 154296 edges, 857 markings/sec, 35 secs
lola: sara is running 40 secs || 20604 markings, 204361 edges, 822 markings/sec, 40 secs
lola: sara is running 45 secs || 24649 markings, 256235 edges, 809 markings/sec, 45 secs
lola: sara is running 50 secs || 28556 markings, 312572 edges, 781 markings/sec, 50 secs
lola: sara is running 55 secs || 32848 markings, 356747 edges, 858 markings/sec, 55 secs
lola: sara is running 60 secs || 37016 markings, 405060 edges, 834 markings/sec, 60 secs
lola: sara is running 65 secs || 41307 markings, 450202 edges, 858 markings/sec, 65 secs
lola: sara is running 70 secs || 45617 markings, 499430 edges, 862 markings/sec, 70 secs
lola: sara is running 75 secs || 49700 markings, 551885 edges, 817 markings/sec, 75 secs
lola: sara is running 80 secs || 53718 markings, 605690 edges, 804 markings/sec, 80 secs
lola: sara is running 85 secs || 57652 markings, 660384 edges, 787 markings/sec, 85 secs
lola: sara is running 90 secs || 61676 markings, 712930 edges, 805 markings/sec, 90 secs
lola: sara is running 95 secs || 65654 markings, 767608 edges, 796 markings/sec, 95 secs
lola: sara is running 100 secs || 69679 markings, 820047 edges, 805 markings/sec, 100 secs
lola: sara is running 105 secs || 73595 markings, 879387 edges, 783 markings/sec, 105 secs
lola: sara is running 110 secs || 77396 markings, 938669 edges, 760 markings/sec, 110 secs
lola: sara is running 115 secs || 81085 markings, 1001021 edges, 738 markings/sec, 115 secs
lola: sara is running 120 secs || 85352 markings, 1045116 edges, 853 markings/sec, 120 secs
lola: sara is running 125 secs || 89500 markings, 1093207 edges, 830 markings/sec, 125 secs
lola: sara is running 130 secs || 93888 markings, 1139440 edges, 878 markings/sec, 130 secs
lola: sara is running 135 secs || 98086 markings, 1187270 edges, 840 markings/sec, 135 secs
lola: sara is running 140 secs || 102034 markings, 1238538 edges, 790 markings/sec, 140 secs
lola: sara is running 145 secs || 105944 markings, 1290290 edges, 782 markings/sec, 145 secs
lola: sara is running 150 secs || 109920 markings, 1339098 edges, 795 markings/sec, 150 secs
lola: sara is running 155 secs || 114217 markings, 1385221 edges, 859 markings/sec, 155 secs
lola: sara is running 160 secs || 118336 markings, 1431444 edges, 824 markings/sec, 160 secs
lola: sara is running 165 secs || 122574 markings, 1476672 edges, 848 markings/sec, 165 secs
lola: sara is running 170 secs || 126591 markings, 1526704 edges, 803 markings/sec, 170 secs
lola: sara is running 175 secs || 130492 markings, 1577482 edges, 780 markings/sec, 175 secs
lola: sara is running 180 secs || 134251 markings, 1632563 edges, 752 markings/sec, 180 secs
lola: sara is running 185 secs || 138328 markings, 1684722 edges, 815 markings/sec, 185 secs
lola: sara is running 190 secs || 142320 markings, 1742295 edges, 798 markings/sec, 190 secs
lola: sara is running 195 secs || 146492 markings, 1795063 edges, 834 markings/sec, 195 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 200 secs || 150578 markings, 1852016 edges, 817 markings/sec, 200 secs
lola: sara is running 205 secs || 154484 markings, 1912595 edges, 781 markings/sec, 205 secs
lola: sara is running 210 secs || 158344 markings, 1973205 edges, 772 markings/sec, 210 secs
lola: sara is running 215 secs || 162364 markings, 2031629 edges, 804 markings/sec, 215 secs
lola: sara is running 220 secs || 166568 markings, 2084371 edges, 841 markings/sec, 220 secs
lola: sara is running 225 secs || 170712 markings, 2138629 edges, 829 markings/sec, 225 secs
lola: sara is running 230 secs || 174913 markings, 2191394 edges, 840 markings/sec, 230 secs
lola: sara is running 235 secs || 178933 markings, 2248640 edges, 804 markings/sec, 235 secs
lola: sara is running 240 secs || 182798 markings, 2306465 edges, 773 markings/sec, 240 secs
lola: sara is running 245 secs || 186548 markings, 2366869 edges, 750 markings/sec, 245 secs
lola: sara is running 250 secs || 190749 markings, 2417741 edges, 840 markings/sec, 250 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 415 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cell___27_19__B_ <= pool__6_17_) AND (3 <= cell___2_17__B_) AND ((cell___26_19__A_ <= pool__26_26_) OR (3 <= cell___11_12__A_)) AND ((cell___6_21__A_ <= cell___4_11__B_) OR (cell___22_11__A_ <= cell___23_27__A_) OR ((cell___21_15__A_ <= cell___3_14__A_) AND (1 <= cell___22_28__A_))))))
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 7204 bytes per marking, with 0 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 26 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 682 markings, 1514 edges, 136 markings/sec, 0 secs
lola: sara is running 5 secs || 1262 markings, 3350 edges, 116 markings/sec, 5 secs
lola: sara is running 10 secs || 1864 markings, 5676 edges, 120 markings/sec, 10 secs
lola: sara is running 15 secs || 2292 markings, 7315 edges, 86 markings/sec, 15 secs
lola: sara is running 20 secs || 4820 markings, 27737 edges, 506 markings/sec, 20 secs
lola: sara is running 25 secs || 9080 markings, 73155 edges, 852 markings/sec, 25 secs
lola: sara is running 30 secs || 13264 markings, 120843 edges, 837 markings/sec, 30 secs
lola: sara is running 35 secs || 17505 markings, 165580 edges, 848 markings/sec, 35 secs
lola: sara is running 40 secs || 21538 markings, 216448 edges, 807 markings/sec, 40 secs
lola: sara is running 45 secs || 25453 markings, 267322 edges, 783 markings/sec, 45 secs
lola: sara is running 50 secs || 29280 markings, 322403 edges, 765 markings/sec, 50 secs
lola: sara is running 55 secs || 33576 markings, 366195 edges, 859 markings/sec, 55 secs
lola: sara is running 60 secs || 37670 markings, 415428 edges, 819 markings/sec, 60 secs
lola: sara is running 65 secs || 41954 markings, 458614 edges, 857 markings/sec, 65 secs
lola: sara is running 70 secs || 46104 markings, 507024 edges, 830 markings/sec, 70 secs
lola: sara is running 75 secs || 50108 markings, 557797 edges, 801 markings/sec, 75 secs
lola: sara is running 80 secs || 53980 markings, 610000 edges, 774 markings/sec, 80 secs
lola: sara is running 85 secs || 57829 markings, 663504 edges, 770 markings/sec, 85 secs
lola: sara is running 90 secs || 61752 markings, 714539 edges, 785 markings/sec, 90 secs
lola: sara is running 95 secs || 65784 markings, 770054 edges, 806 markings/sec, 95 secs
lola: sara is running 100 secs || 69826 markings, 822806 edges, 808 markings/sec, 100 secs
lola: sara is running 105 secs || 73806 markings, 882938 edges, 796 markings/sec, 105 secs
lola: sara is running 110 secs || 77757 markings, 944054 edges, 790 markings/sec, 110 secs
lola: sara is running 115 secs || 81559 markings, 1008805 edges, 760 markings/sec, 115 secs
lola: sara is running 120 secs || 85906 markings, 1052420 edges, 869 markings/sec, 120 secs
lola: sara is running 125 secs || 90056 markings, 1101987 edges, 830 markings/sec, 125 secs
lola: sara is running 130 secs || 94367 markings, 1145791 edges, 862 markings/sec, 130 secs
lola: sara is running 135 secs || 98473 markings, 1193386 edges, 821 markings/sec, 135 secs
lola: sara is running 140 secs || 102456 markings, 1244319 edges, 797 markings/sec, 140 secs
lola: sara is running 145 secs || 106450 markings, 1297900 edges, 799 markings/sec, 145 secs
lola: sara is running 150 secs || 110420 markings, 1346367 edges, 794 markings/sec, 150 secs
lola: sara is running 155 secs || 114547 markings, 1390353 edges, 825 markings/sec, 155 secs
lola: sara is running 160 secs || 118730 markings, 1437317 edges, 837 markings/sec, 160 secs
lola: sara is running 165 secs || 122808 markings, 1480416 edges, 816 markings/sec, 165 secs
lola: sara is running 170 secs || 126727 markings, 1529360 edges, 784 markings/sec, 170 secs
lola: sara is running 175 secs || 130700 markings, 1580988 edges, 795 markings/sec, 175 secs
lola: sara is running 180 secs || 134463 markings, 1636117 edges, 753 markings/sec, 180 secs
lola: sara is running 185 secs || 138381 markings, 1685920 edges, 784 markings/sec, 185 secs
lola: sara is running 190 secs || 142180 markings, 1739683 edges, 760 markings/sec, 190 secs
lola: sara is running 195 secs || 146125 markings, 1791446 edges, 789 markings/sec, 195 secs
lola: sara is running 200 secs || 149992 markings, 1843055 edges, 773 markings/sec, 200 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 205 secs || 153696 markings, 1899731 edges, 741 markings/sec, 205 secs
lola: sara is running 210 secs || 157392 markings, 1956654 edges, 739 markings/sec, 210 secs
lola: sara is running 215 secs || 160998 markings, 2016339 edges, 721 markings/sec, 215 secs
lola: sara is running 220 secs || 164966 markings, 2065365 edges, 794 markings/sec, 220 secs
lola: sara is running 225 secs || 168818 markings, 2117874 edges, 770 markings/sec, 225 secs
lola: sara is running 230 secs || 172839 markings, 2166037 edges, 804 markings/sec, 230 secs
lola: sara is running 235 secs || 176744 markings, 2217107 edges, 781 markings/sec, 235 secs
lola: sara is running 240 secs || 180502 markings, 2273078 edges, 752 markings/sec, 240 secs
lola: sara is running 245 secs || 184256 markings, 2329068 edges, 751 markings/sec, 245 secs
lola: sara is running 250 secs || 188040 markings, 2384586 edges, 757 markings/sec, 250 secs
lola: sara is running 255 secs || 192012 markings, 2433944 edges, 794 markings/sec, 255 secs
lola: sara is running 260 secs || 195875 markings, 2487045 edges, 773 markings/sec, 260 secs
lola: sara is running 265 secs || 199845 markings, 2535739 edges, 794 markings/sec, 265 secs
lola: sara is running 270 secs || 203697 markings, 2588038 edges, 770 markings/sec, 270 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 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cell___26_15__B_ + 1 <= cell___8_29__B_) AND ((cell___24_8__B_ <= cell___3_7__A_) OR (1 <= cell___8_24__B_)) AND ((cell___29_23__A_ <= 2) OR (cell___21_26__A_ <= 1)))))
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 7204 bytes per marking, with 0 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 PhaseVariation-PT-D30CS010-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 12 will run for 553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pool__7_2_ <= pool__19_13_)))
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 7204 bytes per marking, with 0 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 PhaseVariation-PT-D30CS010-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 13 will run for 737 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pool__8_12_ <= cell___15_19__A_) OR (2 <= pool__18_26_))))
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 7204 bytes per marking, with 0 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 PhaseVariation-PT-D30CS010-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 14 will run for 1106 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cell___14_30__A_ <= 0) OR ((2 <= cell___13_9__B_) AND (1 <= cell___15_29__B_) AND (cell___5_22__A_ <= cell___27_21__A_) AND (cell___25_16__A_ <= pool__28_20_)))))
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 7204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 15 will run for 2212 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cell___26_21__A_ + 1 <= cell___20_2__B_) OR (cell___15_15__B_ + 1 <= cell___9_5__B_) OR (pool__23_21_ <= 0))))
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 7204 bytes per marking, with 0 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 3 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS010-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS010-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no yes no yes no yes
lola: ========================================
FORMULA PhaseVariation-PT-D30CS010-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS010-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PhaseVariation-PT-D30CS010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-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/PhaseVariation-PT-D30CS010.tgz
mv PhaseVariation-PT-D30CS010 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 irma4mcc-full"
echo " Input is PhaseVariation-PT-D30CS010, 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 r114-csrt-152666473000656"
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 '
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 ;