About the Execution of Irma.struct for Peterson-COL-2
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
427.420 | 43842.00 | 5795.00 | 160.90 | FTFFFFFFFFFFFFFF | 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 212K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K 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.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 42K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is Peterson-COL-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r259-csrt-152732584700148
=====================================================================
--------------------
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 Peterson-COL-2-LTLFireability-00
FORMULA_NAME Peterson-COL-2-LTLFireability-01
FORMULA_NAME Peterson-COL-2-LTLFireability-02
FORMULA_NAME Peterson-COL-2-LTLFireability-03
FORMULA_NAME Peterson-COL-2-LTLFireability-04
FORMULA_NAME Peterson-COL-2-LTLFireability-05
FORMULA_NAME Peterson-COL-2-LTLFireability-06
FORMULA_NAME Peterson-COL-2-LTLFireability-07
FORMULA_NAME Peterson-COL-2-LTLFireability-08
FORMULA_NAME Peterson-COL-2-LTLFireability-09
FORMULA_NAME Peterson-COL-2-LTLFireability-10
FORMULA_NAME Peterson-COL-2-LTLFireability-11
FORMULA_NAME Peterson-COL-2-LTLFireability-12
FORMULA_NAME Peterson-COL-2-LTLFireability-13
FORMULA_NAME Peterson-COL-2-LTLFireability-14
FORMULA_NAME Peterson-COL-2-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1527463377772
BK_STOP 1527463421614
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Peterson-COL-2 as instance name.
Using Peterson as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLFireability', 'Place/Transition': True, 'Colored': True, '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}.
Known tools are: [{'Time': 195, 'Memory': 106.1, 'Tool': 'lola'}, {'Time': 251, 'Memory': 107.3, 'Tool': 'lola'}, {'Time': 13465, 'Memory': 541.98, 'Tool': 'itstools'}, {'Time': 14577, 'Memory': 524.06, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLFireability lola Peterson-COL-2...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
Peterson-COL-2: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
Peterson-COL-2: translating COL formula LTLFireability into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
LTLFireability @ Peterson-COL-2 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 246/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 108 places, 138 transitions, 97 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 213 transition conflict sets
lola: TASK
lola: reading formula from Peterson-COL-2-LTLFireability.task
lola: A (G (G (G (X (G ((FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72)))))))) : A ((FIREABLE(t95) OR FIREABLE(t94) OR FIREABLE(t93))) : A ((G (X (X ((FIREABLE(t101) OR FIREABLE(t100) OR FIREABLE(t99) OR FIREABLE(t98) OR FIREABLE(t97) OR FIREABLE(t96))))) U (X ((FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48))) U F ((FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48)))))) : A ((((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) U (FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72))) U G (F (X ((FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12))))))) : A (((FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72)) U G (F (G ((FIREABLE(t116) OR FIREABLE(t115) OR FIREABLE(t114))))))) : A (F ((((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24)) U (FIREABLE(t119) OR FIREABLE(t118) OR FIREABLE(t117))) U ((FIREABLE(t137) OR FIREABLE(t136) OR FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132) OR FIREABLE(t131) OR FIREABLE(t130) OR FIREABLE(t129) OR FIREABLE(t128) OR FIREABLE(t127) OR FIREABLE(t126) OR FIREABLE(t125) OR FIREABLE(t124) OR FIREABLE(t123) OR FIREABLE(t122) OR FIREABLE(t121) OR FIREABLE(t120)) U (FIREABLE(t113) OR FIREABLE(t112) OR FIREABLE(t111) OR FIREABLE(t110) OR FIREABLE(t109) OR FIREABLE(t108) OR FIREABLE(t107) OR FIREABLE(t106) OR FIREABLE(t105) OR FIREABLE(t104) OR FIREABLE(t103) OR FIREABLE(t102)))))) : A (F ((F (X ((FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR FIREABLE(t82) OR FIREABLE(t81) OR FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75)))) U ((FIREABLE(t101) OR FIREABLE(t100) OR FIREABLE(t99) OR FIREABLE(t98) OR FIREABLE(t97) OR FIREABLE(t96)) U (FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR FIREABLE(t82) OR FIREABLE(t81) OR FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75)))))) : A (F (G (G (G (G ((FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72)))))))) : A (X ((F (X ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66)))) U ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) U (FIREABLE(t113) OR FIREABLE(t112) OR FIREABLE(t111) OR FIREABLE(t110) OR FIREABLE(t109) OR FIREABLE(t108) OR FIREABLE(t107) OR FIREABLE(t106) OR FIREABLE(t105) OR FIREABLE(t104) OR FIREABLE(t103) OR FIREABLE(t102)))))) : A ((FIREABLE(t119) OR FIREABLE(t118) OR FIREABLE(t117))) : A ((X ((FIREABLE(t137) OR FIREABLE(t136) OR FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132) OR FIREABLE(t131) OR FIREABLE(t130) OR FIREABLE(t129) OR FIREABLE(t128) OR FIREABLE(t127) OR FIREABLE(t126) OR FIREABLE(t125) OR FIREABLE(t124) OR FIREABLE(t123) OR FIREABLE(t122) OR FIREABLE(t121) OR FIREABLE(t120))) U X (F (X ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))))))) : A ((X (X (X ((FIREABLE(t95) OR FIREABLE(t94) OR FIREABLE(t93))))) U G ((FIREABLE(t137) OR FIREABLE(t136) OR FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132) OR FIREABLE(t131) OR FIREABLE(t130) OR FIREABLE(t129) OR FIREABLE(t128) OR FIREABLE(t127) OR FIREABLE(t126) OR FIREABLE(t125) OR FIREABLE(t124) OR FIREABLE(t123) OR FIREABLE(t122) OR FIREABLE(t121) OR FIREABLE(t120))))) : A ((FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR FIREABLE(t82) OR FIREABLE(t81) OR FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75))) : A (X (F (X ((FIREABLE(t119) OR FIREABLE(t118) OR FIREABLE(t117)))))) : A ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))) : A ((F ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))) U (FIREABLE(t119) OR FIREABLE(t118) OR FIREABLE(t117))))
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 (G (G (X (G ((FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (G (X (G ((FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72))))))))
lola: processed formula: A (G (G (G (X (G ((FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72))))))))
lola: processed formula length: 75
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t95) OR FIREABLE(t94) OR FIREABLE(t93)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t95) OR FIREABLE(t94) OR FIREABLE(t93))
lola: processed formula length: 51
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-LTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X (X ((FIREABLE(t101) OR FIREABLE(t100) OR FIREABLE(t99) OR FIREABLE(t98) OR FIREABLE(t97) OR FIREABLE(t96))))) U (X ((FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (X (X ((FIREABLE(t101) OR FIREABLE(t100) OR FIREABLE(t99) OR FIREABLE(t98) OR FIREABLE(t97) OR FIREABLE(t96))))) U (X ((FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48))) U F ((FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR FIREABLE(t50) OR FIREABLE(t49) OR FIREABLE(t48))))))
lola: processed formula: A ((G (X (X ((FIREABLE(t101) OR FIREABLE(t100) OR FIREABLE(t99) OR FIREABLE(t98) OR FIREABLE(t97) OR FIREABLE(t96))))) U (X ((FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60) OR FIREABLE(t59) OR FIREABLE(t58) OR FIREABLE(t57) OR FIREABLE(t56) OR FIREABLE(t55) OR FIREABLE(t54) OR FIREABLE(t53) OR FIREABLE(t52) OR FIREABLE(t51) OR ... (shortened)
lola: processed formula length: 783
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 62 markings, 62 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) U (FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72))) U G (F (X ((FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) U (FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72))) U G (F (X ((FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREABLE(t15) OR FIREABLE(t14) OR FIREABLE(t13) OR FIREABLE(t12)))))))
lola: processed formula: A ((((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) U (FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72))) U G (F (X ((FIREABLE(t23) OR FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR... (shortened)
lola: processed formula length: 493
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-LTLFireability.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72)) U G (F (G ((FIREABLE(t116) OR FIREABLE(t115) OR FIREABLE(t114)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72)) U F (G ((FIREABLE(t116) OR FIREABLE(t115) OR FIREABLE(t114))))))
lola: processed formula: A (((FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72)) U F (G ((FIREABLE(t116) OR FIREABLE(t115) OR FIREABLE(t114))))))
lola: processed formula length: 122
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 29 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 21 markings, 22 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24)) U (FIREABLE(t119) OR FIREABLE(t118) OR FIREABLE(t117))) U ((FIREABLE(t137) OR FIREABLE(t136) OR FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132) OR FIREABLE(t131) OR FIREABLE(t130) OR FIREABLE(t129) OR FIREABLE(t128) OR FIREABLE(t127) OR FIREABLE(t126) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24)) U (FIREABLE(t119) OR FIREABLE(t118) OR FIREABLE(t117))) U ((FIREABLE(t137) OR FIREABLE(t136) OR FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132) OR FIREABLE(t131) OR FIREABLE(t130) OR FIREABLE(t129) OR FIREABLE(t128) OR FIREABLE(t127) OR FIREABLE(t126) OR FIREABLE(t125) OR FIREABLE(t124) OR FIREABLE(t123) OR FIREABLE(t122) OR FIREABLE(t121) OR FIREABLE(t120)) U (FIREABLE(t113) OR FIREABLE(t112) OR FIREABLE(t111) OR FIREABLE(t110) OR FIREABLE(t109) OR FIREABLE(t108) OR FIREABLE(t107) OR FIREABLE(t106) OR FIREABLE(t105) OR FIREABLE(t104) OR FIREABLE(t103) OR FIREABLE(t102))))))
lola: processed formula: A (F ((((FIREABLE(t29) OR FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24)) U (FIREABLE(t119) OR FIREABLE(t118) OR FIREABLE(t117))) U ((FIREABLE(t137) OR FIREABLE(t136) OR FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132) OR FIREABLE(t131) OR FIREABLE(t130) OR FIREABLE(t129) OR FIREABLE(t128) OR FIREABLE(t127) OR FIREABLE(t126) ... (shortened)
lola: processed formula length: 746
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F (X ((FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR FIREABLE(t82) OR FIREABLE(t81) OR FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75)))) U ((FIREABLE(t101) OR FIREABLE(t100) OR FIREABLE(t99) OR FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F (X ((FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR FIREABLE(t82) OR FIREABLE(t81) OR FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75)))) U ((FIREABLE(t101) OR FIREABLE(t100) OR FIREABLE(t99) OR FIREABLE(t98) OR FIREABLE(t97) OR FIREABLE(t96)) U (FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR FIREABLE(t82) OR FIREABLE(t81) OR FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75))))))
lola: processed formula: A (F ((F (X ((FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR FIREABLE(t82) OR FIREABLE(t81) OR FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75)))) U ((FIREABLE(t101) OR FIREABLE(t100) OR FIREABLE(t99) OR FIR... (shortened)
lola: processed formula length: 775
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2615 markings, 4556 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G (G (G ((FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (G (G (G ((FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72))))))))
lola: processed formula: A (F (G (G (G (G ((FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72))))))))
lola: processed formula length: 75
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 29 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 35 markings, 36 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F (X ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66)))) U ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) U (FIREABLE(t113) OR FIREABLE(t112) OR FIREABLE(t111) OR FIREABLE(t11... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((F (X ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66)))) U ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) U (FIREABLE(t113) OR FIREABLE(t112) OR FIREABLE(t111) OR FIREABLE(t110) OR FIREABLE(t109) OR FIREABLE(t108) OR FIREABLE(t107) OR FIREABLE(t106) OR FIREABLE(t105) OR FIREABLE(t104) OR FIREABLE(t103) OR FIREABLE(t102))))))
lola: processed formula: A (X ((F (X ((FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66)))) U ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)) U (FIREABLE(t113) OR FIREABLE(t112) OR FIREABLE(t111) OR FIREABLE(t11... (shortened)
lola: processed formula length: 559
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-LTLFireability.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t119) OR FIREABLE(t118) OR FIREABLE(t117)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t119) OR FIREABLE(t118) OR FIREABLE(t117))
lola: processed formula length: 54
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-LTLFireability.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 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((FIREABLE(t137) OR FIREABLE(t136) OR FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132) OR FIREABLE(t131) OR FIREABLE(t130) OR FIREABLE(t129) OR FIREABLE(t128) OR FIREABLE(t127) OR FIREABLE(t126) OR FIREABLE(t125) OR FIREABLE(t124) OR FIREABLE(t123) OR FIREABLE(t122) OR FIREABLE(t121) OR FIREABLE(t120))) U X (F (X ((FIREABLE(t11) OR FIREABLE(t10) OR FIRE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((FIREABLE(t137) OR FIREABLE(t136) OR FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132) OR FIREABLE(t131) OR FIREABLE(t130) OR FIREABLE(t129) OR FIREABLE(t128) OR FIREABLE(t127) OR FIREABLE(t126) OR FIREABLE(t125) OR FIREABLE(t124) OR FIREABLE(t123) OR FIREABLE(t122) OR FIREABLE(t121) OR FIREABLE(t120)) U F (X ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)))))))
lola: processed formula: A (X (((FIREABLE(t137) OR FIREABLE(t136) OR FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132) OR FIREABLE(t131) OR FIREABLE(t130) OR FIREABLE(t129) OR FIREABLE(t128) OR FIREABLE(t127) OR FIREABLE(t126) OR FIREABLE(t125) OR FIREABLE(t124) OR FIREABLE(t123) OR FIREABLE(t122) OR FIREABLE(t121) OR FIREABLE(t120)) U F (X ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE... (shortened)
lola: processed formula length: 563
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 791 markings, 1130 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X (X ((FIREABLE(t95) OR FIREABLE(t94) OR FIREABLE(t93))))) U G ((FIREABLE(t137) OR FIREABLE(t136) OR FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132) OR FIREABLE(t131) OR FIREABLE(t130) OR FIREABLE(t129) OR FIREABLE(t128) OR FIREABLE(t127) OR FIREABLE(t126) OR FIREABLE(t125) OR FIREABLE(t124) OR FIREABLE(t123) OR FIREABLE(t122) OR FIREABLE(t121) OR FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (X (X ((FIREABLE(t95) OR FIREABLE(t94) OR FIREABLE(t93))))) U G ((FIREABLE(t137) OR FIREABLE(t136) OR FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132) OR FIREABLE(t131) OR FIREABLE(t130) OR FIREABLE(t129) OR FIREABLE(t128) OR FIREABLE(t127) OR FIREABLE(t126) OR FIREABLE(t125) OR FIREABLE(t124) OR FIREABLE(t123) OR FIREABLE(t122) OR FIREABLE(t121) OR FIREABLE(t120)))))
lola: processed formula: A ((X (X (X ((FIREABLE(t95) OR FIREABLE(t94) OR FIREABLE(t93))))) U G ((FIREABLE(t137) OR FIREABLE(t136) OR FIREABLE(t135) OR FIREABLE(t134) OR FIREABLE(t133) OR FIREABLE(t132) OR FIREABLE(t131) OR FIREABLE(t130) OR FIREABLE(t129) OR FIREABLE(t128) OR FIREABLE(t127) OR FIREABLE(t126) OR FIREABLE(t125) OR FIREABLE(t124) OR FIREABLE(t123) OR FIREABLE(t122) OR FIREABLE(t121) OR FIR... (shortened)
lola: processed formula length: 415
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-LTLFireability.task
lola: the resulting B\xfcchi automaton has 10 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 27 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR FIREABLE(t82) OR FIREABLE(t81) OR FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t92) OR FIREABLE(t91) OR FIREABLE(t90) OR FIREABLE(t89) OR FIREABLE(t88) OR FIREABLE(t87) OR FIREABLE(t86) OR FIREABLE(t85) OR FIREABLE(t84) OR FIREABLE(t83) OR FIREABLE(t82) OR FIREABLE(t81) OR FIREABLE(t80) OR FIREABLE(t79) OR FIREABLE(t78) OR FIREABLE(t77) OR FIREABLE(t76) OR FIREABLE(t75))
lola: processed formula length: 321
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-LTLFireability.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 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X ((FIREABLE(t119) OR FIREABLE(t118) OR FIREABLE(t117))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (X ((FIREABLE(t119) OR FIREABLE(t118) OR FIREABLE(t117))))))
lola: processed formula: A (X (F (X ((FIREABLE(t119) OR FIREABLE(t118) OR FIREABLE(t117))))))
lola: processed formula length: 70
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 8 markings, 8 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))
lola: processed formula length: 203
lola: 1 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-LTLFireability.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 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))) U (FIREABLE(t119) OR FIREABLE(t118) OR FIREABLE(t117))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))) U (FIREABLE(t119) OR FIREABLE(t118) OR FIREABLE(t117))))
lola: processed formula: A ((F ((FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREABLE(t5) OR FIREABLE(t4) OR FIREABLE(t3) OR FIREABLE(t2) OR FIREABLE(t1) OR FIREABLE(t0))) U (FIREABLE(t119) OR FIREABLE(t118) OR FIREABLE(t117))))
lola: processed formula length: 270
lola: 0 rewrites
lola: formula mentions 0 of 108 places; total mentions: 0
lola: closed formula file Peterson-COL-2-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 16 bytes per marking, with 29 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 524 markings, 607 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no no no no no no no no no no no
FORMULA Peterson-COL-2-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-LTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Peterson-COL-2-LTLFireability-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="Peterson-COL-2"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="irma4mcc-structural"
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/Peterson-COL-2.tgz
mv Peterson-COL-2 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is Peterson-COL-2, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r259-csrt-152732584700148"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 ;