About the Execution of Irma.struct for QuasiCertifProtocol-COL-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1351.880 | 200473.00 | 211799.00 | 1919.80 | TTFTTTFFTTFTFTFT | 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 240K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.4K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.5K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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.7K 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.7K 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 72K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is QuasiCertifProtocol-COL-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-qhx2-152673581100028
=====================================================================
--------------------
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-10-ReachabilityFireability-00
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-01
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-02
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-03
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-04
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-05
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-06
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-07
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-08
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-09
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-10
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-11
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-12
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-13
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-14
FORMULA_NAME QuasiCertifProtocol-COL-10-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1527781607273
BK_STOP 1527781807746
--------------------
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 QuasiCertifProtocol-COL-10 as instance name.
Using QuasiCertifProtocol as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', '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': 385729, 'Memory': 1555.59, 'Tool': 'lola'}, {'Time': 396958, 'Memory': 2686.06, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola QuasiCertifProtocol-COL-10...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
QuasiCertifProtocol-COL-10: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
QuasiCertifProtocol-COL-10: translating COL formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ QuasiCertifProtocol-COL-10 @ 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: 726/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 550 places, 176 transitions, 175 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 231 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-COL-10-ReachabilityFireability.task
lola: E (F (((NOT FIREABLE(t0) AND (FIREABLE(t93) OR 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)) AND (FIREABLE(t0) OR FIREABLE(t175)) AND (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(t70)))) : E (F (FIREABLE(t70))) : A (G (((NOT FIREABLE(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33) AND NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27) AND NOT FIREABLE(t26) AND NOT FIREABLE(t25) AND NOT FIREABLE(t93) AND NOT FIREABLE(t92) AND NOT FIREABLE(t91) AND NOT FIREABLE(t90) AND NOT FIREABLE(t89) AND NOT FIREABLE(t88) AND NOT FIREABLE(t87) AND NOT FIREABLE(t86) AND NOT FIREABLE(t85) AND NOT FIREABLE(t84) AND NOT FIREABLE(t83)) OR NOT FIREABLE(t70)))) : E (F ((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)))) : E (F ((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) OR FIREABLE(t119)))) : E (F (FIREABLE(t116))) : A (G ((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(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)))) : A (G ((NOT FIREABLE(t118) OR FIREABLE(t175) 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 (G ((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(t104) OR FIREABLE(t103) OR FIREABLE(t102) OR FIREABLE(t101) OR FIREABLE(t100) OR FIREABLE(t99) OR FIREABLE(t98) OR FIREABLE(t97) OR FIREABLE(t96) OR FIREABLE(t95) OR FIREABLE(t94) OR (NOT FIREABLE(t93) AND NOT FIREABLE(t92) AND NOT FIREABLE(t91) AND NOT FIREABLE(t90) AND NOT FIREABLE(t89) AND NOT FIREABLE(t88) AND NOT FIREABLE(t87) AND NOT FIREABLE(t86) AND NOT FIREABLE(t85) AND NOT FIREABLE(t84) AND NOT FIREABLE(t83)) OR NOT FIREABLE(t130) OR NOT FIREABLE(t116) 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)))) : A (G (())) : E (F ((FIREABLE(t175) AND (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)) AND FIREABLE(t71) AND (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)) AND (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))))) : A (G (((NOT FIREABLE(t141) AND NOT FIREABLE(t140) AND NOT FIREABLE(t139) AND NOT FIREABLE(t138) AND NOT FIREABLE(t137) AND NOT FIREABLE(t136) AND NOT FIREABLE(t135) AND NOT FIREABLE(t134) AND NOT FIREABLE(t133) AND NOT FIREABLE(t132) AND NOT FIREABLE(t131)) OR NOT FIREABLE(t130)))) : A (G ((FIREABLE(t115) OR FIREABLE(t114) OR 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 (NOT FIREABLE(t174) AND NOT FIREABLE(t173) AND NOT FIREABLE(t172) AND NOT FIREABLE(t171) AND NOT FIREABLE(t170) AND NOT FIREABLE(t169) AND NOT FIREABLE(t168) AND NOT FIREABLE(t167) AND NOT FIREABLE(t166) AND NOT FIREABLE(t165) AND NOT FIREABLE(t164) AND FIREABLE(t23)) OR (NOT FIREABLE(t129) AND NOT FIREABLE(t128) AND NOT FIREABLE(t127) AND NOT FIREABLE(t126) AND NOT FIREABLE(t125) AND NOT FIREABLE(t124) AND NOT FIREABLE(t123) AND NOT FIREABLE(t122) AND NOT FIREABLE(t121) AND NOT FIREABLE(t120) AND NOT FIREABLE(t119))))) : E (F ((((FIREABLE(t24) OR FIREABLE(t0) OR (NOT FIREABLE(t93) AND NOT FIREABLE(t92) AND NOT FIREABLE(t91) AND NOT FIREABLE(t90) AND NOT FIREABLE(t89) AND NOT FIREABLE(t88) AND NOT FIREABLE(t87) AND NOT FIREABLE(t86) AND NOT FIREABLE(t85) AND NOT FIREABLE(t84) AND NOT FIREABLE(t83))) AND (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(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) OR FIREABLE(t59) OR FIREABLE(t104) OR FIREABLE(t103) OR FIREABLE(t102) OR FIREABLE(t101) OR FIREABLE(t100) OR FIREABLE(t99) OR FIREABLE(t98) OR FIREABLE(t97) OR FIREABLE(t96) OR FIREABLE(t95) OR FIREABLE(t94)) AND (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(t117)) AND (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(t175) OR (NOT FIREABLE(t141) AND NOT FIREABLE(t140) AND NOT FIREABLE(t139) AND NOT FIREABLE(t138) AND NOT FIREABLE(t137) AND NOT FIREABLE(t136) AND NOT FIREABLE(t135) AND NOT FIREABLE(t134) AND NOT FIREABLE(t133) AND NOT FIREABLE(t132) AND NOT FIREABLE(t131))))))) : A (G ((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)))) : E (F ((NOT FIREABLE(t129) AND NOT FIREABLE(t128) AND NOT FIREABLE(t127) AND NOT FIREABLE(t126) AND NOT FIREABLE(t125) AND NOT FIREABLE(t124) AND NOT FIREABLE(t123) AND NOT FIREABLE(t122) AND NOT FIREABLE(t121) AND NOT FIREABLE(t120) AND NOT FIREABLE(t119) AND NOT FIREABLE(t174) AND NOT FIREABLE(t173) AND NOT FIREABLE(t172) AND NOT FIREABLE(t171) AND NOT FIREABLE(t170) AND NOT FIREABLE(t169) AND NOT FIREABLE(t168) AND NOT FIREABLE(t167) AND NOT FIREABLE(t166) AND NOT FIREABLE(t165) AND NOT FIREABLE(t164) AND (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) OR FIREABLE(t59)) AND NOT FIREABLE(t24))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t0) AND (FIREABLE(t93) OR 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)) AND (FIREABLE(t0) OR FIREABLE(t175)) AND (FIREABLE(t22) OR FIREABLE(t21) OR FIREABLE(t20) OR FIREABLE(t19) OR FIREABLE(t18) OR FIREABLE(t17) OR FIREABLE(t16) OR FIREAB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t70)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability.sara
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t35) AND NOT FIREABLE(t34) AND NOT FIREABLE(t33) AND NOT FIREABLE(t32) AND NOT FIREABLE(t31) AND NOT FIREABLE(t30) AND NOT FIREABLE(t29) AND NOT FIREABLE(t28) AND NOT FIREABLE(t27) AND NOT FIREABLE(t26) AND NOT FIREABLE(t25) AND NOT FIREABLE(t93) AND NOT FIREABLE(t92) AND NOT FIREABLE(t91) AND NOT FIREABLE(t90) AND NOT FIREABLE(t89) AND NOT FIREABLE(t88) AND NOT FIREABLE(t87) ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 308 literals and 22 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 39 markings, 38 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-2.sara
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((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))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 11 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 62 markings, 61 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((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) OR FIREABLE(t119))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 22 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t116)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityFireability-3.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-5.sara
lola: lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((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(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 FIREA... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t118) OR FIREABLE(t175) 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: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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: 14 markings, 13 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((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(t104) OR FIREABLE(t103) OR FIREABLE(t102) OR FIREABLE(t101) OR FIREABLE(t100) OR FIREABLE(t99) OR FIREABLE(t98) OR FIREABLE(t97) OR FIREABLE(t96) OR FIREABLE(t95) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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
sara: place or transition ordering is non-deterministic
lola: sara not yet started (preprocessing) || 164084 markings, 645774 edges, 32817 markings/sec, 0 secs
lola: sara not yet started (preprocessing) || 366668 markings, 1543291 edges, 40517 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 642208 markings, 2759956 edges, 55108 markings/sec, 10 secs
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 1014957 markings, 4458311 edges, 74550 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 1368655 markings, 6129913 edges, 70740 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 1748872 markings, 7919174 edges, 76043 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 2113653 markings, 9631284 edges, 72956 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 2459179 markings, 11241123 edges, 69105 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 2785272 markings, 12886406 edges, 65219 markings/sec, 40 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 3049273 markings, 14388221 edges
lola: ========================================
lola: subprocess 9 will run for 498 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 550 places; total mentions: 0
lola: closed formula file QuasiCertifProtocol-COL-10-ReachabilityFireability.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 10 will run for 581 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t175) AND (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)) AND FIREABLE(t71) AND (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(t14... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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 unreachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 11 will run for 697 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t141) AND NOT FIREABLE(t140) AND NOT FIREABLE(t139) AND NOT FIREABLE(t138) AND NOT FIREABLE(t137) AND NOT FIREABLE(t136) AND NOT FIREABLE(t135) AND NOT FIREABLE(t134) AND NOT FIREABLE(t133) AND NOT FIREABLE(t132) AND NOT FIREABLE(t131)) OR NOT FIREABLE(t130))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 33 literals and 11 conjunctive subformulas
lola: state equation: write sara problem file to QuasiCertifProtocol-COL-10-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file QuasiCertifProtocol-COL-10-ReachabilityFireability-11.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 872 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t115) OR FIREABLE(t114) OR 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 (NOT FIREABLE(t174) AND NOT FIREABLE(t173) AND NOT FIREABLE(t172) AND NOT FIREABLE(t171) AND NOT FIREABLE(t170) AND NOT FIREABLE(t169) AND NOT FIREABLE(t168) AND NOT FIREABLE(t167) AND... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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: sara not yet started (preprocessing) || 186846 markings, 964069 edges, 37369 markings/sec, 0 secs
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 469654 markings, 2734616 edges, 56562 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 779128 markings, 4793153 edges, 61895 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 1078637 markings, 6888208 edges, 59902 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 1352645 markings, 9011674 edges, 54802 markings/sec, 20 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1409269 markings, 9519833 edges
lola: ========================================
lola: subprocess 13 will run for 1154 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(t24) OR FIREABLE(t0) OR (NOT FIREABLE(t93) AND NOT FIREABLE(t92) AND NOT FIREABLE(t91) AND NOT FIREABLE(t90) AND NOT FIREABLE(t89) AND NOT FIREABLE(t88) AND NOT FIREABLE(t87) AND NOT FIREABLE(t86) AND NOT FIREABLE(t85) AND NOT FIREABLE(t84) AND NOT FIREABLE(t83))) AND (FIREABLE(t11) OR FIREABLE(t10) OR FIREABLE(t9) OR FIREABLE(t8) OR FIREABLE(t7) OR FIREABLE(t6) OR FIREAB... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 14 will run for 1731 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((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: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 15 will run for 3462 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t129) AND NOT FIREABLE(t128) AND NOT FIREABLE(t127) AND NOT FIREABLE(t126) AND NOT FIREABLE(t125) AND NOT FIREABLE(t124) AND NOT FIREABLE(t123) AND NOT FIREABLE(t122) AND NOT FIREABLE(t121) AND NOT FIREABLE(t120) AND NOT FIREABLE(t119) AND NOT FIREABLE(t174) AND NOT FIREABLE(t173) AND NOT FIREABLE(t172) AND NOT FIREABLE(t171) AND NOT FIREABLE(t170) AND NOT FIREABLE(t169) AND NO... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 700 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: sara not yet started (preprocessing) || 221070 markings, 914736 edges, 44214 markings/sec, 0 secs
lola: state equation: Could not create input for sara: DNF too long or DEADLOCK predicate contained
lola: sara not yet started (preprocessing) || 603634 markings, 2602093 edges, 76513 markings/sec, 5 secs
lola: sara not yet started (preprocessing) || 993647 markings, 4385272 edges, 78003 markings/sec, 10 secs
lola: sara not yet started (preprocessing) || 1356014 markings, 6093427 edges, 72473 markings/sec, 15 secs
lola: sara not yet started (preprocessing) || 1748031 markings, 7900629 edges, 78403 markings/sec, 20 secs
lola: sara not yet started (preprocessing) || 2154469 markings, 9692681 edges, 81288 markings/sec, 25 secs
lola: sara not yet started (preprocessing) || 2424449 markings, 11652917 edges, 53996 markings/sec, 30 secs
lola: sara not yet started (preprocessing) || 2665661 markings, 13643550 edges, 48242 markings/sec, 35 secs
lola: sara not yet started (preprocessing) || 2892993 markings, 15661289 edges, 45466 markings/sec, 40 secs
lola: sara not yet started (preprocessing) || 3138118 markings, 17751978 edges, 49025 markings/sec, 45 secs
lola: sara not yet started (preprocessing) || 3436847 markings, 19474837 edges, 59746 markings/sec, 50 secs
lola: sara not yet started (preprocessing) || 3681982 markings, 21279876 edges, 49027 markings/sec, 55 secs
lola: sara not yet started (preprocessing) || 3978881 markings, 23074600 edges, 59380 markings/sec, 60 secs
lola: sara not yet started (preprocessing) || 4274250 markings, 24879995 edges, 59074 markings/sec, 65 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4348320 markings, 25244678 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no yes yes yes no no yes yes no yes no yes no yes
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA QuasiCertifProtocol-COL-10-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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-10"
export BK_EXAMINATION="ReachabilityFireability"
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/QuasiCertifProtocol-COL-10.tgz
mv QuasiCertifProtocol-COL-10 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 QuasiCertifProtocol-COL-10, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r139-qhx2-152673581100028"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 ;