About the Execution of Irma.full for QuasiCertifProtocol-COL-28
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
424.610 | 50487.00 | 15935.00 | 1007.30 | FFFFFFFFFFFFFFFF | 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 276K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 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.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.9K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 120K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is QuasiCertifProtocol-COL-28, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-qhx2-152732138600052
=====================================================================
--------------------
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 QuasiCertifProtocol-COL-28-LTLFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-28-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1528241522942
BK_STOP 1528241573429
--------------------
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 QuasiCertifProtocol-COL-28 as instance name.
Using QuasiCertifProtocol 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': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': False}.
Known tools are: [{'Time': 166, 'Memory': 106.96, 'Tool': 'lola'}, {'Time': 804820, 'Memory': 15952.87, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLFireability lola QuasiCertifProtocol-COL-28...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
QuasiCertifProtocol-COL-28: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
QuasiCertifProtocol-COL-28: translating COL formula LTLFireability into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
LTLFireability @ QuasiCertifProtocol-COL-28 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3444/65536 symbol table entries, 448 collisions
lola: preprocessing...
lola: finding significant places
lola: 2998 places, 446 transitions, 445 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 591 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-28-LTLFireability.task
lola: A (F (F (FIREABLE(t357)))) : A (G ((G (G ((FIREABLE(t211) OR FIREABLE(t210) OR FIREABLE(t209) OR FIREABLE(t208) OR FIREABLE(t207) OR FIREABLE(t206) OR FIREABLE(t205) OR FIREABLE(t204) OR FIREABLE(t203) OR FIREABLE(t202) OR FIREABLE(t201) OR FIREABLE(t200) OR FIREABLE(t199) OR FIREABLE(t198) OR FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREABLE(t191) OR FIREABLE(t190) OR FIREABLE(t189) OR FIREABLE(t188) OR FIREABLE(t187) OR FIREABLE(t186) OR FIREABLE(t185) OR FIREABLE(t184) OR FIREABLE(t183)))) U F ((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) OR FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72) OR FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60)))))) : A ((FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR 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) OR 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 (X (FIREABLE(t29))) U F ((FIREABLE(t269) OR FIREABLE(t268) OR FIREABLE(t267) OR FIREABLE(t266) OR FIREABLE(t265) OR FIREABLE(t264) OR FIREABLE(t263) OR FIREABLE(t262) OR FIREABLE(t261) OR FIREABLE(t260) OR FIREABLE(t259) OR FIREABLE(t258) OR FIREABLE(t257) OR FIREABLE(t256) OR FIREABLE(t255) OR FIREABLE(t254) OR FIREABLE(t253) OR FIREABLE(t252) OR FIREABLE(t251) OR FIREABLE(t250) OR FIREABLE(t249) OR FIREABLE(t248) OR FIREABLE(t247) OR FIREABLE(t246) OR FIREABLE(t245) OR FIREABLE(t244) OR FIREABLE(t243) OR FIREABLE(t242) OR FIREABLE(t241))))) : A (G (FIREABLE(t357))) : A ((G (FIREABLE(t122)) U (FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR 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) OR 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 ((FIREABLE(t211) OR FIREABLE(t210) OR FIREABLE(t209) OR FIREABLE(t208) OR FIREABLE(t207) OR FIREABLE(t206) OR FIREABLE(t205) OR FIREABLE(t204) OR FIREABLE(t203) OR FIREABLE(t202) OR FIREABLE(t201) OR FIREABLE(t200) OR FIREABLE(t199) OR FIREABLE(t198) OR FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREABLE(t191) OR FIREABLE(t190) OR FIREABLE(t189) OR FIREABLE(t188) OR FIREABLE(t187) OR FIREABLE(t186) OR FIREABLE(t185) OR FIREABLE(t184) OR FIREABLE(t183))) : A (X (FIREABLE(t120))) : A (F (X (X ((FIREABLE(t120) U (FIREABLE(t181) OR FIREABLE(t180) OR FIREABLE(t179) OR FIREABLE(t178) OR FIREABLE(t177) OR FIREABLE(t176) OR FIREABLE(t175) OR FIREABLE(t174) OR FIREABLE(t173) OR FIREABLE(t172) OR FIREABLE(t171) OR FIREABLE(t170) OR FIREABLE(t169) OR FIREABLE(t168) OR FIREABLE(t167) OR FIREABLE(t166) OR FIREABLE(t165) OR FIREABLE(t164) OR FIREABLE(t163) OR FIREABLE(t162) OR FIREABLE(t161) OR FIREABLE(t160) OR FIREABLE(t159) OR FIREABLE(t158) OR FIREABLE(t157) OR FIREABLE(t156) OR FIREABLE(t155) OR FIREABLE(t154) OR FIREABLE(t153))))))) : A ((X (G (G (FIREABLE(t445)))) U F (G (F (FIREABLE(t123)))))) : A ((F (((FIREABLE(t298) OR FIREABLE(t297) OR FIREABLE(t296) OR FIREABLE(t295) OR FIREABLE(t294) OR FIREABLE(t293) OR FIREABLE(t292) OR FIREABLE(t291) OR FIREABLE(t290) OR FIREABLE(t289) OR FIREABLE(t288) OR FIREABLE(t287) OR FIREABLE(t286) OR FIREABLE(t285) OR FIREABLE(t284) OR FIREABLE(t283) OR FIREABLE(t282) OR FIREABLE(t281) OR FIREABLE(t280) OR FIREABLE(t279) OR FIREABLE(t278) OR FIREABLE(t277) OR FIREABLE(t276) OR FIREABLE(t275) OR FIREABLE(t274) OR FIREABLE(t273) OR FIREABLE(t272) OR FIREABLE(t271) OR FIREABLE(t270)) U (FIREABLE(t152) OR FIREABLE(t151) OR FIREABLE(t150) OR FIREABLE(t149) OR FIREABLE(t148) OR FIREABLE(t147) OR FIREABLE(t146) OR FIREABLE(t145) OR FIREABLE(t144) OR FIREABLE(t143) OR FIREABLE(t142) OR FIREABLE(t141) OR FIREABLE(t140) OR FIREABLE(t139) OR FIREABLE(t138) OR 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)))) U X (G (G ((FIREABLE(t327) OR FIREABLE(t326) OR FIREABLE(t325) OR FIREABLE(t324) OR FIREABLE(t323) OR FIREABLE(t322) OR FIREABLE(t321) OR FIREABLE(t320) OR FIREABLE(t319) OR FIREABLE(t318) OR FIREABLE(t317) OR FIREABLE(t316) OR FIREABLE(t315) OR FIREABLE(t314) OR FIREABLE(t313) OR FIREABLE(t312) OR FIREABLE(t311) OR FIREABLE(t310) OR FIREABLE(t309) OR FIREABLE(t308) OR FIREABLE(t307) OR FIREABLE(t306) OR FIREABLE(t305) OR FIREABLE(t304) OR FIREABLE(t303) OR FIREABLE(t302) OR FIREABLE(t301) OR FIREABLE(t300) OR FIREABLE(t299))))))) : A ((F (FIREABLE(t119)) U F (X (X ((FIREABLE(t240) OR FIREABLE(t239) OR FIREABLE(t238) OR FIREABLE(t237) OR FIREABLE(t236) OR FIREABLE(t235) OR FIREABLE(t234) OR FIREABLE(t233) OR FIREABLE(t232) OR FIREABLE(t231) OR FIREABLE(t230) OR FIREABLE(t229) OR FIREABLE(t228) OR FIREABLE(t227) OR FIREABLE(t226) OR FIREABLE(t225) OR FIREABLE(t224) OR FIREABLE(t223) OR FIREABLE(t222) OR FIREABLE(t221) OR FIREABLE(t220) OR FIREABLE(t219) OR FIREABLE(t218) OR FIREABLE(t217) OR FIREABLE(t216) OR FIREABLE(t215) OR FIREABLE(t214) OR FIREABLE(t213) OR FIREABLE(t212))))))) : A (G (F (X (X (X (FIREABLE(t445))))))) : A (F ((((FIREABLE(t211) OR FIREABLE(t210) OR FIREABLE(t209) OR FIREABLE(t208) OR FIREABLE(t207) OR FIREABLE(t206) OR FIREABLE(t205) OR FIREABLE(t204) OR FIREABLE(t203) OR FIREABLE(t202) OR FIREABLE(t201) OR FIREABLE(t200) OR FIREABLE(t199) OR FIREABLE(t198) OR FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREABLE(t191) OR FIREABLE(t190) OR FIREABLE(t189) OR FIREABLE(t188) OR FIREABLE(t187) OR FIREABLE(t186) OR FIREABLE(t185) OR FIREABLE(t184) OR FIREABLE(t183)) U FIREABLE(t122)) U F (X ((FIREABLE(t415) OR FIREABLE(t414) OR FIREABLE(t413) OR FIREABLE(t412) OR FIREABLE(t411) OR FIREABLE(t410) OR FIREABLE(t409) OR FIREABLE(t408) OR FIREABLE(t407) OR FIREABLE(t406) OR FIREABLE(t405) OR FIREABLE(t404) OR FIREABLE(t403) OR FIREABLE(t402) OR FIREABLE(t401) OR FIREABLE(t400) OR FIREABLE(t399) OR FIREABLE(t398) OR FIREABLE(t397) OR FIREABLE(t396) OR FIREABLE(t395) OR FIREABLE(t394) OR FIREABLE(t393) OR FIREABLE(t392) OR FIREABLE(t391) OR FIREABLE(t390) OR FIREABLE(t389) OR FIREABLE(t388) OR FIREABLE(t387))))))) : A (X ((F (X ((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) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31)))) U F (G ((FIREABLE(t327) OR FIREABLE(t326) OR FIREABLE(t325) OR FIREABLE(t324) OR FIREABLE(t323) OR FIREABLE(t322) OR FIREABLE(t321) OR FIREABLE(t320) OR FIREABLE(t319) OR FIREABLE(t318) OR FIREABLE(t317) OR FIREABLE(t316) OR FIREABLE(t315) OR FIREABLE(t314) OR FIREABLE(t313) OR FIREABLE(t312) OR FIREABLE(t311) OR FIREABLE(t310) OR FIREABLE(t309) OR FIREABLE(t308) OR FIREABLE(t307) OR FIREABLE(t306) OR FIREABLE(t305) OR FIREABLE(t304) OR FIREABLE(t303) OR FIREABLE(t302) OR FIREABLE(t301) OR FIREABLE(t300) OR FIREABLE(t299))))))) : A ((X (X (F (FIREABLE(t123)))) U G (G (F (FIREABLE(t122))))))
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 (F (F (FIREABLE(t357))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(t357)))
lola: processed formula: A (F (FIREABLE(t357)))
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 2998 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-28-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1784 bytes per marking, with 31 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: 48 markings, 48 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G (G ((FIREABLE(t211) OR FIREABLE(t210) OR FIREABLE(t209) OR FIREABLE(t208) OR FIREABLE(t207) OR FIREABLE(t206) OR FIREABLE(t205) OR FIREABLE(t204) OR FIREABLE(t203) OR FIREABLE(t202) OR FIREABLE(t201) OR FIREABLE(t200) OR FIREABLE(t199) OR FIREABLE(t198) OR FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREAB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((G (G ((FIREABLE(t211) OR FIREABLE(t210) OR FIREABLE(t209) OR FIREABLE(t208) OR FIREABLE(t207) OR FIREABLE(t206) OR FIREABLE(t205) OR FIREABLE(t204) OR FIREABLE(t203) OR FIREABLE(t202) OR FIREABLE(t201) OR FIREABLE(t200) OR FIREABLE(t199) OR FIREABLE(t198) OR FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREABLE(t191) OR FIREABLE(t190) OR FIREABLE(t189) OR FIREABLE(t188) OR FIREABLE(t187) OR FIREABLE(t186) OR FIREABLE(t185) OR FIREABLE(t184) OR FIREABLE(t183)))) U F ((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) OR FIREABLE(t74) OR FIREABLE(t73) OR FIREABLE(t72) OR FIREABLE(t71) OR FIREABLE(t70) OR FIREABLE(t69) OR FIREABLE(t68) OR FIREABLE(t67) OR FIREABLE(t66) OR FIREABLE(t65) OR FIREABLE(t64) OR FIREABLE(t63) OR FIREABLE(t62) OR FIREABLE(t61) OR FIREABLE(t60))))))
lola: processed formula: A (G ((G (G ((FIREABLE(t211) OR FIREABLE(t210) OR FIREABLE(t209) OR FIREABLE(t208) OR FIREABLE(t207) OR FIREABLE(t206) OR FIREABLE(t205) OR FIREABLE(t204) OR FIREABLE(t203) OR FIREABLE(t202) OR FIREABLE(t201) OR FIREABLE(t200) OR FIREABLE(t199) OR FIREABLE(t198) OR FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREAB... (shortened)
lola: processed formula length: 1092
lola: 0 rewrites
lola: formula mentions 0 of 2998 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-28-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1784 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: 32 markings, 32 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR 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) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR 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) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREAB... (shortened)
lola: processed formula length: 509
lola: 1 rewrites
lola: formula mentions 0 of 2998 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-28-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X (FIREABLE(t29))) U F ((FIREABLE(t269) OR FIREABLE(t268) OR FIREABLE(t267) OR FIREABLE(t266) OR FIREABLE(t265) OR FIREABLE(t264) OR FIREABLE(t263) OR FIREABLE(t262) OR FIREABLE(t261) OR FIREABLE(t260) OR FIREABLE(t259) OR FIREABLE(t258) OR FIREABLE(t257) OR FIREABLE(t256) OR FIREABLE(t255) OR FIREABLE(t254) OR FIREABLE(t253) OR FIREABLE(t252) OR FIREABLE(t251) OR FIREABL... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X (FIREABLE(t29))) U F ((FIREABLE(t269) OR FIREABLE(t268) OR FIREABLE(t267) OR FIREABLE(t266) OR FIREABLE(t265) OR FIREABLE(t264) OR FIREABLE(t263) OR FIREABLE(t262) OR FIREABLE(t261) OR FIREABLE(t260) OR FIREABLE(t259) OR FIREABLE(t258) OR FIREABLE(t257) OR FIREABLE(t256) OR FIREABLE(t255) OR FIREABLE(t254) OR FIREABLE(t253) OR FIREABLE(t252) OR FIREABLE(t251) OR FIREABLE(t250) OR FIREABLE(t249) OR FIREABLE(t248) OR FIREABLE(t247) OR FIREABLE(t246) OR FIREABLE(t245) OR FIREABLE(t244) OR FIREABLE(t243) OR FIREABLE(t242) OR FIREABLE(t241)))))
lola: processed formula: A ((F (X (FIREABLE(t29))) U F ((FIREABLE(t269) OR FIREABLE(t268) OR FIREABLE(t267) OR FIREABLE(t266) OR FIREABLE(t265) OR FIREABLE(t264) OR FIREABLE(t263) OR FIREABLE(t262) OR FIREABLE(t261) OR FIREABLE(t260) OR FIREABLE(t259) OR FIREABLE(t258) OR FIREABLE(t257) OR FIREABLE(t256) OR FIREABLE(t255) OR FIREABLE(t254) OR FIREABLE(t253) OR FIREABLE(t252) OR FIREABLE(t251) OR FIREABL... (shortened)
lola: processed formula length: 582
lola: 0 rewrites
lola: formula mentions 0 of 2998 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-28-LTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1784 bytes per marking, with 31 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: 32 markings, 32 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t357)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1780 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (FIREABLE(t122)) U (FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR 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) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (FIREABLE(t122)) U (FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR 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) OR 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 ((G (FIREABLE(t122)) U (FIREABLE(t28) OR FIREABLE(t27) OR FIREABLE(t26) OR FIREABLE(t25) OR FIREABLE(t24) OR 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) OR FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR... (shortened)
lola: processed formula length: 536
lola: 0 rewrites
lola: formula mentions 0 of 2998 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-28-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1784 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: 32 markings, 32 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(t211) OR FIREABLE(t210) OR FIREABLE(t209) OR FIREABLE(t208) OR FIREABLE(t207) OR FIREABLE(t206) OR FIREABLE(t205) OR FIREABLE(t204) OR FIREABLE(t203) OR FIREABLE(t202) OR FIREABLE(t201) OR FIREABLE(t200) OR FIREABLE(t199) OR FIREABLE(t198) OR FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREABLE(t191) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(t211) OR FIREABLE(t210) OR FIREABLE(t209) OR FIREABLE(t208) OR FIREABLE(t207) OR FIREABLE(t206) OR FIREABLE(t205) OR FIREABLE(t204) OR FIREABLE(t203) OR FIREABLE(t202) OR FIREABLE(t201) OR FIREABLE(t200) OR FIREABLE(t199) OR FIREABLE(t198) OR FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREABLE(t191) OR ... (shortened)
lola: processed formula length: 548
lola: 1 rewrites
lola: formula mentions 0 of 2998 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-28-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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(t120)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (FIREABLE(t120)))
lola: processed formula: A (X (FIREABLE(t120)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 2998 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-28-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1784 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: 32 markings, 32 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X ((FIREABLE(t120) U (FIREABLE(t181) OR FIREABLE(t180) OR FIREABLE(t179) OR FIREABLE(t178) OR FIREABLE(t177) OR FIREABLE(t176) OR FIREABLE(t175) OR FIREABLE(t174) OR FIREABLE(t173) OR FIREABLE(t172) OR FIREABLE(t171) OR FIREABLE(t170) OR FIREABLE(t169) OR FIREABLE(t168) OR FIREABLE(t167) OR FIREABLE(t166) OR FIREABLE(t165) OR FIREABLE(t164) OR FIREABLE(t163) OR FIREABLE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (X ((FIREABLE(t120) U (FIREABLE(t181) OR FIREABLE(t180) OR FIREABLE(t179) OR FIREABLE(t178) OR FIREABLE(t177) OR FIREABLE(t176) OR FIREABLE(t175) OR FIREABLE(t174) OR FIREABLE(t173) OR FIREABLE(t172) OR FIREABLE(t171) OR FIREABLE(t170) OR FIREABLE(t169) OR FIREABLE(t168) OR FIREABLE(t167) OR FIREABLE(t166) OR FIREABLE(t165) OR FIREABLE(t164) OR FIREABLE(t163) OR FIREABLE(t162) OR FIREABLE(t161) OR FIREABLE(t160) OR FIREABLE(t159) OR FIREABLE(t158) OR FIREABLE(t157) OR FIREABLE(t156) OR FIREABLE(t155) OR FIREABLE(t154) OR FIREABLE(t153)))))))
lola: processed formula: A (F (X (X ((FIREABLE(t120) U (FIREABLE(t181) OR FIREABLE(t180) OR FIREABLE(t179) OR FIREABLE(t178) OR FIREABLE(t177) OR FIREABLE(t176) OR FIREABLE(t175) OR FIREABLE(t174) OR FIREABLE(t173) OR FIREABLE(t172) OR FIREABLE(t171) OR FIREABLE(t170) OR FIREABLE(t169) OR FIREABLE(t168) OR FIREABLE(t167) OR FIREABLE(t166) OR FIREABLE(t165) OR FIREABLE(t164) OR FIREABLE(t163) OR FIREABLE... (shortened)
lola: processed formula length: 583
lola: 0 rewrites
lola: formula mentions 0 of 2998 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-28-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1784 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: 32 markings, 32 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G (G (FIREABLE(t445)))) U F (G (F (FIREABLE(t123))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (G (G (FIREABLE(t445)))) U G (F (FIREABLE(t123)))))
lola: processed formula: A ((X (G (G (FIREABLE(t445)))) U G (F (FIREABLE(t123)))))
lola: processed formula length: 57
lola: 1 rewrites
lola: formula mentions 0 of 2998 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-28-LTLFireability.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1784 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: 32 markings, 32 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (((FIREABLE(t298) OR FIREABLE(t297) OR FIREABLE(t296) OR FIREABLE(t295) OR FIREABLE(t294) OR FIREABLE(t293) OR FIREABLE(t292) OR FIREABLE(t291) OR FIREABLE(t290) OR FIREABLE(t289) OR FIREABLE(t288) OR FIREABLE(t287) OR FIREABLE(t286) OR FIREABLE(t285) OR FIREABLE(t284) OR FIREABLE(t283) OR FIREABLE(t282) OR FIREABLE(t281) OR FIREABLE(t280) OR FIREABLE(t279) OR FIREABLE(t2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (((FIREABLE(t298) OR FIREABLE(t297) OR FIREABLE(t296) OR FIREABLE(t295) OR FIREABLE(t294) OR FIREABLE(t293) OR FIREABLE(t292) OR FIREABLE(t291) OR FIREABLE(t290) OR FIREABLE(t289) OR FIREABLE(t288) OR FIREABLE(t287) OR FIREABLE(t286) OR FIREABLE(t285) OR FIREABLE(t284) OR FIREABLE(t283) OR FIREABLE(t282) OR FIREABLE(t281) OR FIREABLE(t280) OR FIREABLE(t279) OR FIREABLE(t278) OR FIREABLE(t277) OR FIREABLE(t276) OR FIREABLE(t275) OR FIREABLE(t274) OR FIREABLE(t273) OR FIREABLE(t272) OR FIREABLE(t271) OR FIREABLE(t270)) U (FIREABLE(t152) OR FIREABLE(t151) OR FIREABLE(t150) OR FIREABLE(t149) OR FIREABLE(t148) OR FIREABLE(t147) OR FIREABLE(t146) OR FIREABLE(t145) OR FIREABLE(t144) OR FIREABLE(t143) OR FIREABLE(t142) OR FIREABLE(t141) OR FIREABLE(t140) OR FIREABLE(t139) OR FIREABLE(t138) OR 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)))) U X (G (G ((FIREABLE(t327) OR FIREABLE(t326) OR FIREABLE(t325) OR FIREABLE(t324) OR FIREABLE(t323) OR FIREABLE(t322) OR FIREABLE(t321) OR FIREABLE(t320) OR FIREABLE(t319) OR FIREABLE(t318) OR FIREABLE(t317) OR FIREABLE(t316) OR FIREABLE(t315) OR FIREABLE(t314) OR FIREABLE(t313) OR FIREABLE(t312) OR FIREABLE(t311) OR FIREABLE(t310) OR FIREABLE(t309) OR FIREABLE(t308) OR FIREABLE(t307) OR FIREABLE(t306) OR FIREABLE(t305) OR FIREABLE(t304) OR FIREABLE(t303) OR FIREABLE(t302) OR FIREABLE(t301) OR FIREABLE(t300) OR FIREABLE(t299)))))))
lola: processed formula: A ((F (((FIREABLE(t298) OR FIREABLE(t297) OR FIREABLE(t296) OR FIREABLE(t295) OR FIREABLE(t294) OR FIREABLE(t293) OR FIREABLE(t292) OR FIREABLE(t291) OR FIREABLE(t290) OR FIREABLE(t289) OR FIREABLE(t288) OR FIREABLE(t287) OR FIREABLE(t286) OR FIREABLE(t285) OR FIREABLE(t284) OR FIREABLE(t283) OR FIREABLE(t282) OR FIREABLE(t281) OR FIREABLE(t280) OR FIREABLE(t279) OR FIREABLE(t2... (shortened)
lola: processed formula length: 1674
lola: 0 rewrites
lola: formula mentions 0 of 2998 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-28-LTLFireability.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1784 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: 32 markings, 32 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (FIREABLE(t119)) U F (X (X ((FIREABLE(t240) OR FIREABLE(t239) OR FIREABLE(t238) OR FIREABLE(t237) OR FIREABLE(t236) OR FIREABLE(t235) OR FIREABLE(t234) OR FIREABLE(t233) OR FIREABLE(t232) OR FIREABLE(t231) OR FIREABLE(t230) OR FIREABLE(t229) OR FIREABLE(t228) OR FIREABLE(t227) OR FIREABLE(t226) OR FIREABLE(t225) OR FIREABLE(t224) OR FIREABLE(t223) OR FIREABLE(t222) OR FIRE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (FIREABLE(t119)) U F (X (X ((FIREABLE(t240) OR FIREABLE(t239) OR FIREABLE(t238) OR FIREABLE(t237) OR FIREABLE(t236) OR FIREABLE(t235) OR FIREABLE(t234) OR FIREABLE(t233) OR FIREABLE(t232) OR FIREABLE(t231) OR FIREABLE(t230) OR FIREABLE(t229) OR FIREABLE(t228) OR FIREABLE(t227) OR FIREABLE(t226) OR FIREABLE(t225) OR FIREABLE(t224) OR FIREABLE(t223) OR FIREABLE(t222) OR FIREABLE(t221) OR FIREABLE(t220) OR FIREABLE(t219) OR FIREABLE(t218) OR FIREABLE(t217) OR FIREABLE(t216) OR FIREABLE(t215) OR FIREABLE(t214) OR FIREABLE(t213) OR FIREABLE(t212)))))))
lola: processed formula: A ((F (FIREABLE(t119)) U F (X (X ((FIREABLE(t240) OR FIREABLE(t239) OR FIREABLE(t238) OR FIREABLE(t237) OR FIREABLE(t236) OR FIREABLE(t235) OR FIREABLE(t234) OR FIREABLE(t233) OR FIREABLE(t232) OR FIREABLE(t231) OR FIREABLE(t230) OR FIREABLE(t229) OR FIREABLE(t228) OR FIREABLE(t227) OR FIREABLE(t226) OR FIREABLE(t225) OR FIREABLE(t224) OR FIREABLE(t223) OR FIREABLE(t222) OR FIRE... (shortened)
lola: processed formula length: 587
lola: 0 rewrites
lola: formula mentions 0 of 2998 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-28-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1784 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: 32 markings, 32 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (X (X (X (FIREABLE(t445)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (X (X (X (FIREABLE(t445)))))))
lola: processed formula: A (G (F (X (X (X (FIREABLE(t445)))))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 2998 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-28-LTLFireability.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1784 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: 32 markings, 32 edges
lola: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((FIREABLE(t211) OR FIREABLE(t210) OR FIREABLE(t209) OR FIREABLE(t208) OR FIREABLE(t207) OR FIREABLE(t206) OR FIREABLE(t205) OR FIREABLE(t204) OR FIREABLE(t203) OR FIREABLE(t202) OR FIREABLE(t201) OR FIREABLE(t200) OR FIREABLE(t199) OR FIREABLE(t198) OR FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREABLE(t1... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((((FIREABLE(t211) OR FIREABLE(t210) OR FIREABLE(t209) OR FIREABLE(t208) OR FIREABLE(t207) OR FIREABLE(t206) OR FIREABLE(t205) OR FIREABLE(t204) OR FIREABLE(t203) OR FIREABLE(t202) OR FIREABLE(t201) OR FIREABLE(t200) OR FIREABLE(t199) OR FIREABLE(t198) OR FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREABLE(t191) OR FIREABLE(t190) OR FIREABLE(t189) OR FIREABLE(t188) OR FIREABLE(t187) OR FIREABLE(t186) OR FIREABLE(t185) OR FIREABLE(t184) OR FIREABLE(t183)) U FIREABLE(t122)) U F (X ((FIREABLE(t415) OR FIREABLE(t414) OR FIREABLE(t413) OR FIREABLE(t412) OR FIREABLE(t411) OR FIREABLE(t410) OR FIREABLE(t409) OR FIREABLE(t408) OR FIREABLE(t407) OR FIREABLE(t406) OR FIREABLE(t405) OR FIREABLE(t404) OR FIREABLE(t403) OR FIREABLE(t402) OR FIREABLE(t401) OR FIREABLE(t400) OR FIREABLE(t399) OR FIREABLE(t398) OR FIREABLE(t397) OR FIREABLE(t396) OR FIREABLE(t395) OR FIREABLE(t394) OR FIREABLE(t393) OR FIREABLE(t392) OR FIREABLE(t391) OR FIREABLE(t390) OR FIREABLE(t389) OR FIREABLE(t388) OR FIREABLE(t387)))))))
lola: processed formula: A (F ((((FIREABLE(t211) OR FIREABLE(t210) OR FIREABLE(t209) OR FIREABLE(t208) OR FIREABLE(t207) OR FIREABLE(t206) OR FIREABLE(t205) OR FIREABLE(t204) OR FIREABLE(t203) OR FIREABLE(t202) OR FIREABLE(t201) OR FIREABLE(t200) OR FIREABLE(t199) OR FIREABLE(t198) OR FIREABLE(t197) OR FIREABLE(t196) OR FIREABLE(t195) OR FIREABLE(t194) OR FIREABLE(t193) OR FIREABLE(t192) OR FIREABLE(t1... (shortened)
lola: processed formula length: 1136
lola: 0 rewrites
lola: formula mentions 0 of 2998 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-28-LTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1784 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: 32 markings, 32 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F (X ((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) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((F (X ((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) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE(t38) OR FIREABLE(t37) OR FIREABLE(t36) OR FIREABLE(t35) OR FIREABLE(t34) OR FIREABLE(t33) OR FIREABLE(t32) OR FIREABLE(t31)))) U F (G ((FIREABLE(t327) OR FIREABLE(t326) OR FIREABLE(t325) OR FIREABLE(t324) OR FIREABLE(t323) OR FIREABLE(t322) OR FIREABLE(t321) OR FIREABLE(t320) OR FIREABLE(t319) OR FIREABLE(t318) OR FIREABLE(t317) OR FIREABLE(t316) OR FIREABLE(t315) OR FIREABLE(t314) OR FIREABLE(t313) OR FIREABLE(t312) OR FIREABLE(t311) OR FIREABLE(t310) OR FIREABLE(t309) OR FIREABLE(t308) OR FIREABLE(t307) OR FIREABLE(t306) OR FIREABLE(t305) OR FIREABLE(t304) OR FIREABLE(t303) OR FIREABLE(t302) OR FIREABLE(t301) OR FIREABLE(t300) OR FIREABLE(t299)))))))
lola: processed formula: A (X ((F (X ((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) OR FIREABLE(t47) OR FIREABLE(t46) OR FIREABLE(t45) OR FIREABLE(t44) OR FIREABLE(t43) OR FIREABLE(t42) OR FIREABLE(t41) OR FIREABLE(t40) OR FIREABLE(t39) OR FIREABLE... (shortened)
lola: processed formula length: 1096
lola: 0 rewrites
lola: formula mentions 0 of 2998 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-28-LTLFireability.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1784 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: 33 markings, 34 edges
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X (F (FIREABLE(t123)))) U G (G (F (FIREABLE(t122))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (X (F (FIREABLE(t123)))) U G (G (F (FIREABLE(t122))))))
lola: processed formula: A ((X (X (F (FIREABLE(t123)))) U G (G (F (FIREABLE(t122))))))
lola: processed formula length: 61
lola: 0 rewrites
lola: formula mentions 0 of 2998 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-28-LTLFireability.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1784 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: 32 markings, 32 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no no no no no no
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-28-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished 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="QuasiCertifProtocol-COL-28"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-28.tgz
mv QuasiCertifProtocol-COL-28 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is QuasiCertifProtocol-COL-28, 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 r186-qhx2-152732138600052"
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 ;