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 6.1M
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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 11K 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 8.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 5.9M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Dekker-PT-100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-blw3-152649949300102
=====================================================================

--------------------
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 Dekker-PT-100-CTLFireability-00
FORMULA_NAME Dekker-PT-100-CTLFireability-01
FORMULA_NAME Dekker-PT-100-CTLFireability-02
FORMULA_NAME Dekker-PT-100-CTLFireability-03
FORMULA_NAME Dekker-PT-100-CTLFireability-04
FORMULA_NAME Dekker-PT-100-CTLFireability-05
FORMULA_NAME Dekker-PT-100-CTLFireability-06
FORMULA_NAME Dekker-PT-100-CTLFireability-07
FORMULA_NAME Dekker-PT-100-CTLFireability-08
FORMULA_NAME Dekker-PT-100-CTLFireability-09
FORMULA_NAME Dekker-PT-100-CTLFireability-10
FORMULA_NAME Dekker-PT-100-CTLFireability-11
FORMULA_NAME Dekker-PT-100-CTLFireability-12
FORMULA_NAME Dekker-PT-100-CTLFireability-13
FORMULA_NAME Dekker-PT-100-CTLFireability-14
FORMULA_NAME Dekker-PT-100-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1527404064673


BK_STOP 1527404352987

--------------------
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 Dekker-PT-100 as instance name.
Using Dekker as model name.
Using algorithm or tool voting-classifier.
Model characteristics are: {'Examination': 'CTLFireability', '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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
/usr/local/lib/python3.6/dist-packages/sklearn/preprocessing/label.py:151: DeprecationWarning: The truth value of an empty array is ambiguous. Returning False, but in future this will result in an error. Use `array.size > 0` to check that an array is not empty.
if diff:
Known tools are: [{'Time': 176456, 'Memory': 1650.16, 'Tool': 'gspn'}, {'Time': 468478, 'Memory': 1680.12, 'Tool': 'gspn'}, {'Time': 509418, 'Memory': 2845.27, 'Tool': 'itstools'}, {'Time': 567802, 'Memory': 2805.62, 'Tool': 'itstools'}, {'Time': 1074292, 'Memory': 15952.48, 'Tool': 'lola'}, {'Time': 1078344, 'Memory': 15942.5, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 6.088157954390896x far from the best tool gspn.
CTLFireability lola Dekker-PT-100...

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


checking for too many tokens
===========================================================================================
Dekker-PT-100: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ Dekker-PT-100 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- 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: 10700/65536 symbol table entries, 4008 collisions
lola: preprocessing...
lola: finding significant places
lola: 500 places, 10200 transitions, 200 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 20300 transition conflict sets
lola: TASK
lola: reading formula from Dekker-PT-100-CTLFireability.task
lola: (E ((FIREABLE(withdraw_93_1) U (NOT FIREABLE(withdraw_62_76) AND NOT FIREABLE(withdraw_86_32)))) AND ((E (F ((FIREABLE(withdraw_63_38) AND FIREABLE(withdraw_51_48)))) OR (FIREABLE(withdraw_72_90) AND NOT FIREABLE(exit_57) AND ((FIREABLE(withdraw_13_72) AND FIREABLE(withdraw_61_33)) OR NOT FIREABLE(withdraw_71_24)))) AND A (((FIREABLE(withdraw_66_22) AND FIREABLE(withdraw_8_7)) U NOT FIREABLE(withdraw_55_92))))) : E (F ((A ((FIREABLE(withdraw_18_92) U FIREABLE(withdraw_50_76))) AND E (X ((FIREABLE(withdraw_87_50) OR FIREABLE(withdraw_65_18))))))) : NOT((A (X (((FIREABLE(withdraw_63_25) AND FIREABLE(withdraw_72_12)) OR (FIREABLE(withdraw_30_38) AND FIREABLE(withdraw_21_0))))) OR NOT(NOT(A (F (FIREABLE(withdraw_56_49))))))) : E (F (NOT(A (F (NOT FIREABLE(withdraw_91_30)))))) : E ((E (F ((FIREABLE(withdraw_75_78) OR FIREABLE(withdraw_58_25)))) U (A (F (FIREABLE(withdraw_50_27))) AND E (F (FIREABLE(withdraw_17_65)))))) : NOT(E (F (A (G (NOT FIREABLE(withdraw_97_33)))))) : A ((NOT(E (G (FIREABLE(withdraw_52_21)))) U E (F ((FIREABLE(withdraw_53_75) AND FIREABLE(withdraw_56_21)))))) : (FIREABLE(withdraw_74_40) OR (E (((FIREABLE(withdraw_71_76) OR FIREABLE(withdraw_85_89)) U (FIREABLE(withdraw_83_68) OR FIREABLE(withdraw_76_84)))) OR E (F (E (X (FIREABLE(withdraw_12_82))))))) : (E (((NOT FIREABLE(withdraw_1_89) OR NOT FIREABLE(withdraw_4_30)) U A (X (FIREABLE(withdraw_68_35))))) OR E (G (FIREABLE(withdraw_77_53)))) : E (F (FIREABLE(withdraw_6_11))) : (FIREABLE(withdraw_6_60) OR (E (F (FIREABLE(withdraw_94_72))) OR (NOT(E (F (FIREABLE(withdraw_43_95)))) AND FIREABLE(withdraw_74_96)))) : E (F (E ((FIREABLE(withdraw_8_42) U FIREABLE(withdraw_21_81))))) : NOT(E (F ((NOT FIREABLE(withdraw_91_5) AND FIREABLE(withdraw_14_27))))) : E (X (E (X (E (X (FIREABLE(withdraw_15_3))))))) : A ((NOT FIREABLE(withdraw_97_22) U FIREABLE(withdraw_52_75))) : E (F (E (G (FIREABLE(withdraw_45_19)))))
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 ((FIREABLE(withdraw_93_1) U (NOT FIREABLE(withdraw_62_76) AND NOT FIREABLE(withdraw_86_32)))) AND ((E (F ((FIREABLE(withdraw_63_38) AND FIREABLE(withdraw_51_48)))) OR (FIREABLE(withdraw_72_90) AND NOT FIREABLE(exit_57) AND ((FIREABLE(withdraw_13_72) AND FIREABLE(withdraw_61_33)) OR NOT FIREABLE(withdraw_71_24)))) AND A (((FIREABLE(withdraw_66_22) AND FIREABLE(withdraw_8_7)) U NOT FIREABLE(with... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(withdraw_93_1) U (NOT FIREABLE(withdraw_62_76) AND NOT FIREABLE(withdraw_86_32))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(FIREABLE(withdraw_93_1) U (NOT FIREABLE(withdraw_62_76) AND NOT FIREABLE(withdraw_86_32)))
lola: processed formula length: 92
lola: 1 rewrites
lola: formula mentions 0 of 500 places; total mentions: 0
lola: closed formula file Dekker-PT-100-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(withdraw_63_38) AND FIREABLE(withdraw_51_48))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(withdraw_66_22) AND FIREABLE(withdraw_8_7)) U NOT FIREABLE(withdraw_55_92)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((FIREABLE(withdraw_66_22) AND FIREABLE(withdraw_8_7)) U NOT FIREABLE(withdraw_55_92)))
lola: processed formula: A (((FIREABLE(withdraw_66_22) AND FIREABLE(withdraw_8_7)) U NOT FIREABLE(withdraw_55_92)))
lola: processed formula length: 90
lola: 0 rewrites
lola: formula mentions 0 of 500 places; total mentions: 0
lola: closed formula file Dekker-PT-100-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A ((FIREABLE(withdraw_18_92) U FIREABLE(withdraw_50_76))) AND E (X ((FIREABLE(withdraw_87_50) OR FIREABLE(withdraw_65_18)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (A(FIREABLE(withdraw_18_92) U FIREABLE(withdraw_50_76)) AND EX((FIREABLE(withdraw_87_50) OR FIREABLE(withdraw_65_18)))))
lola: processed formula length: 130
lola: 3 rewrites
lola: formula mentions 0 of 500 places; total mentions: 0
lola: closed formula file Dekker-PT-100-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2261 markings, 169962 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (X (((FIREABLE(withdraw_63_25) AND FIREABLE(withdraw_72_12)) OR (FIREABLE(withdraw_30_38) AND FIREABLE(withdraw_21_0))))) OR NOT(NOT(A (F (FIREABLE(withdraw_56_49)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((NOT FIREABLE(withdraw_63_25) OR NOT FIREABLE(withdraw_72_12)) AND (NOT FIREABLE(withdraw_30_38) OR NOT FIREABLE(withdraw_21_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((NOT FIREABLE(withdraw_63_25) OR NOT FIREABLE(withdraw_72_12)) AND (NOT FIREABLE(withdraw_30_38) OR NOT FIREABLE(withdraw_21_0))))
lola: processed formula length: 136
lola: 14 rewrites
lola: formula mentions 0 of 500 places; total mentions: 0
lola: closed formula file Dekker-PT-100-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(withdraw_56_49)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(withdraw_56_49)))
lola: processed formula length: 39
lola: 15 rewrites
lola: formula mentions 0 of 500 places; total mentions: 0
lola: closed formula file Dekker-PT-100-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 5 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(A (F (NOT FIREABLE(withdraw_91_30))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U NOT FIREABLE(withdraw_91_30))))
lola: processed formula length: 53
lola: 6 rewrites
lola: formula mentions 0 of 500 places; total mentions: 0
lola: closed formula file Dekker-PT-100-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 11406 markings, 1521939 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((FIREABLE(withdraw_75_78) OR FIREABLE(withdraw_58_25)))) U (A (F (FIREABLE(withdraw_50_27))) AND E (F (FIREABLE(withdraw_17_65))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (FIREABLE(withdraw_75_78) OR FIREABLE(withdraw_58_25))) U (A(TRUE U FIREABLE(withdraw_50_27)) AND E(TRUE U FIREABLE(withdraw_17_65))))
lola: processed formula length: 146
lola: 4 rewrites
lola: formula mentions 0 of 500 places; total mentions: 0
lola: closed formula file Dekker-PT-100-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 4 significant temporal operators and needs 17 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 31118 markings, 6023265 edges, 3689329903141912576 markings/sec, 0 secs
lola: 58905 markings, 13003947 edges, 5557 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 74468 markings, 17150708 edges
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (G (NOT FIREABLE(withdraw_97_33))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U FIREABLE(withdraw_97_33)))))
lola: processed formula length: 54
lola: 7 rewrites
lola: formula mentions 0 of 500 places; total mentions: 0
lola: closed formula file Dekker-PT-100-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 28943 markings, 6496516 edges, 3689329903141912576 markings/sec, 0 secs
lola: 55630 markings, 13104243 edges, 5337 markings/sec, 5 secs
lola: 79611 markings, 19702131 edges, 4796 markings/sec, 10 secs
lola: 101777 markings, 26515646 edges, 4433 markings/sec, 15 secs
lola: 124730 markings, 33321626 edges, 4591 markings/sec, 20 secs
lola: 144859 markings, 40056616 edges, 4026 markings/sec, 25 secs
lola: 166996 markings, 46602475 edges, 4427 markings/sec, 30 secs
lola: 188455 markings, 53367911 edges, 4292 markings/sec, 35 secs
lola: 208743 markings, 60075986 edges, 4058 markings/sec, 40 secs
lola: 228718 markings, 66917882 edges, 3995 markings/sec, 45 secs
lola: 249643 markings, 73725519 edges, 4185 markings/sec, 50 secs
lola: 269339 markings, 80593828 edges, 3939 markings/sec, 55 secs
lola: 288554 markings, 87385116 edges, 3843 markings/sec, 60 secs
lola: 307565 markings, 94215689 edges, 3802 markings/sec, 65 secs
lola: 326370 markings, 100953248 edges, 3761 markings/sec, 70 secs
lola: 342947 markings, 107842622 edges, 3315 markings/sec, 75 secs
lola: 363937 markings, 114450133 edges, 4198 markings/sec, 80 secs
lola: 382371 markings, 121078374 edges, 3687 markings/sec, 85 secs
lola: 400329 markings, 127824002 edges, 3592 markings/sec, 90 secs
lola: 420814 markings, 134479634 edges, 4097 markings/sec, 95 secs
lola: 439221 markings, 141213516 edges, 3681 markings/sec, 100 secs
lola: 458467 markings, 147835756 edges, 3849 markings/sec, 105 secs
lola: 478786 markings, 154306938 edges, 4064 markings/sec, 110 secs
lola: 499074 markings, 160781040 edges, 4058 markings/sec, 115 secs
lola: 517269 markings, 167312536 edges, 3639 markings/sec, 120 secs
lola: 536305 markings, 173986316 edges, 3807 markings/sec, 125 secs
lola: 554847 markings, 180701472 edges, 3708 markings/sec, 130 secs
lola: 573238 markings, 187434142 edges, 3678 markings/sec, 135 secs
lola: 592096 markings, 194084023 edges, 3772 markings/sec, 140 secs
lola: 611485 markings, 200595727 edges, 3878 markings/sec, 145 secs
lola: 630619 markings, 206976849 edges, 3827 markings/sec, 150 secs
lola: 647753 markings, 212748438 edges, 3427 markings/sec, 155 secs
lola: 663735 markings, 218578580 edges, 3196 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 335 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NOT(E (G (FIREABLE(withdraw_52_21)))) U E (F ((FIREABLE(withdraw_53_75) AND FIREABLE(withdraw_56_21))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U NOT FIREABLE(withdraw_52_21)) U E(TRUE U (FIREABLE(withdraw_53_75) AND FIREABLE(withdraw_56_21))))
lola: processed formula length: 109
lola: 6 rewrites
lola: formula mentions 0 of 500 places; total mentions: 0
lola: closed formula file Dekker-PT-100-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 34473 markings, 6718654 edges, 6895 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 39923 markings, 8211936 edges
lola: ========================================
lola: subprocess 7 will run for 372 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(withdraw_74_40) OR (E (((FIREABLE(withdraw_71_76) OR FIREABLE(withdraw_85_89)) U (FIREABLE(withdraw_83_68) OR FIREABLE(withdraw_76_84)))) OR E (F (E (X (FIREABLE(withdraw_12_82)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 372 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(withdraw_74_40)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(withdraw_74_40)
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 500 places; total mentions: 0
lola: closed formula file Dekker-PT-100-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 418 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((FIREABLE(withdraw_71_76) OR FIREABLE(withdraw_85_89)) U (FIREABLE(withdraw_83_68) OR FIREABLE(withdraw_76_84))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((FIREABLE(withdraw_71_76) OR FIREABLE(withdraw_85_89)) U (FIREABLE(withdraw_83_68) OR FIREABLE(withdraw_76_84)))
lola: processed formula length: 116
lola: 1 rewrites
lola: formula mentions 0 of 500 places; total mentions: 0
lola: closed formula file Dekker-PT-100-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 478 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X (FIREABLE(withdraw_12_82)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX(FIREABLE(withdraw_12_82)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 500 places; total mentions: 0
lola: closed formula file Dekker-PT-100-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 56 markings, 388 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 418 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((NOT FIREABLE(withdraw_1_89) OR NOT FIREABLE(withdraw_4_30)) U A (X (FIREABLE(withdraw_68_35))))) OR E (G (FIREABLE(withdraw_77_53))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 418 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((NOT FIREABLE(withdraw_1_89) OR NOT FIREABLE(withdraw_4_30)) U A (X (FIREABLE(withdraw_68_35)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((NOT FIREABLE(withdraw_1_89) OR NOT FIREABLE(withdraw_4_30)) U AX(FIREABLE(withdraw_68_35)))
lola: processed formula length: 95
lola: 2 rewrites
lola: formula mentions 0 of 500 places; total mentions: 0
lola: closed formula file Dekker-PT-100-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 24 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 30127 markings, 5710216 edges, 5885 markings/sec, 0 secs
lola: 52103 markings, 11174005 edges, 4395 markings/sec, 5 secs
lola: 72024 markings, 16407569 edges, 3984 markings/sec, 10 secs
lola: 90067 markings, 22100592 edges, 3609 markings/sec, 15 secs
lola: 110258 markings, 27931335 edges, 4038 markings/sec, 20 secs
lola: 129784 markings, 33694497 edges, 3905 markings/sec, 25 secs
lola: 147439 markings, 39610843 edges, 3531 markings/sec, 30 secs
lola: 166953 markings, 45341297 edges, 3903 markings/sec, 35 secs
lola: 186125 markings, 51276444 edges, 3834 markings/sec, 40 secs
lola: 203973 markings, 57327028 edges, 3570 markings/sec, 45 secs
lola: 222594 markings, 63299568 edges, 3724 markings/sec, 50 secs
lola: 239506 markings, 69356945 edges, 3382 markings/sec, 55 secs
lola: 258179 markings, 75245993 edges, 3735 markings/sec, 60 secs
lola: 274983 markings, 81290482 edges, 3361 markings/sec, 65 secs
lola: 292608 markings, 87149786 edges, 3525 markings/sec, 70 secs
lola: 308651 markings, 93208084 edges, 3209 markings/sec, 75 secs
lola: 325437 markings, 99073811 edges, 3357 markings/sec, 80 secs
lola: 340045 markings, 105163307 edges, 2922 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '\ufffd'
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA Dekker-PT-100-CTLFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-CTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-CTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-CTLFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-CTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-CTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-CTLFireability-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-CTLFireability-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-CTLFireability-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-CTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-CTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-100-CTLFireability-15 CANNOT_COMPUTE 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="Dekker-PT-100"
export BK_EXAMINATION="CTLFireability"
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/Dekker-PT-100.tgz
mv Dekker-PT-100 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 Dekker-PT-100, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r082-blw3-152649949300102"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;