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 868K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.3K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 6.8K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 693K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is ResAllocation-PT-R003C100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r187-qhx2-152732139500145
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528269457484


BK_STOP 1528269745223

--------------------
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 ResAllocation-PT-R003C100 as instance name.
Using ResAllocation as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 1286, 'Memory': 188.57, 'Tool': 'lola'}, {'Time': 1485, 'Memory': 205.43, 'Tool': 'lola'}, {'Time': 3509760, 'Memory': 10384.22, 'Tool': 'itstools'}, {'Time': 3509812, 'Memory': 10394.88, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola ResAllocation-PT-R003C100...

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


checking for too many tokens
===========================================================================================
ResAllocation-PT-R003C100: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ ResAllocation-PT-R003C100 @ 3538 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1000/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 600 places, 400 transitions, 300 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 700 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C100-LTLCardinality.task
lola: A (F ((X ((1 <= p_91_1)) U G ((2 <= p_53_1))))) : A (F (X (X (G ((p_59_0 <= p_27_2)))))) : A ((2 <= p_45_2)) : A (F (F (F (X ((1 <= r_89_2)))))) : A (G (F (F (F ((1 <= r_10_0)))))) : A (G ((r_61_1 <= r_95_0))) : A ((((p_46_0 <= r_38_1) U (r_59_1 <= r_57_0)) U (p_58_1 <= r_68_0))) : A (X (F (((1 <= r_4_2) U (3 <= p_59_1))))) : A ((((p_4_2 <= r_22_2) U (3 <= p_17_2)) U F (X ((2 <= p_36_1))))) : A ((G (X ((3 <= r_15_1))) U X ((1 <= p_53_2)))) : A (G (F (((r_4_2 <= r_72_2) U (p_67_2 <= r_73_2))))) : A ((F (X ((3 <= p_55_0))) U (p_80_0 <= p_15_1))) : A ((X (G ((2 <= p_1_0))) U X (X ((2 <= p_18_2))))) : A (F (X ((2 <= r_59_0)))) : A (X ((2 <= r_37_0))) : A (F ((G ((p_4_2 <= p_53_1)) U G ((2 <= p_6_2)))))
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 ((X ((1 <= p_91_1)) U G ((2 <= p_53_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((X ((1 <= p_91_1)) U G ((2 <= p_53_1)))))
lola: processed formula: A (F ((X ((1 <= p_91_1)) U G ((2 <= p_53_1)))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 18 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: 5 markings, 6 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X (G ((p_59_0 <= p_27_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (X (G ((p_59_0 <= p_27_2))))))
lola: processed formula: A (F (X (X (G ((p_59_0 <= p_27_2))))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 367194 markings, 1957556 edges, 73439 markings/sec, 0 secs
lola: 692586 markings, 4613510 edges, 65078 markings/sec, 5 secs
lola: 987223 markings, 7176724 edges, 58927 markings/sec, 10 secs
lola: 1268411 markings, 9693947 edges, 56238 markings/sec, 15 secs
lola: 1524907 markings, 12082780 edges, 51299 markings/sec, 20 secs
lola: 1782263 markings, 14573111 edges, 51471 markings/sec, 25 secs
lola: 2061965 markings, 17068020 edges, 55940 markings/sec, 30 secs
lola: 2328153 markings, 19541733 edges, 53238 markings/sec, 35 secs
lola: 2583087 markings, 22009933 edges, 50987 markings/sec, 40 secs
lola: 2841141 markings, 24317843 edges, 51611 markings/sec, 45 secs
lola: 3094264 markings, 26652513 edges, 50625 markings/sec, 50 secs
lola: 3333820 markings, 28989243 edges, 47911 markings/sec, 55 secs
lola: 3602250 markings, 31332246 edges, 53686 markings/sec, 60 secs
lola: 3852316 markings, 33602047 edges, 50013 markings/sec, 65 secs
lola: 4090003 markings, 35810499 edges, 47537 markings/sec, 70 secs
lola: 4313797 markings, 37919144 edges, 44759 markings/sec, 75 secs
lola: 4525236 markings, 40005703 edges, 42288 markings/sec, 80 secs
lola: 4739151 markings, 42084848 edges, 42783 markings/sec, 85 secs
lola: 4950835 markings, 44242247 edges, 42337 markings/sec, 90 secs
lola: 5179340 markings, 46535020 edges, 45701 markings/sec, 95 secs
lola: 5387813 markings, 48718323 edges, 41695 markings/sec, 100 secs
lola: 5594396 markings, 50867386 edges, 41317 markings/sec, 105 secs
lola: 5795534 markings, 53060925 edges, 40228 markings/sec, 110 secs
lola: 6012995 markings, 55170322 edges, 43492 markings/sec, 115 secs
lola: 6219592 markings, 57264534 edges, 41319 markings/sec, 120 secs
lola: 6433907 markings, 59463191 edges, 42863 markings/sec, 125 secs
lola: 6649562 markings, 61671003 edges, 43131 markings/sec, 130 secs
lola: 6844763 markings, 63755635 edges, 39040 markings/sec, 135 secs
lola: 7045826 markings, 65869370 edges, 40213 markings/sec, 140 secs
lola: 7268877 markings, 68092731 edges, 44610 markings/sec, 145 secs
lola: 7490886 markings, 70318467 edges, 44402 markings/sec, 150 secs
lola: 7700840 markings, 72483374 edges, 41991 markings/sec, 155 secs
lola: 7914295 markings, 74706051 edges, 42691 markings/sec, 160 secs
lola: 8111123 markings, 76827457 edges, 39366 markings/sec, 165 secs
lola: 8333613 markings, 78941803 edges, 44498 markings/sec, 170 secs
lola: 8566690 markings, 81066087 edges, 46615 markings/sec, 175 secs
lola: 8788463 markings, 83142969 edges, 44355 markings/sec, 180 secs
lola: 9000891 markings, 85243185 edges, 42486 markings/sec, 185 secs
lola: 9223175 markings, 87451223 edges, 44457 markings/sec, 190 secs
lola: 9436000 markings, 89631168 edges, 42565 markings/sec, 195 secs
lola: 9645733 markings, 91800690 edges, 41947 markings/sec, 200 secs
lola: 9850900 markings, 93937860 edges, 41033 markings/sec, 205 secs
lola: 10067856 markings, 96130633 edges, 43391 markings/sec, 210 secs
lola: 10278435 markings, 98273794 edges, 42116 markings/sec, 215 secs
lola: 10482673 markings, 100419791 edges, 40848 markings/sec, 220 secs
lola: 10689598 markings, 102550155 edges, 41385 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p_45_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p_45_2)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-LTLCardinality.task
lola: processed formula with 1 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 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (X ((1 <= r_89_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X ((1 <= r_89_2))))
lola: processed formula: A (F (X ((1 <= r_89_2))))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 18 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: 51 markings, 51 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F (F ((1 <= r_10_0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((1 <= r_10_0))))
lola: processed formula: A (G (F ((1 <= r_10_0))))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 18 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: 9077 markings, 11771 edges
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((r_61_1 <= r_95_0)))
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 40 bytes per marking, with 20 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p_46_0 <= r_38_1) U (r_59_1 <= r_57_0)) U (p_58_1 <= r_68_0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p_46_0 <= r_38_1) U (r_59_1 <= r_57_0)) U (p_58_1 <= r_68_0)))
lola: processed formula: A ((((p_46_0 <= r_38_1) U (r_59_1 <= r_57_0)) U (p_58_1 <= r_68_0)))
lola: processed formula length: 68
lola: 0 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 18 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 366 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (((1 <= r_4_2) U (3 <= p_59_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (((1 <= r_4_2) U (3 <= p_59_1)))))
lola: processed formula: A (X (F (((1 <= r_4_2) U (3 <= p_59_1)))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 18 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p_4_2 <= r_22_2) U (3 <= p_17_2)) U F (X ((2 <= p_36_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p_4_2 <= r_22_2) U (3 <= p_17_2)) U F (X ((2 <= p_36_1)))))
lola: processed formula: A ((((p_4_2 <= r_22_2) U (3 <= p_17_2)) U F (X ((2 <= p_36_1)))))
lola: processed formula length: 65
lola: 0 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 18 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 9 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (X ((3 <= r_15_1))) U X ((1 <= p_53_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (X ((3 <= r_15_1))) U X ((1 <= p_53_2))))
lola: processed formula: A ((G (X ((3 <= r_15_1))) U X ((1 <= p_53_2))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 17 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((r_4_2 <= r_72_2) U (p_67_2 <= r_73_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (((r_4_2 <= r_72_2) U (p_67_2 <= r_73_2)))))
lola: processed formula: A (G (F (((r_4_2 <= r_72_2) U (p_67_2 <= r_73_2)))))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 18 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: 9423 markings, 12222 edges
lola: ========================================
lola: subprocess 11 will run for 660 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((3 <= p_55_0))) U (p_80_0 <= p_15_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((3 <= p_55_0))) U (p_80_0 <= p_15_1)))
lola: processed formula: A ((F (X ((3 <= p_55_0))) U (p_80_0 <= p_15_1)))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 18 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 825 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((2 <= p_1_0))) U X (X ((2 <= p_18_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G ((2 <= p_1_0)) U X ((2 <= p_18_2)))))
lola: processed formula: A (X ((G ((2 <= p_1_0)) U X ((2 <= p_18_2)))))
lola: processed formula length: 46
lola: 1 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 17 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 13 will run for 1100 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X ((2 <= r_59_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X ((2 <= r_59_0))))
lola: processed formula: A (F (X ((2 <= r_59_0))))
lola: processed formula length: 25
lola: 0 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 18 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 14 will run for 1651 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= r_37_0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((2 <= r_37_0)))
lola: processed formula: A (X ((2 <= r_37_0)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 18 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 15 will run for 3302 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((p_4_2 <= p_53_1)) U G ((2 <= p_6_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((p_4_2 <= p_53_1)) U G ((2 <= p_6_2)))))
lola: processed formula: A (F ((G ((p_4_2 <= p_53_1)) U G ((2 <= p_6_2)))))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 600 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 18 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: 58 markings, 59 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no no no no yes no no no no yes no no no no
FORMULA ResAllocation-PT-R003C100-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C100-LTLCardinality-15 FALSE 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="ResAllocation-PT-R003C100"
export BK_EXAMINATION="LTLCardinality"
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/ResAllocation-PT-R003C100.tgz
mv ResAllocation-PT-R003C100 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 ResAllocation-PT-R003C100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r187-qhx2-152732139500145"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;