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 836K
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 71K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K 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 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 484K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PermAdmissibility-PT-50, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666474100507
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527154400472


BK_STOP 1527154824716

--------------------
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 PermAdmissibility-PT-50 as instance name.
Using PermAdmissibility as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, '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': None}.
Known tools are: [{'Time': 2664949, 'Memory': 15952.22, 'Tool': 'lola'}, {'Time': 2665565, 'Memory': 15952.27, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality lola PermAdmissibility-PT-50...

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


checking for too many tokens
===========================================================================================
PermAdmissibility-PT-50: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ PermAdmissibility-PT-50 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 760/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 592 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 820 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-PT-50-CTLCardinality.task
lola: (((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) AND E (G ((aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 + 1 <= c15)))) OR E (F (((2 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) AND (2 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) AND (3 <= c7))))) : (E (((c13 <= 1) U (c14 + 1 <= c11))) AND E (F (E (F ((c8 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7)))))) : E (((aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= 1) U (aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7 + 1 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7))) : (NOT(A (F (((c12 <= c5) AND (c17 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))))) OR E (F (A (X ((1 <= c9)))))) : A (F ((A (F ((1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))) AND ((c16 <= 1) AND (c15 <= 2))))) : (E (((c15 <= c13) U ((out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) AND (3 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))) AND A ((((3 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7) AND (1 <= c14)) U ((3 <= aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7) OR (3 <= in1_0 + in1_1))))) : (NOT((E (G ((c16 <= c14))) AND (out7_0 + out7_1 + out7_2 + out7_3 + out7_4 + out7_5 + out7_6 + out7_7 <= aux8_2 + aux8_3 + aux8_6 + aux8_7))) OR NOT(((in2_2 + in2_3 <= aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7) OR A (G ((1 <= in3_4 + in3_5)))))) : A (F (A (G ((aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 + 1 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7))))) : E (X (NOT(A (F ((2 <= out4_0)))))) : (NOT(NOT(A (G ((out4_3 <= c9))))) AND (NOT(A (G ((c18 <= aux11_4)))) OR E (F (((1 <= c110) AND (aux16_5 <= out8_5)))))) : A (((aux15_3 <= out1_7) U A (X ((1 <= aux15_7))))) : E (G (((aux11_0 <= 1) AND (aux13_2 <= 2) AND (aux9_4 <= 2) AND (out7_6 <= 1)))) : NOT(((A (G ((c15 <= out8_2))) OR (out3_1 + 1 <= out5_3)) OR ((out6_4 <= c110) AND A (G ((3 <= in4_7)))))) : E (G ((out8_3 <= aux11_2))) : E (F (E (((out8_2 <= c8) U (1 <= aux15_0))))) : E (F (A (X (((1 <= out4_1) OR (aux5_4 <= aux9_4))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((aux5_0 + aux5_1 + aux5_4 + aux5_5 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) AND E (G ((aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 + 1 <= c15)))) OR E (F (((2 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) AND (2 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) AND (3 <= c7)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (aux5_0 + aux5_1 + aux5_4 + aux5_5 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (aux5_0 + aux5_1 + aux5_4 + aux5_5 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7)
lola: processed formula length: 108
lola: 0 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-50-CTLCardinality.task
lola: processed formula with 1 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7 + 1 <= c15)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (c15 <= aux11_0 + aux11_1 + aux11_2 + aux11_3 + aux11_4 + aux11_5 + aux11_6 + aux11_7)))
lola: processed formula length: 101
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7) AND (2 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) AND (3 <= c7))))
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 544 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 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 37 markings, 36 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((c13 <= 1) U (c14 + 1 <= c11))) AND E (F (E (F ((c8 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((c13 <= 1) U (c14 + 1 <= c11)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((c13 <= 1) U (c14 + 1 <= c11))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 105 markings, 104 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((c8 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7)))
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 544 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 PermAdmissibility-PT-50-CTLCardinality-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= 1) U (aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7 + 1 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= 1) U (aux9_6 + aux9_4 + aux9_3 + aux9_2 + aux9_1 + aux9_0 + aux9_5 + aux9_7 + 1 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7))
lola: processed formula length: 238
lola: 1 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: ========================================
lola: 1822474 markings, 2017609 edges, 3225752436249460736 markings/sec, 0 secs
lola: 3529697 markings, 3935241 edges, 341445 markings/sec, 5 secs
lola: 5180117 markings, 5802787 edges, 330084 markings/sec, 10 secs
lola: 6742512 markings, 7594436 edges, 312479 markings/sec, 15 secs
lola: 8175195 markings, 9218336 edges, 286537 markings/sec, 20 secs
lola: 9598141 markings, 10825748 edges, 284589 markings/sec, 25 secs
lola: 10919455 markings, 12324625 edges, 264263 markings/sec, 30 secs
lola: 12311865 markings, 13928178 edges, 278482 markings/sec, 35 secs
lola: 13710407 markings, 15522754 edges, 279708 markings/sec, 40 secs
lola: 15093717 markings, 17121074 edges, 276662 markings/sec, 45 secs
lola: 16542098 markings, 18805220 edges, 289676 markings/sec, 50 secs
lola: 17853887 markings, 20294634 edges, 262358 markings/sec, 55 secs
lola: 19257261 markings, 21905619 edges, 280675 markings/sec, 60 secs
lola: 20707751 markings, 23553826 edges, 290098 markings/sec, 65 secs
lola: 22207129 markings, 25272447 edges, 299876 markings/sec, 70 secs
lola: 23694859 markings, 26973675 edges, 297546 markings/sec, 75 secs
lola: 25017911 markings, 28492313 edges, 264610 markings/sec, 80 secs
lola: 26310833 markings, 29980047 edges, 258584 markings/sec, 85 secs
lola: 27646128 markings, 31538334 edges, 267059 markings/sec, 90 secs
lola: 29075523 markings, 33200830 edges, 285879 markings/sec, 95 secs
lola: 30420667 markings, 34733634 edges, 269029 markings/sec, 100 secs
lola: 31711466 markings, 36225664 edges, 258160 markings/sec, 105 secs
lola: 33014748 markings, 37749181 edges, 260656 markings/sec, 110 secs
lola: 34442142 markings, 39407255 edges, 285479 markings/sec, 115 secs
lola: 35821435 markings, 41028961 edges, 275859 markings/sec, 120 secs
lola: 37279464 markings, 42727689 edges, 291606 markings/sec, 125 secs
lola: 38511457 markings, 44130676 edges, 246399 markings/sec, 130 secs
lola: 39881248 markings, 45707075 edges, 273958 markings/sec, 135 secs
lola: 41355201 markings, 47405499 edges, 294791 markings/sec, 140 secs
lola: 42781232 markings, 49061627 edges, 285206 markings/sec, 145 secs
lola: 44269600 markings, 50772183 edges, 297674 markings/sec, 150 secs
lola: 45589354 markings, 52275933 edges, 263951 markings/sec, 155 secs
lola: 46882712 markings, 53766779 edges, 258672 markings/sec, 160 secs
lola: 48160360 markings, 55243815 edges, 255530 markings/sec, 165 secs
lola: 49612459 markings, 56933446 edges, 290420 markings/sec, 170 secs
lola: 50932156 markings, 58459381 edges, 263939 markings/sec, 175 secs
lola: 52139032 markings, 59827700 edges, 241375 markings/sec, 180 secs
lola: 53335089 markings, 61209002 edges, 239211 markings/sec, 185 secs
lola: 54508023 markings, 62570128 edges, 234587 markings/sec, 190 secs
lola: 55651601 markings, 63901018 edges, 228716 markings/sec, 195 secs
lola: 55665506 markings, 63917499 edges, 2781 markings/sec, 200 secs
lola: 55670019 markings, 63922624 edges, 903 markings/sec, 205 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F (((c12 <= c5) AND (c17 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))))) OR E (F (A (X ((1 <= c9))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((c5 + 1 <= c12) OR (out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7 + 1 <= c17))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((c12 <= c5) AND (c17 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))))
lola: processed formula length: 111
lola: 5 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((1 <= c9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((1 <= c9)))
lola: processed formula length: 23
lola: 5 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 355 markings, 354 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (F ((1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))) AND ((c16 <= 1) AND (c15 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (A(TRUE U (1 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7)) AND ((c16 <= 1) AND (c15 <= 2))))
lola: processed formula length: 130
lola: 2 rewrites
lola: formula mentions 0 of 168 places; total mentions: 0
lola: closed formula file PermAdmissibility-PT-50-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1641337 markings, 1752067 edges, 2947805517474430976 markings/sec, 0 secs
lola: 3265633 markings, 3538374 edges, 324859 markings/sec, 5 secs
lola: 4885795 markings, 5333234 edges, 324032 markings/sec, 10 secs
lola: 6487014 markings, 7138812 edges, 320244 markings/sec, 15 secs
lola: 7977161 markings, 9056298 edges, 298029 markings/sec, 20 secs
lola: 9563947 markings, 10817666 edges, 317357 markings/sec, 25 secs
lola: 11082608 markings, 12568941 edges, 303732 markings/sec, 30 secs
lola: 12619957 markings, 14254129 edges, 307470 markings/sec, 35 secs
lola: 14111288 markings, 15885627 edges, 298266 markings/sec, 40 secs
lola: 15609487 markings, 17572068 edges, 299640 markings/sec, 45 secs
lola: 17106180 markings, 19369139 edges, 299339 markings/sec, 50 secs
lola: 18669685 markings, 21067357 edges, 312701 markings/sec, 55 secs
lola: 20110251 markings, 22642068 edges, 288113 markings/sec, 60 secs
lola: 21508531 markings, 24279651 edges, 279656 markings/sec, 65 secs
lola: 23005427 markings, 26018074 edges, 299379 markings/sec, 70 secs
lola: 24542442 markings, 27681569 edges, 307403 markings/sec, 75 secs
lola: 26010247 markings, 29382540 edges, 293561 markings/sec, 80 secs
lola: 27358288 markings, 30902384 edges, 269608 markings/sec, 85 secs
lola: 28710049 markings, 32414396 edges, 270352 markings/sec, 90 secs
lola: 30087066 markings, 33932016 edges, 275403 markings/sec, 95 secs
lola: 31474475 markings, 35496823 edges, 277482 markings/sec, 100 secs
lola: 32873976 markings, 37057716 edges, 279900 markings/sec, 105 secs
lola: 34242970 markings, 38595038 edges, 273799 markings/sec, 110 secs
lola: 35634557 markings, 40118985 edges, 278317 markings/sec, 115 secs
lola: 37032138 markings, 41647229 edges, 279516 markings/sec, 120 secs
lola: 38399118 markings, 43194436 edges, 273396 markings/sec, 125 secs
lola: 39714995 markings, 44755861 edges, 263175 markings/sec, 130 secs
lola: 41082734 markings, 46269572 edges, 273548 markings/sec, 135 secs
lola: 42516578 markings, 47859197 edges, 286769 markings/sec, 140 secs
lola: 43929065 markings, 49457319 edges, 282497 markings/sec, 145 secs
lola: 45241435 markings, 50916966 edges, 262474 markings/sec, 150 secs
lola: 46596622 markings, 52449558 edges, 271037 markings/sec, 155 secs
lola: 47994954 markings, 54019785 edges, 279666 markings/sec, 160 secs
lola: 49277414 markings, 55458142 edges, 256492 markings/sec, 165 secs
lola: 50643015 markings, 56948514 edges, 273120 markings/sec, 170 secs
lola: 51987190 markings, 58439991 edges, 268835 markings/sec, 175 secs
lola: 53276959 markings, 59990855 edges, 257954 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA PermAdmissibility-PT-50-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-PT-50-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished 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="PermAdmissibility-PT-50"
export BK_EXAMINATION="CTLCardinality"
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/PermAdmissibility-PT-50.tgz
mv PermAdmissibility-PT-50 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 PermAdmissibility-PT-50, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r115-csrt-152666474100507"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;