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 14M
-rw-r--r-- 1 mcc users 5.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 4.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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.9K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 28K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 118 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 356 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 14M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is HypertorusGrid-PT-d5k3p2b10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-152732261900309
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527428746674


BK_STOP 1527429226999

--------------------
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 HypertorusGrid-PT-d5k3p2b10 as instance name.
Using HypertorusGrid 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': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 3540348, 'Memory': 15900.35, 'Tool': 'lola'}, {'Time': 3540612, 'Memory': 15937.5, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola HypertorusGrid-PT-d5k3p2b10...

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


checking for too many tokens
===========================================================================================
HypertorusGrid-PT-d5k3p2b10: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ HypertorusGrid-PT-d5k3p2b10 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 31833/65536 symbol table entries, 17230 collisions
lola: preprocessing...
lola: finding significant places
lola: 7533 places, 24300 transitions, 4859 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 26973 transition conflict sets
lola: TASK
lola: reading formula from HypertorusGrid-PT-d5k3p2b10-LTLCardinality.task
lola: A ((G (F ((3 <= po_d3_n1_2_1_2_3_3))) U X (G ((3 <= pil_d3_n1_2_2_2_2_3))))) : A ((pol_d5_n1_2_1_2_1_1 <= pil_d5_n1_2_1_2_1_3)) : A (F ((pol_d4_n1_2_1_2_1_3 <= pil_d2_n1_3_2_2_2_2))) : A ((((pb_d2_n1_2_1_1_1_3 <= pb_d4_n1_3_1_1_3_2) U (pol_d2_n1_1_3_3_1_1 <= pbl_2_1_2_2_2)) U F ((3 <= pol_d4_n1_2_1_2_2_3)))) : A (((pbl_2_2_2_2_1 <= pol_d2_n1_2_3_3_3_2) U ((po_d3_n1_1_3_1_1_1 <= pol_d5_n1_2_3_2_1_1) U (pi_d3_n1_2_3_1_2_1 <= pb_d4_n1_3_2_3_2_3)))) : A (X ((po_d5_n1_1_1_2_1_2 <= pol_d2_n1_1_3_1_2_3))) : A (X (X ((3 <= pb_d3_n1_1_2_2_3_2)))) : A ((po_d3_n1_1_3_2_3_2 <= po_d1_n1_1_3_2_1_2)) : A (X ((X ((3 <= pb_d3_n1_1_2_3_3_2)) U X ((1 <= pb_d2_n2_3_3_3_1_2))))) : A (F ((G ((1 <= pol_d3_n1_3_1_2_1_2)) U X ((pi_d1_n1_3_1_3_1_1 <= pb_d3_n2_3_1_1_3_3))))) : A ((pb_d3_n2_2_2_1_3_3 <= pil_d4_n1_3_1_1_1_1)) : A (X ((X ((pbl_3_2_1_3_3 <= pol_d1_n1_3_2_2_3_1)) U X ((pol_d3_n1_3_1_1_2_1 <= pi_d1_n1_3_3_1_2_2))))) : A ((X (G ((3 <= pb_d2_n2_3_1_1_3_3))) U G ((3 <= pbl_2_1_1_3_3)))) : A (X ((po_d3_n1_1_3_1_1_1 <= pi_d2_n1_2_2_3_2_1))) : A ((3 <= pol_d4_n1_1_3_2_2_2)) : A ((2 <= pol_d2_n1_1_3_2_2_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 ((G (F ((3 <= po_d3_n1_2_1_2_3_3))) U X (G ((3 <= pil_d3_n1_2_2_2_2_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (F ((3 <= po_d3_n1_2_1_2_3_3))) U X (G ((3 <= pil_d3_n1_2_2_2_2_3)))))
lola: processed formula: A ((G (F ((3 <= po_d3_n1_2_1_2_3_3))) U X (G ((3 <= pil_d3_n1_2_2_2_2_3)))))
lola: processed formula length: 76
lola: 0 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19440 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1029 markings, 1029 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pol_d5_n1_2_1_2_1_1 <= pil_d5_n1_2_1_2_1_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pol_d5_n1_2_1_2_1_1 <= pil_d5_n1_2_1_2_1_3)
lola: processed formula length: 44
lola: 1 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-LTLCardinality.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pol_d4_n1_2_1_2_1_3 <= pil_d2_n1_3_2_2_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((pol_d4_n1_2_1_2_1_3 <= pil_d2_n1_3_2_2_2_2)))
lola: processed formula: A (F ((pol_d4_n1_2_1_2_1_3 <= pil_d2_n1_3_2_2_2_2)))
lola: processed formula length: 52
lola: 0 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19440 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((pb_d2_n1_2_1_1_1_3 <= pb_d4_n1_3_1_1_3_2) U (pol_d2_n1_1_3_3_1_1 <= pbl_2_1_2_2_2)) U F ((3 <= pol_d4_n1_2_1_2_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((pb_d2_n1_2_1_1_1_3 <= pb_d4_n1_3_1_1_3_2) U (pol_d2_n1_1_3_3_1_1 <= pbl_2_1_2_2_2)) U F ((3 <= pol_d4_n1_2_1_2_2_3))))
lola: processed formula: A ((((pb_d2_n1_2_1_1_1_3 <= pb_d4_n1_3_1_1_3_2) U (pol_d2_n1_1_3_3_1_1 <= pbl_2_1_2_2_2)) U F ((3 <= pol_d4_n1_2_1_2_2_3))))
lola: processed formula length: 124
lola: 0 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19440 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 3372 markings, 3371 edges, 674 markings/sec, 0 secs
lola: 3391 markings, 3390 edges, 4 markings/sec, 5 secs
lola: 3423 markings, 3422 edges, 6 markings/sec, 10 secs
lola: 3525 markings, 3524 edges, 20 markings/sec, 15 secs
lola: 3583 markings, 3582 edges, 12 markings/sec, 20 secs
lola: 3600 markings, 3599 edges, 3 markings/sec, 25 secs
lola: 3622 markings, 3621 edges, 4 markings/sec, 30 secs
lola: 3644 markings, 3643 edges, 4 markings/sec, 35 secs
lola: 3658 markings, 3657 edges, 3 markings/sec, 40 secs
lola: 3672 markings, 3671 edges, 3 markings/sec, 45 secs
lola: 3683 markings, 3682 edges, 2 markings/sec, 50 secs
lola: 3699 markings, 3698 edges, 3 markings/sec, 55 secs
lola: 3710 markings, 3709 edges, 2 markings/sec, 60 secs
lola: 3720 markings, 3719 edges, 2 markings/sec, 65 secs
lola: 3729 markings, 3728 edges, 2 markings/sec, 70 secs
lola: 3738 markings, 3737 edges, 2 markings/sec, 75 secs
lola: 3748 markings, 3747 edges, 2 markings/sec, 80 secs
lola: 3759 markings, 3758 edges, 2 markings/sec, 85 secs
lola: 3770 markings, 3769 edges, 2 markings/sec, 90 secs
lola: 3780 markings, 3779 edges, 2 markings/sec, 95 secs
lola: 3790 markings, 3789 edges, 2 markings/sec, 100 secs
lola: 3802 markings, 3801 edges, 2 markings/sec, 105 secs
lola: 3813 markings, 3812 edges, 2 markings/sec, 110 secs
lola: 3821 markings, 3820 edges, 2 markings/sec, 115 secs
lola: 3827 markings, 3826 edges, 1 markings/sec, 120 secs
lola: 3830 markings, 3829 edges, 1 markings/sec, 125 secs
lola: 3835 markings, 3834 edges, 1 markings/sec, 130 secs
lola: 3840 markings, 3839 edges, 1 markings/sec, 135 secs
lola: 3846 markings, 3845 edges, 1 markings/sec, 140 secs
lola: 3853 markings, 3852 edges, 1 markings/sec, 145 secs
lola: 3862 markings, 3861 edges, 2 markings/sec, 150 secs
lola: 3869 markings, 3868 edges, 1 markings/sec, 155 secs
lola: 3877 markings, 3876 edges, 2 markings/sec, 160 secs
lola: 3884 markings, 3883 edges, 1 markings/sec, 165 secs
lola: 3892 markings, 3891 edges, 2 markings/sec, 170 secs
lola: 3899 markings, 3898 edges, 1 markings/sec, 175 secs
lola: 3907 markings, 3906 edges, 2 markings/sec, 180 secs
lola: 3914 markings, 3913 edges, 1 markings/sec, 185 secs
lola: 3920 markings, 3919 edges, 1 markings/sec, 190 secs
lola: 3928 markings, 3927 edges, 2 markings/sec, 195 secs
lola: 3935 markings, 3934 edges, 1 markings/sec, 200 secs
lola: 3943 markings, 3942 edges, 2 markings/sec, 205 secs
lola: 3952 markings, 3951 edges, 2 markings/sec, 210 secs
lola: 3961 markings, 3960 edges, 2 markings/sec, 215 secs
lola: 3970 markings, 3969 edges, 2 markings/sec, 220 secs
lola: 3976 markings, 3975 edges, 1 markings/sec, 225 secs
lola: 3983 markings, 3982 edges, 1 markings/sec, 230 secs
lola: 3991 markings, 3990 edges, 2 markings/sec, 235 secs
lola: 3998 markings, 3997 edges, 1 markings/sec, 240 secs
lola: 4004 markings, 4003 edges, 1 markings/sec, 245 secs
lola: 4013 markings, 4012 edges, 2 markings/sec, 250 secs
lola: 4020 markings, 4019 edges, 1 markings/sec, 255 secs
lola: 4027 markings, 4026 edges, 1 markings/sec, 260 secs
lola: 4034 markings, 4033 edges, 1 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((pbl_2_2_2_2_1 <= pol_d2_n1_2_3_3_3_2) U ((po_d3_n1_1_3_1_1_1 <= pol_d5_n1_2_3_2_1_1) U (pi_d3_n1_2_3_1_2_1 <= pb_d4_n1_3_2_3_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((pbl_2_2_2_2_1 <= pol_d2_n1_2_3_3_3_2) U ((po_d3_n1_1_3_1_1_1 <= pol_d5_n1_2_3_2_1_1) U (pi_d3_n1_2_3_1_2_1 <= pb_d4_n1_3_2_3_2_3))))
lola: processed formula: A (((pbl_2_2_2_2_1 <= pol_d2_n1_2_3_3_3_2) U ((po_d3_n1_1_3_1_1_1 <= pol_d5_n1_2_3_2_1_1) U (pi_d3_n1_2_3_1_2_1 <= pb_d4_n1_3_2_3_2_3))))
lola: processed formula length: 137
lola: 0 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19440 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: 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 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((po_d5_n1_1_1_2_1_2 <= pol_d2_n1_1_3_1_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((po_d5_n1_1_1_2_1_2 <= pol_d2_n1_1_3_1_2_3)))
lola: processed formula: A (X ((po_d5_n1_1_1_2_1_2 <= pol_d2_n1_1_3_1_2_3)))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19440 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2431 markings, 2430 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((3 <= pb_d3_n1_1_2_2_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((3 <= pb_d3_n1_1_2_2_3_2))))
lola: processed formula: A (X (X ((3 <= pb_d3_n1_1_2_2_3_2))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19440 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1029 markings, 1029 edges
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((po_d3_n1_1_3_2_3_2 <= po_d1_n1_1_3_2_1_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (po_d3_n1_1_3_2_3_2 <= po_d1_n1_1_3_2_1_2)
lola: processed formula length: 42
lola: 1 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-LTLCardinality.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 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((3 <= pb_d3_n1_1_2_3_3_2)) U X ((1 <= pb_d2_n2_3_3_3_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (((3 <= pb_d3_n1_1_2_3_3_2) U (1 <= pb_d2_n2_3_3_3_1_2)))))
lola: processed formula: A (X (X (((3 <= pb_d3_n1_1_2_3_3_2) U (1 <= pb_d2_n2_3_3_3_1_2)))))
lola: processed formula length: 67
lola: 1 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19440 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 65316 markings, 65667 edges, 13063 markings/sec, 0 secs
lola: 126748 markings, 128126 edges, 12286 markings/sec, 5 secs
lola: 179299 markings, 182074 edges, 10510 markings/sec, 10 secs
lola: 231929 markings, 236612 edges, 10526 markings/sec, 15 secs
lola: 285323 markings, 292462 edges, 10679 markings/sec, 20 secs
lola: 336238 markings, 346248 edges, 10183 markings/sec, 25 secs
lola: 384337 markings, 397539 edges, 9620 markings/sec, 30 secs
lola: 431507 markings, 448342 edges, 9434 markings/sec, 35 secs
lola: 475596 markings, 496302 edges, 8818 markings/sec, 40 secs
lola: 515555 markings, 540086 edges, 7992 markings/sec, 45 secs
lola: 553654 markings, 582094 edges, 7620 markings/sec, 50 secs
lola: 592259 markings, 625155 edges, 7721 markings/sec, 55 secs
lola: 634517 markings, 672466 edges, 8452 markings/sec, 60 secs
lola: 674746 markings, 718110 edges, 8046 markings/sec, 65 secs
lola: 713882 markings, 762710 edges, 7827 markings/sec, 70 secs
lola: 750938 markings, 805555 edges, 7411 markings/sec, 75 secs
lola: 751936 markings, 806551 edges, 200 markings/sec, 80 secs
lola: 752016 markings, 806631 edges, 16 markings/sec, 85 secs
lola: 752039 markings, 806654 edges, 5 markings/sec, 90 secs
lola: 752068 markings, 806683 edges, 6 markings/sec, 95 secs
lola: 752084 markings, 806699 edges, 3 markings/sec, 100 secs
lola: 752101 markings, 806716 edges, 3 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 446 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((1 <= pol_d3_n1_3_1_2_1_2)) U X ((pi_d1_n1_3_1_3_1_1 <= pb_d3_n2_3_1_1_3_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((G ((1 <= pol_d3_n1_3_1_2_1_2)) U X ((pi_d1_n1_3_1_3_1_1 <= pb_d3_n2_3_1_1_3_3)))))
lola: processed formula: A (F ((G ((1 <= pol_d3_n1_3_1_2_1_2)) U X ((pi_d1_n1_3_1_3_1_1 <= pb_d3_n2_3_1_1_3_3)))))
lola: processed formula length: 89
lola: 0 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19440 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2431 markings, 2430 edges
lola: ========================================
lola: subprocess 10 will run for 520 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((pb_d3_n2_2_2_1_3_3 <= pil_d4_n1_3_1_1_1_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pb_d3_n2_2_2_1_3_3 <= pil_d4_n1_3_1_1_1_1)
lola: processed formula length: 43
lola: 1 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-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 11 will run for 624 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((pbl_3_2_1_3_3 <= pol_d1_n1_3_2_2_3_1)) U X ((pol_d3_n1_3_1_1_2_1 <= pi_d1_n1_3_3_1_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (((pbl_3_2_1_3_3 <= pol_d1_n1_3_2_2_3_1) U (pol_d3_n1_3_1_1_2_1 <= pi_d1_n1_3_3_1_2_2)))))
lola: processed formula: A (X (X (((pbl_3_2_1_3_3 <= pol_d1_n1_3_2_2_3_1) U (pol_d3_n1_3_1_1_2_1 <= pi_d1_n1_3_3_1_2_2)))))
lola: processed formula length: 98
lola: 1 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19440 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1029 markings, 1029 edges
lola: ========================================
lola: subprocess 12 will run for 780 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((3 <= pb_d2_n2_3_1_1_3_3))) U G ((3 <= pbl_2_1_1_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (G ((3 <= pb_d2_n2_3_1_1_3_3))) U G ((3 <= pbl_2_1_1_3_3))))
lola: processed formula: A ((X (G ((3 <= pb_d2_n2_3_1_1_3_3))) U G ((3 <= pbl_2_1_1_3_3))))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19440 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 67592 markings, 117444 edges, 13518 markings/sec, 0 secs
lola: 136776 markings, 228918 edges, 13837 markings/sec, 5 secs
lola: 210970 markings, 334594 edges, 14839 markings/sec, 10 secs
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: 218550 markings, 342529 edges
lola: ========================================
lola: subprocess 13 will run for 1035 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((po_d3_n1_1_3_1_1_1 <= pi_d2_n1_2_2_3_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((po_d3_n1_1_3_1_1_1 <= pi_d2_n1_2_2_3_2_1)))
lola: processed formula: A (X ((po_d3_n1_1_3_1_1_1 <= pi_d2_n1_2_2_3_2_1)))
lola: processed formula length: 50
lola: 0 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 19440 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1217 markings, 1217 edges
lola: ========================================
lola: subprocess 14 will run for 1553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= pol_d4_n1_1_3_2_2_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= pol_d4_n1_1_3_2_2_2)
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-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 15 will run for 3106 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= pol_d2_n1_1_3_2_2_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= pol_d2_n1_1_3_2_2_2)
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 7533 places; total mentions: 0
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-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: RESULT
lola:
SUMMARY: no yes yes unknown yes yes no yes unknown yes no no no no no no
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HypertorusGrid-PT-d5k3p2b10"
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/HypertorusGrid-PT-d5k3p2b10.tgz
mv HypertorusGrid-PT-d5k3p2b10 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 HypertorusGrid-PT-d5k3p2b10, 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 r211-smll-152732261900309"
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 ;