fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r210-smll-152732260700309
Last Updated
June 26, 2018

About the Execution of Irma.full for HypertorusGrid-PT-d5k3p2b10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15900.540 414512.00 375701.00 2476.00 FTT?TTFT?TFFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 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-full
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 r210-smll-152732260700309
=====================================================================


--------------------
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 1527414470802


BK_STOP 1527414885314

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using 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 stdout -----
----- Start make result stderr -----
LTLCardinality @ HypertorusGrid-PT-d5k3p2b10 @ 3540 seconds
----- Start make result stdout -----
----- 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: 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: 3370 markings, 3369 edges, 674 markings/sec, 0 secs
lola: 3391 markings, 3390 edges, 4 markings/sec, 5 secs
lola: 3425 markings, 3424 edges, 7 markings/sec, 10 secs
lola: 3534 markings, 3533 edges, 22 markings/sec, 15 secs
lola: 3584 markings, 3583 edges, 10 markings/sec, 20 secs
lola: 3604 markings, 3603 edges, 4 markings/sec, 25 secs
lola: 3625 markings, 3624 edges, 4 markings/sec, 30 secs
lola: 3647 markings, 3646 edges, 4 markings/sec, 35 secs
lola: 3659 markings, 3658 edges, 2 markings/sec, 40 secs
lola: 3675 markings, 3674 edges, 3 markings/sec, 45 secs
lola: 3687 markings, 3686 edges, 2 markings/sec, 50 secs
lola: 3704 markings, 3703 edges, 3 markings/sec, 55 secs
lola: 3713 markings, 3712 edges, 2 markings/sec, 60 secs
lola: 3722 markings, 3721 edges, 2 markings/sec, 65 secs
lola: 3731 markings, 3730 edges, 2 markings/sec, 70 secs
lola: 3740 markings, 3739 edges, 2 markings/sec, 75 secs
lola: 3750 markings, 3749 edges, 2 markings/sec, 80 secs
lola: 3761 markings, 3760 edges, 2 markings/sec, 85 secs
lola: 3772 markings, 3771 edges, 2 markings/sec, 90 secs
lola: 3783 markings, 3782 edges, 2 markings/sec, 95 secs
lola: 3793 markings, 3792 edges, 2 markings/sec, 100 secs
lola: 3803 markings, 3802 edges, 2 markings/sec, 105 secs
lola: 3814 markings, 3813 edges, 2 markings/sec, 110 secs
lola: 3823 markings, 3822 edges, 2 markings/sec, 115 secs
lola: 3827 markings, 3826 edges, 1 markings/sec, 120 secs
lola: 3832 markings, 3831 edges, 1 markings/sec, 125 secs
lola: 3837 markings, 3836 edges, 1 markings/sec, 130 secs
lola: 3842 markings, 3841 edges, 1 markings/sec, 135 secs
lola: 3847 markings, 3846 edges, 1 markings/sec, 140 secs
lola: 3855 markings, 3854 edges, 2 markings/sec, 145 secs
lola: 3863 markings, 3862 edges, 2 markings/sec, 150 secs
lola: 3872 markings, 3871 edges, 2 markings/sec, 155 secs
lola: 3880 markings, 3879 edges, 2 markings/sec, 160 secs
lola: 3887 markings, 3886 edges, 1 markings/sec, 165 secs
lola: 3893 markings, 3892 edges, 1 markings/sec, 170 secs
lola: 3901 markings, 3900 edges, 2 markings/sec, 175 secs
lola: 3908 markings, 3907 edges, 1 markings/sec, 180 secs
lola: 3916 markings, 3915 edges, 2 markings/sec, 185 secs
lola: 3923 markings, 3922 edges, 1 markings/sec, 190 secs
lola: 3929 markings, 3928 edges, 1 markings/sec, 195 secs
lola: 3935 markings, 3934 edges, 1 markings/sec, 200 secs
lola: 3945 markings, 3944 edges, 2 markings/sec, 205 secs
lola: 3954 markings, 3953 edges, 2 markings/sec, 210 secs
lola: 3963 markings, 3962 edges, 2 markings/sec, 215 secs
lola: 3970 markings, 3969 edges, 1 markings/sec, 220 secs
lola: 3977 markings, 3976 edges, 1 markings/sec, 225 secs
lola: 3985 markings, 3984 edges, 2 markings/sec, 230 secs
lola: 3992 markings, 3991 edges, 1 markings/sec, 235 secs
lola: 3998 markings, 3997 edges, 1 markings/sec, 240 secs
lola: 4006 markings, 4005 edges, 2 markings/sec, 245 secs
lola: 4014 markings, 4013 edges, 2 markings/sec, 250 secs
lola: 4021 markings, 4020 edges, 1 markings/sec, 255 secs
lola: 4027 markings, 4026 edges, 1 markings/sec, 260 secs
lola: 4037 markings, 4036 edges, 2 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 363 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: 65169 markings, 65520 edges, 13034 markings/sec, 0 secs
lola: 128058 markings, 129489 edges, 12578 markings/sec, 5 secs
lola: 185827 markings, 188829 edges, 11554 markings/sec, 10 secs
lola: 240213 markings, 245262 edges, 10877 markings/sec, 15 secs
lola: 298548 markings, 306423 edges, 11667 markings/sec, 20 secs
lola: 346288 markings, 357018 edges, 9548 markings/sec, 25 secs
lola: 398564 markings, 412929 edges, 10455 markings/sec, 30 secs
lola: 443208 markings, 461090 edges, 8929 markings/sec, 35 secs
lola: 488071 markings, 510015 edges, 8973 markings/sec, 40 secs
lola: 528437 markings, 554314 edges, 8073 markings/sec, 45 secs
lola: 569596 markings, 599730 edges, 8232 markings/sec, 50 secs
lola: 606128 markings, 640581 edges, 7306 markings/sec, 55 secs
lola: 647937 markings, 687558 edges, 8362 markings/sec, 60 secs
lola: 692310 markings, 738063 edges, 8875 markings/sec, 65 secs
lola: 734366 markings, 786368 edges, 8411 markings/sec, 70 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 455 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 531 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 637 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 796 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: 68187 markings, 118449 edges, 13637 markings/sec, 0 secs
lola: 139283 markings, 232832 edges, 14219 markings/sec, 5 secs
lola: 217968 markings, 341901 edges, 15737 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 1057 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 1586 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 3172 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 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="HypertorusGrid-PT-d5k3p2b10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/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-full"
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 r210-smll-152732260700309"
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 ;