fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r011-tall-162038006100229
Last Updated
Jun 28, 2021

About the Execution of 2020-gold for AutoFlight-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6185.924 3600000.00 3637644.00 8163.30 TFTF?T?T?T?TTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r011-tall-162038006100229.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is AutoFlight-PT-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038006100229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 23 01:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 01:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 10:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 10:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 134K May 5 16:51 model.pnml

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

=== Now, execution of the tool begins

BK_START 1620435912073

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 01:05:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-08 01:05:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 01:05:13] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2021-05-08 01:05:13] [INFO ] Transformed 574 places.
[2021-05-08 01:05:13] [INFO ] Transformed 572 transitions.
[2021-05-08 01:05:13] [INFO ] Found NUPN structural information;
[2021-05-08 01:05:13] [INFO ] Parsed PT model containing 574 places and 572 transitions in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 34 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 350 resets, run finished after 450 ms. (steps per millisecond=222 ) properties seen :[0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1]
// Phase 1: matrix 572 rows 574 cols
[2021-05-08 01:05:14] [INFO ] Computed 40 place invariants in 17 ms
[2021-05-08 01:05:14] [INFO ] [Real]Absence check using 39 positive place invariants in 40 ms returned sat
[2021-05-08 01:05:14] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 01:05:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:05:15] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2021-05-08 01:05:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:05:15] [INFO ] [Nat]Absence check using 39 positive place invariants in 26 ms returned unsat
[2021-05-08 01:05:15] [INFO ] [Real]Absence check using 39 positive place invariants in 34 ms returned sat
[2021-05-08 01:05:15] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 13 ms returned sat
[2021-05-08 01:05:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:05:16] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2021-05-08 01:05:16] [INFO ] Deduced a trap composed of 40 places in 222 ms
[2021-05-08 01:05:16] [INFO ] Deduced a trap composed of 64 places in 178 ms
[2021-05-08 01:05:16] [INFO ] Deduced a trap composed of 29 places in 170 ms
[2021-05-08 01:05:16] [INFO ] Deduced a trap composed of 48 places in 167 ms
[2021-05-08 01:05:17] [INFO ] Deduced a trap composed of 62 places in 164 ms
[2021-05-08 01:05:17] [INFO ] Deduced a trap composed of 45 places in 173 ms
[2021-05-08 01:05:17] [INFO ] Deduced a trap composed of 88 places in 174 ms
[2021-05-08 01:05:17] [INFO ] Deduced a trap composed of 33 places in 159 ms
[2021-05-08 01:05:17] [INFO ] Deduced a trap composed of 60 places in 162 ms
[2021-05-08 01:05:18] [INFO ] Deduced a trap composed of 53 places in 162 ms
[2021-05-08 01:05:18] [INFO ] Deduced a trap composed of 77 places in 164 ms
[2021-05-08 01:05:18] [INFO ] Deduced a trap composed of 62 places in 158 ms
[2021-05-08 01:05:18] [INFO ] Deduced a trap composed of 61 places in 158 ms
[2021-05-08 01:05:18] [INFO ] Deduced a trap composed of 62 places in 147 ms
[2021-05-08 01:05:18] [INFO ] Deduced a trap composed of 55 places in 144 ms
[2021-05-08 01:05:19] [INFO ] Deduced a trap composed of 74 places in 147 ms
[2021-05-08 01:05:19] [INFO ] Deduced a trap composed of 55 places in 131 ms
[2021-05-08 01:05:19] [INFO ] Deduced a trap composed of 72 places in 121 ms
[2021-05-08 01:05:19] [INFO ] Deduced a trap composed of 83 places in 119 ms
[2021-05-08 01:05:19] [INFO ] Deduced a trap composed of 52 places in 120 ms
[2021-05-08 01:05:19] [INFO ] Deduced a trap composed of 86 places in 128 ms
[2021-05-08 01:05:20] [INFO ] Deduced a trap composed of 39 places in 124 ms
[2021-05-08 01:05:20] [INFO ] Deduced a trap composed of 75 places in 131 ms
[2021-05-08 01:05:20] [INFO ] Deduced a trap composed of 70 places in 126 ms
[2021-05-08 01:05:20] [INFO ] Deduced a trap composed of 85 places in 130 ms
[2021-05-08 01:05:20] [INFO ] Deduced a trap composed of 87 places in 143 ms
[2021-05-08 01:05:20] [INFO ] Deduced a trap composed of 72 places in 141 ms
[2021-05-08 01:05:20] [INFO ] Deduced a trap composed of 81 places in 114 ms
[2021-05-08 01:05:21] [INFO ] Deduced a trap composed of 101 places in 109 ms
[2021-05-08 01:05:21] [INFO ] Deduced a trap composed of 84 places in 104 ms
[2021-05-08 01:05:21] [INFO ] Deduced a trap composed of 90 places in 108 ms
[2021-05-08 01:05:21] [INFO ] Deduced a trap composed of 84 places in 108 ms
[2021-05-08 01:05:21] [INFO ] Deduced a trap composed of 112 places in 110 ms
[2021-05-08 01:05:21] [INFO ] Deduced a trap composed of 91 places in 107 ms
[2021-05-08 01:05:21] [INFO ] Deduced a trap composed of 109 places in 115 ms
[2021-05-08 01:05:22] [INFO ] Deduced a trap composed of 82 places in 114 ms
[2021-05-08 01:05:22] [INFO ] Deduced a trap composed of 97 places in 114 ms
[2021-05-08 01:05:22] [INFO ] Deduced a trap composed of 85 places in 117 ms
[2021-05-08 01:05:22] [INFO ] Deduced a trap composed of 97 places in 123 ms
[2021-05-08 01:05:22] [INFO ] Deduced a trap composed of 85 places in 123 ms
[2021-05-08 01:05:22] [INFO ] Deduced a trap composed of 93 places in 121 ms
[2021-05-08 01:05:22] [INFO ] Deduced a trap composed of 91 places in 122 ms
[2021-05-08 01:05:23] [INFO ] Deduced a trap composed of 90 places in 118 ms
[2021-05-08 01:05:23] [INFO ] Deduced a trap composed of 86 places in 121 ms
[2021-05-08 01:05:23] [INFO ] Deduced a trap composed of 82 places in 125 ms
[2021-05-08 01:05:23] [INFO ] Deduced a trap composed of 87 places in 115 ms
[2021-05-08 01:05:23] [INFO ] Deduced a trap composed of 84 places in 108 ms
[2021-05-08 01:05:23] [INFO ] Deduced a trap composed of 87 places in 144 ms
[2021-05-08 01:05:23] [INFO ] Deduced a trap composed of 81 places in 101 ms
[2021-05-08 01:05:24] [INFO ] Deduced a trap composed of 60 places in 139 ms
[2021-05-08 01:05:24] [INFO ] Deduced a trap composed of 76 places in 118 ms
[2021-05-08 01:05:24] [INFO ] Deduced a trap composed of 80 places in 99 ms
[2021-05-08 01:05:24] [INFO ] Deduced a trap composed of 74 places in 99 ms
[2021-05-08 01:05:24] [INFO ] Deduced a trap composed of 102 places in 102 ms
[2021-05-08 01:05:24] [INFO ] Deduced a trap composed of 96 places in 103 ms
[2021-05-08 01:05:24] [INFO ] Deduced a trap composed of 105 places in 109 ms
[2021-05-08 01:05:24] [INFO ] Deduced a trap composed of 99 places in 111 ms
[2021-05-08 01:05:25] [INFO ] Deduced a trap composed of 93 places in 111 ms
[2021-05-08 01:05:25] [INFO ] Trap strengthening (SAT) tested/added 59/58 trap constraints in 8925 ms
[2021-05-08 01:05:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:05:25] [INFO ] [Nat]Absence check using 39 positive place invariants in 256 ms returned sat
[2021-05-08 01:05:25] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 01:05:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:05:26] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2021-05-08 01:05:26] [INFO ] Deduced a trap composed of 90 places in 163 ms
[2021-05-08 01:05:26] [INFO ] Deduced a trap composed of 55 places in 165 ms
[2021-05-08 01:05:26] [INFO ] Deduced a trap composed of 29 places in 158 ms
[2021-05-08 01:05:26] [INFO ] Deduced a trap composed of 56 places in 162 ms
[2021-05-08 01:05:27] [INFO ] Deduced a trap composed of 33 places in 159 ms
[2021-05-08 01:05:27] [INFO ] Deduced a trap composed of 55 places in 157 ms
[2021-05-08 01:05:27] [INFO ] Deduced a trap composed of 54 places in 155 ms
[2021-05-08 01:05:27] [INFO ] Deduced a trap composed of 42 places in 157 ms
[2021-05-08 01:05:27] [INFO ] Deduced a trap composed of 62 places in 153 ms
[2021-05-08 01:05:27] [INFO ] Deduced a trap composed of 45 places in 151 ms
[2021-05-08 01:05:28] [INFO ] Deduced a trap composed of 66 places in 145 ms
[2021-05-08 01:05:28] [INFO ] Deduced a trap composed of 60 places in 152 ms
[2021-05-08 01:05:28] [INFO ] Deduced a trap composed of 51 places in 148 ms
[2021-05-08 01:05:28] [INFO ] Deduced a trap composed of 39 places in 151 ms
[2021-05-08 01:05:28] [INFO ] Deduced a trap composed of 57 places in 139 ms
[2021-05-08 01:05:28] [INFO ] Deduced a trap composed of 46 places in 134 ms
[2021-05-08 01:05:29] [INFO ] Deduced a trap composed of 77 places in 139 ms
[2021-05-08 01:05:29] [INFO ] Deduced a trap composed of 65 places in 149 ms
[2021-05-08 01:05:29] [INFO ] Deduced a trap composed of 51 places in 152 ms
[2021-05-08 01:05:29] [INFO ] Deduced a trap composed of 71 places in 139 ms
[2021-05-08 01:05:29] [INFO ] Deduced a trap composed of 75 places in 140 ms
[2021-05-08 01:05:29] [INFO ] Deduced a trap composed of 69 places in 134 ms
[2021-05-08 01:05:29] [INFO ] Deduced a trap composed of 52 places in 131 ms
[2021-05-08 01:05:30] [INFO ] Deduced a trap composed of 68 places in 147 ms
[2021-05-08 01:05:30] [INFO ] Deduced a trap composed of 17 places in 131 ms
[2021-05-08 01:05:30] [INFO ] Deduced a trap composed of 39 places in 142 ms
[2021-05-08 01:05:30] [INFO ] Deduced a trap composed of 83 places in 134 ms
[2021-05-08 01:05:30] [INFO ] Deduced a trap composed of 68 places in 142 ms
[2021-05-08 01:05:30] [INFO ] Deduced a trap composed of 71 places in 140 ms
[2021-05-08 01:05:31] [INFO ] Deduced a trap composed of 54 places in 141 ms
[2021-05-08 01:05:31] [INFO ] Deduced a trap composed of 53 places in 133 ms
[2021-05-08 01:05:31] [INFO ] Deduced a trap composed of 81 places in 147 ms
[2021-05-08 01:05:31] [INFO ] Deduced a trap composed of 48 places in 129 ms
[2021-05-08 01:05:31] [INFO ] Deduced a trap composed of 87 places in 119 ms
[2021-05-08 01:05:31] [INFO ] Deduced a trap composed of 88 places in 115 ms
[2021-05-08 01:05:31] [INFO ] Deduced a trap composed of 89 places in 116 ms
[2021-05-08 01:05:32] [INFO ] Deduced a trap composed of 55 places in 120 ms
[2021-05-08 01:05:32] [INFO ] Deduced a trap composed of 66 places in 142 ms
[2021-05-08 01:05:32] [INFO ] Deduced a trap composed of 79 places in 124 ms
[2021-05-08 01:05:32] [INFO ] Deduced a trap composed of 95 places in 109 ms
[2021-05-08 01:05:32] [INFO ] Deduced a trap composed of 107 places in 108 ms
[2021-05-08 01:05:32] [INFO ] Deduced a trap composed of 89 places in 109 ms
[2021-05-08 01:05:32] [INFO ] Deduced a trap composed of 83 places in 116 ms
[2021-05-08 01:05:33] [INFO ] Deduced a trap composed of 108 places in 109 ms
[2021-05-08 01:05:33] [INFO ] Deduced a trap composed of 102 places in 130 ms
[2021-05-08 01:05:33] [INFO ] Deduced a trap composed of 109 places in 99 ms
[2021-05-08 01:05:33] [INFO ] Deduced a trap composed of 97 places in 104 ms
[2021-05-08 01:05:33] [INFO ] Deduced a trap composed of 101 places in 106 ms
[2021-05-08 01:05:33] [INFO ] Deduced a trap composed of 90 places in 138 ms
[2021-05-08 01:05:33] [INFO ] Deduced a trap composed of 30 places in 125 ms
[2021-05-08 01:05:34] [INFO ] Deduced a trap composed of 70 places in 125 ms
[2021-05-08 01:05:34] [INFO ] Deduced a trap composed of 84 places in 121 ms
[2021-05-08 01:05:34] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 8073 ms
[2021-05-08 01:05:34] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints in 47 ms.
[2021-05-08 01:05:37] [INFO ] Added : 562 causal constraints over 114 iterations in 3436 ms. Result :sat
[2021-05-08 01:05:37] [INFO ] [Real]Absence check using 39 positive place invariants in 33 ms returned sat
[2021-05-08 01:05:37] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 01:05:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:05:38] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2021-05-08 01:05:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:05:38] [INFO ] [Nat]Absence check using 39 positive place invariants in 22 ms returned unsat
[2021-05-08 01:05:38] [INFO ] [Real]Absence check using 39 positive place invariants in 33 ms returned sat
[2021-05-08 01:05:38] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 01:05:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:05:39] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2021-05-08 01:05:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:05:39] [INFO ] [Nat]Absence check using 39 positive place invariants in 242 ms returned sat
[2021-05-08 01:05:39] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 01:05:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:05:40] [INFO ] [Nat]Absence check using state equation in 628 ms returned sat
[2021-05-08 01:05:40] [INFO ] Deduced a trap composed of 25 places in 176 ms
[2021-05-08 01:05:40] [INFO ] Deduced a trap composed of 28 places in 165 ms
[2021-05-08 01:05:40] [INFO ] Deduced a trap composed of 81 places in 166 ms
[2021-05-08 01:05:41] [INFO ] Deduced a trap composed of 66 places in 169 ms
[2021-05-08 01:05:41] [INFO ] Deduced a trap composed of 51 places in 152 ms
[2021-05-08 01:05:41] [INFO ] Deduced a trap composed of 54 places in 152 ms
[2021-05-08 01:05:41] [INFO ] Deduced a trap composed of 53 places in 148 ms
[2021-05-08 01:05:41] [INFO ] Deduced a trap composed of 62 places in 156 ms
[2021-05-08 01:05:41] [INFO ] Deduced a trap composed of 36 places in 138 ms
[2021-05-08 01:05:42] [INFO ] Deduced a trap composed of 29 places in 142 ms
[2021-05-08 01:05:42] [INFO ] Deduced a trap composed of 64 places in 142 ms
[2021-05-08 01:05:42] [INFO ] Deduced a trap composed of 33 places in 143 ms
[2021-05-08 01:05:42] [INFO ] Deduced a trap composed of 39 places in 149 ms
[2021-05-08 01:05:42] [INFO ] Deduced a trap composed of 61 places in 143 ms
[2021-05-08 01:05:42] [INFO ] Deduced a trap composed of 62 places in 140 ms
[2021-05-08 01:05:43] [INFO ] Deduced a trap composed of 58 places in 158 ms
[2021-05-08 01:05:43] [INFO ] Deduced a trap composed of 60 places in 130 ms
[2021-05-08 01:05:43] [INFO ] Deduced a trap composed of 72 places in 145 ms
[2021-05-08 01:05:43] [INFO ] Deduced a trap composed of 56 places in 133 ms
[2021-05-08 01:05:43] [INFO ] Deduced a trap composed of 57 places in 137 ms
[2021-05-08 01:05:43] [INFO ] Deduced a trap composed of 57 places in 125 ms
[2021-05-08 01:05:43] [INFO ] Deduced a trap composed of 51 places in 124 ms
[2021-05-08 01:05:44] [INFO ] Deduced a trap composed of 57 places in 122 ms
[2021-05-08 01:05:44] [INFO ] Deduced a trap composed of 52 places in 116 ms
[2021-05-08 01:05:44] [INFO ] Deduced a trap composed of 70 places in 139 ms
[2021-05-08 01:05:44] [INFO ] Deduced a trap composed of 84 places in 128 ms
[2021-05-08 01:05:44] [INFO ] Deduced a trap composed of 72 places in 142 ms
[2021-05-08 01:05:44] [INFO ] Deduced a trap composed of 116 places in 140 ms
[2021-05-08 01:05:45] [INFO ] Deduced a trap composed of 65 places in 138 ms
[2021-05-08 01:05:45] [INFO ] Deduced a trap composed of 70 places in 135 ms
[2021-05-08 01:05:45] [INFO ] Deduced a trap composed of 67 places in 152 ms
[2021-05-08 01:05:45] [INFO ] Deduced a trap composed of 67 places in 131 ms
[2021-05-08 01:05:45] [INFO ] Deduced a trap composed of 68 places in 136 ms
[2021-05-08 01:05:45] [INFO ] Deduced a trap composed of 64 places in 131 ms
[2021-05-08 01:05:45] [INFO ] Deduced a trap composed of 89 places in 91 ms
[2021-05-08 01:05:45] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 5602 ms
[2021-05-08 01:05:45] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints in 33 ms.
[2021-05-08 01:05:49] [INFO ] Added : 529 causal constraints over 107 iterations in 3262 ms. Result :sat
[2021-05-08 01:05:49] [INFO ] [Real]Absence check using 39 positive place invariants in 32 ms returned sat
[2021-05-08 01:05:49] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 01:05:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:05:50] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2021-05-08 01:05:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:05:50] [INFO ] [Nat]Absence check using 39 positive place invariants in 22 ms returned unsat
[2021-05-08 01:05:50] [INFO ] [Real]Absence check using 39 positive place invariants in 32 ms returned sat
[2021-05-08 01:05:50] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 01:05:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:05:50] [INFO ] [Real]Absence check using state equation in 664 ms returned sat
[2021-05-08 01:05:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:05:51] [INFO ] [Nat]Absence check using 39 positive place invariants in 31 ms returned unsat
[2021-05-08 01:05:51] [INFO ] [Real]Absence check using 39 positive place invariants in 31 ms returned sat
[2021-05-08 01:05:51] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 01:05:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:05:51] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2021-05-08 01:05:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:05:52] [INFO ] [Nat]Absence check using 39 positive place invariants in 270 ms returned sat
[2021-05-08 01:05:52] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 01:05:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:05:52] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2021-05-08 01:05:52] [INFO ] Deduced a trap composed of 29 places in 150 ms
[2021-05-08 01:05:53] [INFO ] Deduced a trap composed of 25 places in 165 ms
[2021-05-08 01:05:53] [INFO ] Deduced a trap composed of 33 places in 152 ms
[2021-05-08 01:05:53] [INFO ] Deduced a trap composed of 21 places in 162 ms
[2021-05-08 01:05:53] [INFO ] Deduced a trap composed of 45 places in 160 ms
[2021-05-08 01:05:53] [INFO ] Deduced a trap composed of 98 places in 135 ms
[2021-05-08 01:05:54] [INFO ] Deduced a trap composed of 33 places in 135 ms
[2021-05-08 01:05:54] [INFO ] Deduced a trap composed of 39 places in 148 ms
[2021-05-08 01:05:54] [INFO ] Deduced a trap composed of 47 places in 129 ms
[2021-05-08 01:05:54] [INFO ] Deduced a trap composed of 39 places in 129 ms
[2021-05-08 01:05:54] [INFO ] Deduced a trap composed of 28 places in 124 ms
[2021-05-08 01:05:54] [INFO ] Deduced a trap composed of 77 places in 126 ms
[2021-05-08 01:05:54] [INFO ] Deduced a trap composed of 65 places in 124 ms
[2021-05-08 01:05:55] [INFO ] Deduced a trap composed of 95 places in 134 ms
[2021-05-08 01:05:55] [INFO ] Deduced a trap composed of 45 places in 113 ms
[2021-05-08 01:05:55] [INFO ] Deduced a trap composed of 45 places in 114 ms
[2021-05-08 01:05:55] [INFO ] Deduced a trap composed of 81 places in 104 ms
[2021-05-08 01:05:55] [INFO ] Deduced a trap composed of 90 places in 99 ms
[2021-05-08 01:05:55] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2738 ms
[2021-05-08 01:05:55] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints in 35 ms.
[2021-05-08 01:05:59] [INFO ] Added : 571 causal constraints over 115 iterations in 3562 ms. Result :sat
[2021-05-08 01:05:59] [INFO ] Deduced a trap composed of 96 places in 140 ms
[2021-05-08 01:05:59] [INFO ] Deduced a trap composed of 58 places in 134 ms
[2021-05-08 01:05:59] [INFO ] Deduced a trap composed of 84 places in 125 ms
[2021-05-08 01:05:59] [INFO ] Deduced a trap composed of 84 places in 126 ms
[2021-05-08 01:05:59] [INFO ] Deduced a trap composed of 89 places in 117 ms
[2021-05-08 01:06:00] [INFO ] Deduced a trap composed of 79 places in 113 ms
[2021-05-08 01:06:00] [INFO ] Deduced a trap composed of 93 places in 119 ms
[2021-05-08 01:06:00] [INFO ] Deduced a trap composed of 84 places in 116 ms
[2021-05-08 01:06:00] [INFO ] Deduced a trap composed of 57 places in 108 ms
[2021-05-08 01:06:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1479 ms
[2021-05-08 01:06:00] [INFO ] [Real]Absence check using 39 positive place invariants in 32 ms returned sat
[2021-05-08 01:06:00] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 01:06:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:06:01] [INFO ] [Real]Absence check using state equation in 677 ms returned sat
[2021-05-08 01:06:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:06:01] [INFO ] [Nat]Absence check using 39 positive place invariants in 243 ms returned sat
[2021-05-08 01:06:01] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 18 ms returned sat
[2021-05-08 01:06:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:06:02] [INFO ] [Nat]Absence check using state equation in 637 ms returned sat
[2021-05-08 01:06:02] [INFO ] Deduced a trap composed of 25 places in 137 ms
[2021-05-08 01:06:02] [INFO ] Deduced a trap composed of 28 places in 146 ms
[2021-05-08 01:06:02] [INFO ] Deduced a trap composed of 23 places in 148 ms
[2021-05-08 01:06:03] [INFO ] Deduced a trap composed of 43 places in 142 ms
[2021-05-08 01:06:03] [INFO ] Deduced a trap composed of 65 places in 139 ms
[2021-05-08 01:06:03] [INFO ] Deduced a trap composed of 67 places in 138 ms
[2021-05-08 01:06:03] [INFO ] Deduced a trap composed of 65 places in 127 ms
[2021-05-08 01:06:03] [INFO ] Deduced a trap composed of 26 places in 94 ms
[2021-05-08 01:06:03] [INFO ] Deduced a trap composed of 40 places in 95 ms
[2021-05-08 01:06:03] [INFO ] Deduced a trap composed of 59 places in 129 ms
[2021-05-08 01:06:03] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1486 ms
[2021-05-08 01:06:03] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints in 32 ms.
[2021-05-08 01:06:07] [INFO ] Added : 530 causal constraints over 107 iterations in 3179 ms. Result :sat
[2021-05-08 01:06:07] [INFO ] [Real]Absence check using 39 positive place invariants in 32 ms returned sat
[2021-05-08 01:06:07] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 01:06:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:06:07] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2021-05-08 01:06:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:06:08] [INFO ] [Nat]Absence check using 39 positive place invariants in 248 ms returned sat
[2021-05-08 01:06:08] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 01:06:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:06:08] [INFO ] [Nat]Absence check using state equation in 639 ms returned sat
[2021-05-08 01:06:09] [INFO ] Deduced a trap composed of 33 places in 134 ms
[2021-05-08 01:06:09] [INFO ] Deduced a trap composed of 83 places in 139 ms
[2021-05-08 01:06:09] [INFO ] Deduced a trap composed of 39 places in 126 ms
[2021-05-08 01:06:09] [INFO ] Deduced a trap composed of 25 places in 125 ms
[2021-05-08 01:06:09] [INFO ] Deduced a trap composed of 77 places in 121 ms
[2021-05-08 01:06:09] [INFO ] Deduced a trap composed of 28 places in 110 ms
[2021-05-08 01:06:09] [INFO ] Deduced a trap composed of 45 places in 121 ms
[2021-05-08 01:06:10] [INFO ] Deduced a trap composed of 90 places in 130 ms
[2021-05-08 01:06:10] [INFO ] Deduced a trap composed of 83 places in 132 ms
[2021-05-08 01:06:10] [INFO ] Deduced a trap composed of 58 places in 127 ms
[2021-05-08 01:06:10] [INFO ] Deduced a trap composed of 70 places in 135 ms
[2021-05-08 01:06:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1604 ms
[2021-05-08 01:06:10] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints in 29 ms.
[2021-05-08 01:06:13] [INFO ] Added : 551 causal constraints over 111 iterations in 3427 ms. Result :sat
[2021-05-08 01:06:14] [INFO ] [Real]Absence check using 39 positive place invariants in 32 ms returned sat
[2021-05-08 01:06:14] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 01:06:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:06:14] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2021-05-08 01:06:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:06:15] [INFO ] [Nat]Absence check using 39 positive place invariants in 244 ms returned sat
[2021-05-08 01:06:15] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 01:06:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:06:15] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2021-05-08 01:06:15] [INFO ] Deduced a trap composed of 36 places in 154 ms
[2021-05-08 01:06:15] [INFO ] Deduced a trap composed of 29 places in 151 ms
[2021-05-08 01:06:16] [INFO ] Deduced a trap composed of 28 places in 145 ms
[2021-05-08 01:06:16] [INFO ] Deduced a trap composed of 23 places in 151 ms
[2021-05-08 01:06:16] [INFO ] Deduced a trap composed of 45 places in 141 ms
[2021-05-08 01:06:16] [INFO ] Deduced a trap composed of 25 places in 140 ms
[2021-05-08 01:06:16] [INFO ] Deduced a trap composed of 36 places in 145 ms
[2021-05-08 01:06:16] [INFO ] Deduced a trap composed of 48 places in 133 ms
[2021-05-08 01:06:17] [INFO ] Deduced a trap composed of 66 places in 127 ms
[2021-05-08 01:06:17] [INFO ] Deduced a trap composed of 45 places in 133 ms
[2021-05-08 01:06:17] [INFO ] Deduced a trap composed of 39 places in 115 ms
[2021-05-08 01:06:17] [INFO ] Deduced a trap composed of 92 places in 107 ms
[2021-05-08 01:06:17] [INFO ] Deduced a trap composed of 89 places in 103 ms
[2021-05-08 01:06:17] [INFO ] Deduced a trap composed of 70 places in 110 ms
[2021-05-08 01:06:17] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2115 ms
[2021-05-08 01:06:17] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints in 32 ms.
[2021-05-08 01:06:21] [INFO ] Added : 571 causal constraints over 115 iterations in 3556 ms. Result :sat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2021-05-08 01:06:21] [INFO ] Initial state reduction rules for CTL removed 8 formulas.
[2021-05-08 01:06:21] [INFO ] Flatten gal took : 73 ms
FORMULA AutoFlight-PT-06b-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-06b-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 01:06:21] [INFO ] Applying decomposition
[2021-05-08 01:06:21] [INFO ] Flatten gal took : 29 ms
[2021-05-08 01:06:21] [INFO ] Decomposing Gal with order
[2021-05-08 01:06:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 01:06:21] [INFO ] Removed a total of 14 redundant transitions.
[2021-05-08 01:06:21] [INFO ] Flatten gal took : 61 ms
[2021-05-08 01:06:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 68 labels/synchronizations in 33 ms.
[2021-05-08 01:06:21] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-08 01:06:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 6 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ AutoFlight-PT-06b @ 3570 seconds

FORMULA AutoFlight-PT-06b-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-06b-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-06b-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-06b-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427332 kB
MemFree: 10014544 kB
After kill :
MemTotal: 16427332 kB
MemFree: 16138492 kB

--------------------
content from 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="AutoFlight-PT-06b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is AutoFlight-PT-06b, 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 r011-tall-162038006100229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-06b.tgz
mv AutoFlight-PT-06b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;