About the Execution of Irma.full for FlexibleBarrier-PT-22b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 795.060 | 534761.00 | 1000435.00 | 182.10 | F?TTFFTTTTFTTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
..................
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.2K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.8M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is FlexibleBarrier-PT-22b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r090-blw7-152650001200238
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-00
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-01
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-02
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-03
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-04
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-05
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-06
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-07
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-08
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-09
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-10
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-11
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-12
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-13
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-14
FORMULA_NAME FlexibleBarrier-PT-22b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1527065797316
BK_STOP 1527066332077
--------------------
content from stderr:
Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using FlexibleBarrier-PT-22b as instance name.
Using FlexibleBarrier as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 758787, 'Memory': 784.36, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola FlexibleBarrier-PT-22b...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
FlexibleBarrier-PT-22b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-22b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ FlexibleBarrier-PT-22b @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 13947/65536 symbol table entries, 4218 collisions
lola: preprocessing...
lola: finding significant places
lola: 6478 places, 7469 transitions, 6454 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 7515 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-22b-ReachabilityFireability.task
lola: E (F ((FIREABLE(t4794) AND FIREABLE(t603) AND NOT FIREABLE(t1328) AND FIREABLE(t730) AND FIREABLE(t4452)))) : E (F ((NOT FIREABLE(t3203) AND NOT FIREABLE(t2537) AND FIREABLE(t1458) AND FIREABLE(t3902) AND NOT FIREABLE(t6642) AND (FIREABLE(t546) OR FIREABLE(t4905))))) : E (F (FIREABLE(t4683))) : E (F ((FIREABLE(t6637) OR FIREABLE(t1031) OR FIREABLE(t4004)))) : E (F ((NOT FIREABLE(t2403) AND NOT FIREABLE(t946) AND FIREABLE(t2480) AND (FIREABLE(t845) OR FIREABLE(t7070) OR (FIREABLE(t6082) AND FIREABLE(t7199))) AND FIREABLE(t2196)))) : A (G ((NOT FIREABLE(t1203) OR NOT FIREABLE(t4656)))) : A (G ((FIREABLE(t7210) OR FIREABLE(t747) OR NOT FIREABLE(t7319) OR FIREABLE(t5474) OR NOT FIREABLE(t228) OR (((FIREABLE(t2037) AND FIREABLE(t2616)) OR (FIREABLE(t7204) AND FIREABLE(t4882))) AND FIREABLE(t1155))))) : E (F (((FIREABLE(t2146) AND FIREABLE(t1690) AND (FIREABLE(t1995) OR FIREABLE(t3146)) AND NOT FIREABLE(t5286) AND NOT FIREABLE(t22)) OR FIREABLE(t4759)))) : E (F (FIREABLE(t928))) : E (F (((((FIREABLE(t6500) AND FIREABLE(t5378)) OR FIREABLE(t3835)) AND (NOT FIREABLE(t7088) OR (FIREABLE(t5290) AND FIREABLE(t5222)))) OR FIREABLE(t1383)))) : E (F ((FIREABLE(t6969) AND FIREABLE(t250)))) : E (F ((NOT FIREABLE(t6427) AND NOT FIREABLE(t6041) AND FIREABLE(t7321) AND FIREABLE(t5595)))) : E (F (((NOT FIREABLE(t4957) OR FIREABLE(t4254)) AND FIREABLE(t5080)))) : E (F (FIREABLE(t6686))) : A (G ((FIREABLE(t1112) OR FIREABLE(t1709) OR (FIREABLE(t6154) AND FIREABLE(t1097)) OR (NOT FIREABLE(t4636) AND NOT FIREABLE(t6457)) OR (FIREABLE(t603) AND (FIREABLE(t1462) OR FIREABLE(t1855)) AND FIREABLE(t5693))))) : E (F ((FIREABLE(t3335) AND FIREABLE(t2952) AND (NOT FIREABLE(t4466) OR NOT FIREABLE(t6385) OR NOT FIREABLE(t6018) OR NOT FIREABLE(t903)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t4794) AND FIREABLE(t603) AND NOT FIREABLE(t1328) AND FIREABLE(t730) AND FIREABLE(t4452))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability.sara.
lola: sara is running 0 secs || 30275 markings, 58074 edges, 6055 markings/sec, 0 secs
lola: sara is running 5 secs || 63045 markings, 122609 edges, 6554 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 95723 markings, 186540 edges, 6536 markings/sec, 10 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t3203) AND NOT FIREABLE(t2537) AND FIREABLE(t1458) AND FIREABLE(t3902) AND NOT FIREABLE(t6642) AND (FIREABLE(t546) OR FIREABLE(t4905)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 36 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability.sara.
lola: sara is running 0 secs || 38364 markings, 84701 edges, 7673 markings/sec, 0 secs
lola: sara is running 5 secs || 76180 markings, 170963 edges, 7563 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 112866 markings, 264102 edges, 7337 markings/sec, 10 secs
lola: sara is running 15 secs || 149114 markings, 353855 edges, 7250 markings/sec, 15 secs
lola: sara is running 20 secs || 187470 markings, 438782 edges, 7671 markings/sec, 20 secs
lola: sara is running 25 secs || 224460 markings, 527868 edges, 7398 markings/sec, 25 secs
lola: sara is running 30 secs || 260218 markings, 621795 edges, 7152 markings/sec, 30 secs
lola: sara is running 35 secs || 297796 markings, 707238 edges, 7516 markings/sec, 35 secs
lola: sara is running 40 secs || 336103 markings, 792394 edges, 7661 markings/sec, 40 secs
lola: sara is running 45 secs || 372632 markings, 885769 edges, 7306 markings/sec, 45 secs
lola: sara is running 50 secs || 408278 markings, 975942 edges, 7129 markings/sec, 50 secs
lola: sara is running 55 secs || 446641 markings, 1060904 edges, 7673 markings/sec, 55 secs
lola: sara is running 60 secs || 484054 markings, 1148031 edges, 7483 markings/sec, 60 secs
lola: sara is running 65 secs || 520750 markings, 1240862 edges, 7339 markings/sec, 65 secs
lola: sara is running 70 secs || 557317 markings, 1329891 edges, 7313 markings/sec, 70 secs
lola: sara is running 75 secs || 594815 markings, 1413418 edges, 7500 markings/sec, 75 secs
lola: sara is running 80 secs || 630747 markings, 1500730 edges, 7186 markings/sec, 80 secs
lola: sara is running 85 secs || 666563 markings, 1590546 edges, 7163 markings/sec, 85 secs
lola: sara is running 90 secs || 703167 markings, 1678599 edges, 7321 markings/sec, 90 secs
lola: sara is running 95 secs || 741404 markings, 1763352 edges, 7647 markings/sec, 95 secs
lola: sara is running 100 secs || 778129 markings, 1852864 edges, 7345 markings/sec, 100 secs
lola: sara is running 105 secs || 813409 markings, 1945728 edges, 7056 markings/sec, 105 secs
lola: sara is running 110 secs || 851164 markings, 2030852 edges, 7551 markings/sec, 110 secs
lola: sara is running 115 secs || 888998 markings, 2115241 edges, 7567 markings/sec, 115 secs
lola: sara is running 120 secs || 925217 markings, 2207273 edges, 7244 markings/sec, 120 secs
lola: sara is running 125 secs || 960550 markings, 2297728 edges, 7067 markings/sec, 125 secs
lola: sara is running 130 secs || 998874 markings, 2382588 edges, 7665 markings/sec, 130 secs
lola: sara is running 135 secs || 1036166 markings, 2467887 edges, 7458 markings/sec, 135 secs
lola: sara is running 140 secs || 1072261 markings, 2560018 edges, 7219 markings/sec, 140 secs
lola: sara is running 145 secs || 1107756 markings, 2648666 edges, 7099 markings/sec, 145 secs
lola: sara is running 150 secs || 1141894 markings, 2739243 edges, 6828 markings/sec, 150 secs
lola: sara is running 155 secs || 1172616 markings, 2850842 edges, 6144 markings/sec, 155 secs
lola: sara is running 160 secs || 1203789 markings, 2963836 edges, 6235 markings/sec, 160 secs
lola: sara is running 165 secs || 1234201 markings, 3074362 edges, 6082 markings/sec, 165 secs
lola: sara is running 170 secs || 1265659 markings, 3187762 edges, 6292 markings/sec, 170 secs
lola: sara is running 175 secs || 1297079 markings, 3300964 edges, 6284 markings/sec, 175 secs
lola: sara is running 180 secs || 1328458 markings, 3415618 edges, 6276 markings/sec, 180 secs
lola: sara is running 185 secs || 1359815 markings, 3530068 edges, 6271 markings/sec, 185 secs
lola: sara is running 190 secs || 1391262 markings, 3646216 edges, 6289 markings/sec, 190 secs
lola: sara is running 195 secs || 1423098 markings, 3759829 edges, 6367 markings/sec, 195 secs
lola: sara is running 200 secs || 1454538 markings, 3874418 edges, 6288 markings/sec, 200 secs
lola: sara is running 205 secs || 1485842 markings, 3988804 edges, 6261 markings/sec, 205 secs
lola: sara is running 210 secs || 1516924 markings, 4093980 edges, 6216 markings/sec, 210 secs
lola: sara is running 215 secs || 1547982 markings, 4214262 edges, 6212 markings/sec, 215 secs
lola: sara is running 220 secs || 1574866 markings, 4324219 edges, 5377 markings/sec, 220 secs
lola: sara is running 225 secs || 1598056 markings, 4470567 edges, 4638 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t4683)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges
lola: ========================================
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t6637) OR FIREABLE(t1031) OR FIREABLE(t4004))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 61 markings, 60 edges
lola: ========================================
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t2403) AND NOT FIREABLE(t946) AND FIREABLE(t2480) AND (FIREABLE(t845) OR FIREABLE(t7070) OR (FIREABLE(t6082) AND FIREABLE(t7199))) AND FIREABLE(t2196))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 20 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-4.sara.
lola: sara is running 0 secs || 30444 markings, 58765 edges, 6089 markings/sec, 0 secs
lola: sara is running 5 secs || 62961 markings, 122883 edges, 6503 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 95861 markings, 187834 edges, 6580 markings/sec, 10 secs
lola: sara is running 15 secs || 128650 markings, 252140 edges, 6558 markings/sec, 15 secs
lola: sara is running 20 secs || 160255 markings, 317065 edges, 6321 markings/sec, 20 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1203) OR NOT FIREABLE(t4656))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-5.sara.
lola: sara is running 0 secs || 30421 markings, 57991 edges, 6084 markings/sec, 0 secs
lola: sara is running 5 secs || 62029 markings, 120226 edges, 6322 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t7210) OR FIREABLE(t747) OR NOT FIREABLE(t7319) OR FIREABLE(t5474) OR NOT FIREABLE(t228) OR (((FIREABLE(t2037) AND FIREABLE(t2616)) OR (FIREABLE(t7204) AND FIREABLE(t4882))) AND FIREABLE(t1155)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 240 literals and 27 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-6.sara.
lola: sara is running 0 secs || 32317 markings, 62483 edges, 6463 markings/sec, 0 secs
lola: sara is running 5 secs || 64604 markings, 125898 edges, 6457 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 96919 markings, 189382 edges, 6463 markings/sec, 10 secs
lola: sara is running 15 secs || 127414 markings, 252115 edges, 6099 markings/sec, 15 secs
lola: sara is running 20 secs || 159790 markings, 314908 edges, 6475 markings/sec, 20 secs
lola: sara is running 25 secs || 192160 markings, 378514 edges, 6474 markings/sec, 25 secs
lola: sara is running 30 secs || 224551 markings, 442117 edges, 6478 markings/sec, 30 secs
lola: sara is running 35 secs || 254974 markings, 504738 edges, 6085 markings/sec, 35 secs
lola: sara is running 40 secs || 286041 markings, 564661 edges, 6213 markings/sec, 40 secs
lola: sara is running 45 secs || 317476 markings, 626139 edges, 6287 markings/sec, 45 secs
lola: sara is running 50 secs || 347897 markings, 688819 edges, 6084 markings/sec, 50 secs
lola: sara is running 55 secs || 380376 markings, 751815 edges, 6496 markings/sec, 55 secs
lola: sara is running 60 secs || 412810 markings, 815550 edges, 6487 markings/sec, 60 secs
lola: sara is running 65 secs || 445252 markings, 879242 edges, 6488 markings/sec, 65 secs
lola: sara is running 70 secs || 473020 markings, 954180 edges, 5554 markings/sec, 70 secs
lola: sara is running 75 secs || 499758 markings, 1036815 edges, 5348 markings/sec, 75 secs
lola: sara is running 80 secs || 528011 markings, 1100700 edges, 5651 markings/sec, 80 secs
lola: sara is running 85 secs || 551757 markings, 1198491 edges, 4749 markings/sec, 85 secs
lola: sara is running 90 secs || 575055 markings, 1300977 edges, 4660 markings/sec, 90 secs
lola: sara is running 95 secs || 598427 markings, 1401753 edges, 4674 markings/sec, 95 secs
lola: sara is running 100 secs || 621661 markings, 1502715 edges, 4647 markings/sec, 100 secs
lola: sara is running 105 secs || 644910 markings, 1603981 edges, 4650 markings/sec, 105 secs
lola: sara is running 110 secs || 668204 markings, 1705421 edges, 4659 markings/sec, 110 secs
lola: sara is running 115 secs || 689983 markings, 1811210 edges, 4356 markings/sec, 115 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 7 will run for 347 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t2146) AND FIREABLE(t1690) AND (FIREABLE(t1995) OR FIREABLE(t3146)) AND NOT FIREABLE(t5286) AND NOT FIREABLE(t22)) OR FIREABLE(t4759))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 11 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 48 markings, 47 edges
lola: ========================================
lola: subprocess 8 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t928)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-8.sara.
lola: sara is running 0 secs || 30749 markings, 59407 edges, 6150 markings/sec, 0 secs
lola: sara is running 5 secs || 62056 markings, 120973 edges, 6261 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 91772 markings, 181481 edges, 5943 markings/sec, 10 secs
lola: sara is running 15 secs || 123527 markings, 243227 edges, 6351 markings/sec, 15 secs
lola: sara is running 20 secs || 154464 markings, 316705 edges, 6187 markings/sec, 20 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 443 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((FIREABLE(t6500) AND FIREABLE(t5378)) OR FIREABLE(t3835)) AND (NOT FIREABLE(t7088) OR (FIREABLE(t5290) AND FIREABLE(t5222)))) OR FIREABLE(t1383))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 27 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 62 markings, 61 edges
lola: ========================================
lola: subprocess 10 will run for 517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t6969) AND FIREABLE(t250))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-10.sara.
lola: sara is running 0 secs || 31699 markings, 61406 edges, 6340 markings/sec, 0 secs
lola: sara is running 5 secs || 64063 markings, 125054 edges, 6473 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 96779 markings, 189481 edges, 6543 markings/sec, 10 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 617 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t6427) AND NOT FIREABLE(t6041) AND FIREABLE(t7321) AND FIREABLE(t5595))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-11.sara.
lola: sara is running 0 secs || 32902 markings, 64244 edges, 6580 markings/sec, 0 secs
lola: sara is running 5 secs || 65809 markings, 128949 edges, 6581 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 98626 markings, 193686 edges, 6563 markings/sec, 10 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 767 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t4957) OR FIREABLE(t4254)) AND FIREABLE(t5080))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-12.sara.
lola: sara is running 0 secs || 30435 markings, 58691 edges, 6087 markings/sec, 0 secs
lola: sara is running 5 secs || 62240 markings, 121155 edges, 6361 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 94298 markings, 184155 edges, 6412 markings/sec, 10 secs
lola: sara is running 15 secs || 125511 markings, 248212 edges, 6243 markings/sec, 15 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1016 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t6686)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 42 markings, 41 edges
lola: ========================================
lola: subprocess 14 will run for 1524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1112) OR FIREABLE(t1709) OR (FIREABLE(t6154) AND FIREABLE(t1097)) OR (NOT FIREABLE(t4636) AND NOT FIREABLE(t6457)) OR (FIREABLE(t603) AND (FIREABLE(t1462) OR FIREABLE(t1855)) AND FIREABLE(t5693)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 70 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 69 markings, 68 edges
lola: ========================================
lola: subprocess 15 will run for 3048 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t3335) AND FIREABLE(t2952) AND (NOT FIREABLE(t4466) OR NOT FIREABLE(t6385) OR NOT FIREABLE(t6018) OR NOT FIREABLE(t903)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 47 markings, 46 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown yes yes no no yes yes yes yes no yes yes yes no yes
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished 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="FlexibleBarrier-PT-22b"
export BK_EXAMINATION="ReachabilityFireability"
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/FlexibleBarrier-PT-22b.tgz
mv FlexibleBarrier-PT-22b execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is FlexibleBarrier-PT-22b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r090-blw7-152650001200238"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;