About the Execution of M4M.full for PermAdmissibility-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6040.800 | 337769.00 | 641105.00 | 152.30 | TTTT?FTTTTTTFTTF | 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 868K
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 481K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is PermAdmissibility-PT-20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478500502
=====================================================================
--------------------
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 PermAdmissibility-PT-20-ReachabilityCardinality-00
FORMULA_NAME PermAdmissibility-PT-20-ReachabilityCardinality-01
FORMULA_NAME PermAdmissibility-PT-20-ReachabilityCardinality-02
FORMULA_NAME PermAdmissibility-PT-20-ReachabilityCardinality-03
FORMULA_NAME PermAdmissibility-PT-20-ReachabilityCardinality-04
FORMULA_NAME PermAdmissibility-PT-20-ReachabilityCardinality-05
FORMULA_NAME PermAdmissibility-PT-20-ReachabilityCardinality-06
FORMULA_NAME PermAdmissibility-PT-20-ReachabilityCardinality-07
FORMULA_NAME PermAdmissibility-PT-20-ReachabilityCardinality-08
FORMULA_NAME PermAdmissibility-PT-20-ReachabilityCardinality-09
FORMULA_NAME PermAdmissibility-PT-20-ReachabilityCardinality-10
FORMULA_NAME PermAdmissibility-PT-20-ReachabilityCardinality-11
FORMULA_NAME PermAdmissibility-PT-20-ReachabilityCardinality-12
FORMULA_NAME PermAdmissibility-PT-20-ReachabilityCardinality-13
FORMULA_NAME PermAdmissibility-PT-20-ReachabilityCardinality-14
FORMULA_NAME PermAdmissibility-PT-20-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1527296331810
BK_STOP 1527296669579
--------------------
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 PermAdmissibility-PT-20 as instance name.
Using PermAdmissibility as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': True, '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': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 2033901, 'Memory': 15952.61, 'Tool': 'lola'}, {'Time': 2392730, 'Memory': 15952.91, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola PermAdmissibility-PT-20...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
PermAdmissibility-PT-20: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
PermAdmissibility-PT-20: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ PermAdmissibility-PT-20 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 760/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 592 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 820 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-PT-20-ReachabilityCardinality.task
lola: A (G (((2 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7) OR (out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) OR ((1 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) AND (1 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)) OR (2 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)))) : E (F ((((c19 + 1 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7) AND (in3_4 + in3_5 <= 0)) OR ((in4_6 + in4_7 + 1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) AND (in2_2 + in2_3 + 1 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7))))) : E (F (((c15 + 1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7) OR (aux5_0 + aux5_1 + aux5_4 + aux5_5 + 1 <= c9) OR ((c5 <= 1) AND ((c11 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7) OR (3 <= c9)))))) : E (F ((((3 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7) AND (c110 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7) AND (c14 <= c20)) OR ((c11 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7) AND (3 <= c9) AND (out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7))))) : A (G (((1 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) OR (c16 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) OR (c13 + 1 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) OR ((in2_2 + in2_3 <= c5) AND ((aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) OR (2 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)))))) : A (G (((in2_2 + in2_3 + 1 <= c7) OR (out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= 1) OR (aux8_2 + aux8_3 + aux8_6 + aux8_7 + 1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) OR (aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 + 1 <= c11)))) : E (F (((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 + 1 <= c13) AND ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 + 1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) OR (c15 + 1 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7))))) : E (F ((aux5_0 + aux5_1 + aux5_4 + aux5_5 + 1 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7))) : E (F ((((3 <= aux16_4) OR (aux14_0 <= out4_0) OR ((3 <= c17) AND (1 <= out8_4))) AND (2 <= aux14_4)))) : E (F ((aux8_3 + 1 <= out2_6))) : E (F (((2 <= out8_0) AND ((aux9_7 + 1 <= aux15_1) OR ((3 <= in2_3) AND (1 <= aux13_7)))))) : E (F (((3 <= out4_0) AND (out3_0 <= aux11_6) AND (aux5_1 <= 2) AND ((c19 <= 1) OR (aux9_3 <= 1))))) : A (G (((out1_7 <= out5_1) OR (1 <= out7_5)))) : E (F (((3 <= out8_1) AND (2 <= aux14_6) AND (c15 <= 1) AND ((2 <= aux6_0) OR (aux12_0 <= out4_4) OR (out3_3 <= 1))))) : E (F (((in1_1 <= 0) OR (2 <= out5_6) OR (((aux11_1 <= out5_2) OR (2 <= c7)) AND (2 <= aux15_7))))) : A (G ((((aux6_0 <= 2) OR (out4_2 + 1 <= out2_3)) AND ((out4_7 + 1 <= aux10_3) OR (aux12_7 <= 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 (((2 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7) OR (out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) OR ((1 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) AND (1 <= aux6_0 + aux6_1 + aux6_4 + aux6_5)) OR (2 <= out8_6 + out8_5 + out... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 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 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-PT-20-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-PT-20-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((c19 + 1 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7) AND (in3_4 + in3_5 <= 0)) OR ((in4_6 + in4_7 + 1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) AND (in2_2 + in2_3 + 1 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 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 PermAdmissibility-PT-20-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 48 markings, 47 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((c15 + 1 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7) OR (aux5_0 + aux5_1 + aux5_4 + aux5_5 + 1 <= c9) OR ((c5 <= 1) AND ((c11 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7) OR (3 <= c9))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 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 6 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-PT-20-ReachabilityCardinality-2.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7) AND (c110 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7) AND (c14 <= c20)) OR ((c11 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7) AND (3 <= c9) AND (out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 <= aux13_0 + aux... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-PT-20-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) OR (c16 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) OR (c13 + 1 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) OR ((in2_2 + in2_3 <= c5) AND ((aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 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 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-PT-20-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-PT-20-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 643270 markings, 748688 edges, 128654 markings/sec, 0 secs
lola: sara is running 5 secs || 1311317 markings, 1542809 edges, 133609 markings/sec, 5 secs
lola: sara is running 10 secs || 2011642 markings, 2379246 edges, 140065 markings/sec, 10 secs
lola: sara is running 15 secs || 2695294 markings, 3196111 edges, 136730 markings/sec, 15 secs
lola: sara is running 20 secs || 3373563 markings, 4005284 edges, 135654 markings/sec, 20 secs
lola: sara is running 25 secs || 4081157 markings, 4849958 edges, 141519 markings/sec, 25 secs
lola: sara is running 30 secs || 4739657 markings, 5639628 edges, 131700 markings/sec, 30 secs
lola: sara is running 35 secs || 5418236 markings, 6448559 edges, 135716 markings/sec, 35 secs
lola: sara is running 40 secs || 6097215 markings, 7260141 edges, 135796 markings/sec, 40 secs
lola: sara is running 45 secs || 6778215 markings, 8069811 edges, 136200 markings/sec, 45 secs
lola: sara is running 50 secs || 7426825 markings, 8856133 edges, 129722 markings/sec, 50 secs
lola: sara is running 55 secs || 8071133 markings, 9638909 edges, 128862 markings/sec, 55 secs
lola: sara is running 60 secs || 8720304 markings, 10427757 edges, 129834 markings/sec, 60 secs
lola: sara is running 65 secs || 9359503 markings, 11203578 edges, 127840 markings/sec, 65 secs
lola: sara is running 70 secs || 10018289 markings, 12005741 edges, 131757 markings/sec, 70 secs
lola: sara is running 75 secs || 10678904 markings, 12810018 edges, 132123 markings/sec, 75 secs
lola: sara is running 80 secs || 11338526 markings, 13609489 edges, 131924 markings/sec, 80 secs
lola: sara is running 85 secs || 11993746 markings, 14403855 edges, 131044 markings/sec, 85 secs
lola: sara is running 90 secs || 12616759 markings, 15126167 edges, 124603 markings/sec, 90 secs
lola: sara is running 95 secs || 13267766 markings, 15891246 edges, 130201 markings/sec, 95 secs
lola: sara is running 100 secs || 13900893 markings, 16638390 edges, 126625 markings/sec, 100 secs
lola: sara is running 105 secs || 14534358 markings, 17387849 edges, 126693 markings/sec, 105 secs
lola: sara is running 110 secs || 15146247 markings, 18109846 edges, 122378 markings/sec, 110 secs
lola: sara is running 115 secs || 15763094 markings, 18837035 edges, 123369 markings/sec, 115 secs
lola: sara is running 120 secs || 16352526 markings, 19534131 edges, 117886 markings/sec, 120 secs
lola: sara is running 125 secs || 16973239 markings, 20268430 edges, 124143 markings/sec, 125 secs
lola: sara is running 130 secs || 17583940 markings, 20988955 edges, 122140 markings/sec, 130 secs
lola: sara is running 135 secs || 18223639 markings, 21744990 edges, 127940 markings/sec, 135 secs
lola: sara is running 140 secs || 18852436 markings, 22484910 edges, 125759 markings/sec, 140 secs
lola: sara is running 145 secs || 19465676 markings, 23220299 edges, 122648 markings/sec, 145 secs
lola: sara is running 150 secs || 20070521 markings, 23945288 edges, 120969 markings/sec, 150 secs
lola: sara is running 155 secs || 20702117 markings, 24702245 edges, 126319 markings/sec, 155 secs
lola: sara is running 160 secs || 21339710 markings, 25467395 edges, 127519 markings/sec, 160 secs
lola: sara is running 165 secs || 21977946 markings, 26234626 edges, 127647 markings/sec, 165 secs
lola: sara is running 170 secs || 22617681 markings, 27002795 edges, 127947 markings/sec, 170 secs
lola: sara is running 175 secs || 23258380 markings, 27769311 edges, 128140 markings/sec, 175 secs
lola: sara is running 180 secs || 23792207 markings, 28411264 edges, 106765 markings/sec, 180 secs
lola: sara is running 185 secs || 24317075 markings, 29039315 edges, 104974 markings/sec, 185 secs
lola: sara is running 190 secs || 24787033 markings, 29849945 edges, 93992 markings/sec, 190 secs
lola: sara is running 195 secs || 25320428 markings, 30622062 edges, 106679 markings/sec, 195 secs
lola: sara is running 200 secs || 25748061 markings, 31387716 edges, 85527 markings/sec, 200 secs
lola: sara is running 205 secs || 26160247 markings, 32214799 edges, 82437 markings/sec, 205 secs
lola: sara is running 210 secs || 26556251 markings, 33011591 edges, 79201 markings/sec, 210 secs
lola: sara is running 215 secs || 26752174 markings, 35478283 edges, 39185 markings/sec, 215 secs
lola: sara is running 220 secs || 26964754 markings, 37419727 edges, 42516 markings/sec, 220 secs
lola: sara is running 225 secs || 27246472 markings, 37987334 edges, 56344 markings/sec, 225 secs
lola: sara is running 230 secs || 27651871 markings, 38738463 edges, 81080 markings/sec, 230 secs
lola: sara is running 235 secs || 28180327 markings, 39504229 edges, 105691 markings/sec, 235 secs
lola: sara is running 240 secs || 28671376 markings, 40208697 edges, 98210 markings/sec, 240 secs
lola: sara is running 245 secs || 29162489 markings, 40955918 edges, 98223 markings/sec, 245 secs
lola: sara is running 250 secs || 29432975 markings, 41501153 edges, 54097 markings/sec, 250 secs
lola: sara is running 255 secs || 29780043 markings, 42199963 edges, 69414 markings/sec, 255 secs
lola: sara is running 260 secs || 30213913 markings, 43071157 edges, 86774 markings/sec, 260 secs
lola: sara is running 265 secs || 30608071 markings, 43859403 edges, 78832 markings/sec, 265 secs
lola: sara is running 270 secs || 31003845 markings, 44650777 edges, 79155 markings/sec, 270 secs
lola: sara is running 275 secs || 31397436 markings, 45444440 edges, 78718 markings/sec, 275 secs
lola: sara is running 280 secs || 31645881 markings, 47223991 edges, 49689 markings/sec, 280 secs
lola: sara is running 285 secs || 31773818 markings, 49677070 edges, 25587 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((in2_2 + in2_3 + 1 <= c7) OR (out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7 <= 1) OR (aux8_2 + aux8_3 + aux8_6 + aux8_7 + 1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) OR (aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 + 1 <= c11))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 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 PermAdmissibility-PT-20-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 42 markings, 41 edges
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 + 1 <= c13) AND ((out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 + 1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7) OR (c15 + 1 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-PT-20-ReachabilityCardinality-6.sara
lola: ========================================
lola: state equation: calling and running sara
lola: ========================================
sara: try reading problem file PermAdmissibility-PT-20-ReachabilityCardinality-6.sara.
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((aux5_0 + aux5_1 + aux5_4 + aux5_5 + 1 <= out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 139 markings, 138 edges
lola: state equation: write sara problem file to PermAdmissibility-PT-20-ReachabilityCardinality-7.sara
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= aux16_4) OR (aux14_0 <= out4_0) OR ((3 <= c17) AND (1 <= out8_4))) AND (2 <= aux14_4))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================
lola: ========================================
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((aux8_3 + 1 <= out2_6)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 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 PermAdmissibility-PT-20-ReachabilityCardinality-9.sara
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-PT-20-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 33 markings, 32 edges
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= out8_0) AND ((aux9_7 + 1 <= aux15_1) OR ((3 <= in2_3) AND (1 <= aux13_7))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-PT-20-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 65 markings, 64 edges
lola: ========================================
lola: subprocess 11 will run for 649 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= out4_0) AND (out3_0 <= aux11_6) AND (aux5_1 <= 2) AND ((c19 <= 1) OR (aux9_3 <= 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 544 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 2 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-PT-20-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-PT-20-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 77 markings, 76 edges
lola: ========================================
lola: subprocess 12 will run for 811 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((out1_7 <= out5_1) OR (1 <= out7_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 544 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 PermAdmissibility-PT-20-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= out8_1) AND (2 <= aux14_6) AND (c15 <= 1) AND ((2 <= aux6_0) OR (aux12_0 <= out4_4) OR (out3_3 <= 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 544 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 3 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-PT-20-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 124 markings, 123 edges
lola: ========================================
lola: subprocess 14 will run for 1622 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((in1_1 <= 0) OR (2 <= out5_6) OR (((aux11_1 <= out5_2) OR (2 <= c7)) AND (2 <= aux15_7)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 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 6 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: state equation: write sara problem file to PermAdmissibility-PT-20-ReachabilityCardinality-14.sara
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 21 markings, 20 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 15 will run for 3245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((aux6_0 <= 2) OR (out4_2 + 1 <= out2_3)) AND ((out4_7 + 1 <= aux10_3) OR (aux12_7 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 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
sara: try reading problem file PermAdmissibility-PT-20-ReachabilityCardinality-14.sara.
lola: state equation: write sara problem file to PermAdmissibility-PT-20-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes yes unknown no yes yes yes yes yes yes no yes yes no
sara: place or transition ordering is non-deterministic
FORMULA PermAdmissibility-PT-20-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-20-ReachabilityCardinality-15 FALSE 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="PermAdmissibility-PT-20"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-20.tgz
mv PermAdmissibility-PT-20 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is PermAdmissibility-PT-20, 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 r118-csrt-152666478500502"
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 ;