Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-2979
Executing tool lola
Input is Philosophers-PT-000200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088500365
=====================================================================

--------------------
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 Philosophers-COL-000200-LTLCardinality-0
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-1
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-10
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-11
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-12
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-13
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-14
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-15
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-2
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-3
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-4
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-5
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-6
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-7
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-8
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1463705785347

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ Philosophers-PT-000200
FORMULA Philosophers-COL-000200-LTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-LTLCardinality-1 CANNOT_COMPUTE
FORMULA Philosophers-COL-000200-LTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-LTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-LTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-LTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-LTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-LTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-LTLCardinality-8 CANNOT_COMPUTE
FORMULA Philosophers-COL-000200-LTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-LTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-LTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-LTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-LTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-LTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000200-LTLCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 2000/65536 symbol table entries, 3 collisions
lola: preprocessing...
lola: finding significant places
lola: 1000 places, 1000 transitions, 600 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1400 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-COL-000200-LTLCardinality.task
lola: read: A2 <= Catch1_8 + Catch1_9 + Catch1_6 + Catch1_7 + Catch1_12 + Catch1_13 + Catch1_10 + Catch1_11 + Catch1_1 + Catch1_4 + Catch1_5 + Catch1_2 + Catch1_3 + Catch1_38 + Catch1_39 + Catch1_40 + Catch1_41 + Catch1_42 + Catch1_43 + Catch1_44 + Catch1_45 + Catch1_30 + Catch1_31 + Catch1_32 + Catch1_33 + Catch1_34 + Catch1_35 + Catch1_36 + Catch1_37 + Catch1_23 + Catch1_22 + Catch1_25 + Catch1_24 + Catch1_... (shortened)
lola: formula length: 67164
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Catch1_200 + -Catch1_199 + -Catch1_198 + -Catch1_197 + -Catch1_196 + -Catch1_195 + -Catch1_194 + -Catch1_193 + -Catch1_192 + -Catch1_191 + -Catch1_190 + -Catch1_189 + -Catch1_188 + -Catch1_187 + -Catch1_186 + -Catch1_185 + -Catch1_184 + -Catch1_183 + -Catch1_182 + -Catch1_181 + -Catch1_180 + -Catch1_179 + -Catch1_178 + -Catch1_177 + -Catch1_176 + -Catch1_175 + -Catch1_174 + -Catch1_173 + -Catch1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Philosophers-COL-000200-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_1 + Think_99 + Think_98 + Think_97 + Think_96 + Think_95 + Think_94 + Think_93 + Think_92 + Think_91 + Think_90 + Think_89 + Think_88 + Think_87 + Think_86 + Think_85 + Think_84 + Think_83 + Think_82 + Think_81 + Think_80 + Think_79 + Think_78 + Think_77 + Think_76 + Think_75 + Think_74 + Think_73 + Think_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F (G (-Catch2_99 + -Catch2_98 + -Catch2_97 + -Catch2_96 + -Catch2_95 + -Catch2_94 + -Catch2_93 + -Catch2_92 + -Catch2_91 + -Catch2_90 + -Catch2_89 + -Catch2_88 + -Catch2_87 + -Catch2_86 + -Catch2_85 + -Catch2_84 + -Catch2_83 + -Catch2_82 + -Catch2_81 + -Catch2_80 + -Catch2_79 + -Catch2_78 + -Catch2_77 + -Catch2_76 + -Catch2_75 + -Catch2_74 + -Catch2_73 + -Catch2_72 + -Catch2_71 + -Catch2_70 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G ((-Catch1_200 + -Catch1_199 + -Catch1_198 + -Catch1_197 + -Catch1_196 + -Catch1_195 + -Catch1_194 + -Catch1_193 + -Catch1_192 + -Catch1_191 + -Catch1_190 + -Catch1_189 + -Catch1_188 + -Catch1_187 + -Catch1_186 + -Catch1_185 + -Catch1_184 + -Catch1_183 + -Catch1_182 + -Catch1_181 + -Catch1_180 + -Catch1_179 + -Catch1_178 + -Catch1_177 + -Catch1_176 + -Catch1_175 + -Catch1_174 + -Catch1_173 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(G (X (-Catch1_200 + -Catch1_199 + -Catch1_198 + -Catch1_197 + -Catch1_196 + -Catch1_195 + -Catch1_194 + -Catch1_193 + -Catch1_192 + -Catch1_191 + -Catch1_190 + -Catch1_189 + -Catch1_188 + -Catch1_187 + -Catch1_186 + -Catch1_185 + -Catch1_184 + -Catch1_183 + -Catch1_182 + -Catch1_181 + -Catch1_180 + -Catch1_179 + -Catch1_178 + -Catch1_177 + -Catch1_176 + -Catch1_175 + -Catch1_174 + -Catch1_173 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_99 + -Think_98 + -Think_97 + -Think_96 + -Think_95 + -Think_94 + -Think_93 + -Think_92 + -Think_91 + -Think_90 + -Think_89 + -Think_88 + -Think_87 + -Think_86 + -Think_85 + -Think_84 + -Think_83 + -Think_82 + -Think_81 + -Think_80 + -Think_79 + -Think_78 + -Think_77 + -Think_76 + -Think_75 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Philosophers-COL-000200-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (X (Catch2_99 + Catch2_98 + Catch2_97 + Catch2_96 + Catch2_95 + Catch2_94 + Catch2_93 + Catch2_92 + Catch2_91 + Catch2_90 + Catch2_89 + Catch2_88 + Catch2_87 + Catch2_86 + Catch2_85 + Catch2_84 + Catch2_83 + Catch2_82 + Catch2_81 + Catch2_80 + Catch2_79 + Catch2_78 + Catch2_77 + Catch2_76 + Catch2_75 + Catch2_74 + Catch2_73 + Catch2_72 + Catch2_71 + Catch2_70 + Catch2_69 + Catch2_68 + Catch2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_99 + -Think_98 + -Think_97 + -Think_96 + -Think_95 + -Think_94 + -Think_93 + -Think_92 + -Think_91 + -Think_90 + -Think_89 + -Think_88 + -Think_87 + -Think_86 + -Think_85 + -Think_84 + -Think_83 + -Think_82 + -Think_81 + -Think_80 + -Think_79 + -Think_78 + -Think_77 + -Think_76 + -Think... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 8 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((X (-Catch2_99 + -Catch2_98 + -Catch2_97 + -Catch2_96 + -Catch2_95 + -Catch2_94 + -Catch2_93 + -Catch2_92 + -Catch2_91 + -Catch2_90 + -Catch2_89 + -Catch2_88 + -Catch2_87 + -Catch2_86 + -Catch2_85 + -Catch2_84 + -Catch2_83 + -Catch2_82 + -Catch2_81 + -Catch2_80 + -Catch2_79 + -Catch2_78 + -Catch2_77 + -Catch2_76 + -Catch2_75 + -Catch2_74 + -Catch2_73 + -Catch2_72 + -Catch2_71 + -Catch2_70 + -C... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F (-Catch2_99 + -Catch2_98 + -Catch2_97 + -Catch2_96 + -Catch2_95 + -Catch2_94 + -Catch2_93 + -Catch2_92 + -Catch2_91 + -Catch2_90 + -Catch2_89 + -Catch2_88 + -Catch2_87 + -Catch2_86 + -Catch2_85 + -Catch2_84 + -Catch2_83 + -Catch2_82 + -Catch2_81 + -Catch2_80 + -Catch2_79 + -Catch2_78 + -Catch2_77 + -Catch2_76 + -Catch2_75 + -Catch2_74 + -Catch2_73 + -Catch2_72 + -Catch2_71 + -Catch2_70 + -Ca... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 10 will run for 479 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (F (-Catch1_200 + -Catch1_199 + -Catch1_198 + -Catch1_197 + -Catch1_196 + -Catch1_195 + -Catch1_194 + -Catch1_193 + -Catch1_192 + -Catch1_191 + -Catch1_190 + -Catch1_189 + -Catch1_188 + -Catch1_187 + -Catch1_186 + -Catch1_185 + -Catch1_184 + -Catch1_183 + -Catch1_182 + -Catch1_181 + -Catch1_180 + -Catch1_179 + -Catch1_178 + -Catch1_177 + -Catch1_176 + -Catch1_175 + -Catch1_174 + -Catch1_173 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 11 will run for 575 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (F (-Catch2_99 + -Catch2_98 + -Catch2_97 + -Catch2_96 + -Catch2_95 + -Catch2_94 + -Catch2_93 + -Catch2_92 + -Catch2_91 + -Catch2_90 + -Catch2_89 + -Catch2_88 + -Catch2_87 + -Catch2_86 + -Catch2_85 + -Catch2_84 + -Catch2_83 + -Catch2_82 + -Catch2_81 + -Catch2_80 + -Catch2_79 + -Catch2_78 + -Catch2_77 + -Catch2_76 + -Catch2_75 + -Catch2_74 + -Catch2_73 + -Catch2_72 + -Catch2_71 + -Catch2_70 + -C... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 12 will run for 719 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_99 + -Think_98 + -Think_97 + -Think_96 + -Think_95 + -Think_94 + -Think_93 + -Think_92 + -Think_91 + -Think_90 + -Think_89 + -Think_88 + -Think_87 + -Think_86 + -Think_85 + -Think_84 + -Think_83 + -Think_82 + -Think_81 + -Think_80 + -Think_79 + -Think_78 + -Think_77 + -Think_76 + -Think_75 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Philosophers-COL-000200-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 959 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_100 + -Eat_101 + -Eat_102 + -Eat_103 + -Eat_104 + -Eat_105 + -Eat_106 + -Eat_107 + -Eat_108 + -Eat_109 + -Eat_110 + -Eat_111 + -Eat_112 + -Eat_113 + -Eat_114 + -Eat_115 + -Eat_116 + -Eat_117 + -Eat_118 + -Eat_119 + -Eat_120 + -Eat_121 + -Eat_122 + -Eat_123 + -Eat_124 + -Eat_125 + -Eat_126 + -Eat_127 + -Eat_128 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Philosophers-COL-000200-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1439 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 + Eat_100 + Eat_101 + Eat_102 + Eat_103 + Eat_104 + Eat_105 + Eat_106 + Eat_107 + Eat_108 + Eat_109 + Eat_110 + Eat_111 + Eat_112 + Eat_113 + Eat_114 + Eat_115 + Eat_116 + Eat_117 + Eat_118 + Eat_119 + Eat_120 + Eat_121 + Eat_122 + Eat_123 + Eat_124 + Eat_125 + Eat_126 + Eat_127 + Eat_128 + Eat_129 + Eat_130 + Eat_131 + Eat_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 + Eat_100 + Eat_101 + Eat_102 + Eat_103 + Eat_104 + Eat_105 + Eat_106 + Eat_107 + Eat_108 + Eat_109 + Eat_110 + Eat_111 + Eat_112 + Eat_113 + Eat_114 + Eat_115 + Eat_116 + Eat_117 + Eat_118 + Eat_119 + Eat_120 + Eat_121 + Eat_122 + Eat_123 + Eat_124 + Eat_125 + Eat_126 + Eat_127 + Eat_128 + Eat_129 + Eat_130 + Eat_131 +... (shortened)
lola: processed formula length: 4196
lola: 1079258 rewrites
lola: formula mentions 400 of 1000 places; total mentions: 400
lola: closed formula file Philosophers-COL-000200-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 76 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 15 will run for 2878 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_100 + -Eat_101 + -Eat_102 + -Eat_103 + -Eat_104 + -Eat_105 + -Eat_106 + -Eat_107 + -Eat_108 + -Eat_109 + -Eat_110 + -Eat_111 + -Eat_112 + -Eat_113 + -Eat_114 + -Eat_115 + -Eat_116 + -Eat_117 + -Eat_118 + -Eat_119 + -Eat_120 + -Eat_121 + -Eat_122 + -Eat_123 + -Eat_124 + -Eat_125 + -Eat_126 + -Eat_127 + -Eat_128 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Philosophers-COL-000200-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: RESULT
lola: summary: no unknown no no no yes no no unknown no no yes yes no yes no

BK_STOP 1463706447976

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-000200"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/Philosophers-PT-000200.tgz
mv Philosophers-PT-000200 execution

# this is for BenchKit: explicit launching of the test

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