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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8693.968 3600000.00 3621170.00 11092.50 F?F?FFFTTFFTTFTF 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-162038006100221.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-05b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038006100221
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 165K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K 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.6K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 01:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 01:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 10:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 10:16 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 113K 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-05b-00
FORMULA_NAME AutoFlight-PT-05b-01
FORMULA_NAME AutoFlight-PT-05b-02
FORMULA_NAME AutoFlight-PT-05b-03
FORMULA_NAME AutoFlight-PT-05b-04
FORMULA_NAME AutoFlight-PT-05b-05
FORMULA_NAME AutoFlight-PT-05b-06
FORMULA_NAME AutoFlight-PT-05b-07
FORMULA_NAME AutoFlight-PT-05b-08
FORMULA_NAME AutoFlight-PT-05b-09
FORMULA_NAME AutoFlight-PT-05b-10
FORMULA_NAME AutoFlight-PT-05b-11
FORMULA_NAME AutoFlight-PT-05b-12
FORMULA_NAME AutoFlight-PT-05b-13
FORMULA_NAME AutoFlight-PT-05b-14
FORMULA_NAME AutoFlight-PT-05b-15

=== Now, execution of the tool begins

BK_START 1620435278082

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 00:54:39] [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 00:54:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 00:54:39] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2021-05-08 00:54:39] [INFO ] Transformed 482 places.
[2021-05-08 00:54:39] [INFO ] Transformed 480 transitions.
[2021-05-08 00:54:39] [INFO ] Found NUPN structural information;
[2021-05-08 00:54:39] [INFO ] Parsed PT model containing 482 places and 480 transitions in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 38 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 410 resets, run finished after 393 ms. (steps per millisecond=254 ) properties seen :[0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 480 rows 482 cols
[2021-05-08 00:54:40] [INFO ] Computed 34 place invariants in 15 ms
[2021-05-08 00:54:40] [INFO ] [Real]Absence check using 33 positive place invariants in 38 ms returned sat
[2021-05-08 00:54:40] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 5 ms returned sat
[2021-05-08 00:54:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:54:40] [INFO ] [Real]Absence check using state equation in 468 ms returned sat
[2021-05-08 00:54:41] [INFO ] Deduced a trap composed of 23 places in 159 ms
[2021-05-08 00:54:41] [INFO ] Deduced a trap composed of 30 places in 118 ms
[2021-05-08 00:54:41] [INFO ] Deduced a trap composed of 70 places in 105 ms
[2021-05-08 00:54:41] [INFO ] Deduced a trap composed of 64 places in 102 ms
[2021-05-08 00:54:41] [INFO ] Deduced a trap composed of 49 places in 95 ms
[2021-05-08 00:54:41] [INFO ] Deduced a trap composed of 26 places in 94 ms
[2021-05-08 00:54:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 812 ms
[2021-05-08 00:54:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:54:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 145 ms returned sat
[2021-05-08 00:54:41] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 00:54:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:54:42] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2021-05-08 00:54:42] [INFO ] Deduced a trap composed of 62 places in 117 ms
[2021-05-08 00:54:42] [INFO ] Deduced a trap composed of 29 places in 115 ms
[2021-05-08 00:54:42] [INFO ] Deduced a trap composed of 31 places in 115 ms
[2021-05-08 00:54:42] [INFO ] Deduced a trap composed of 32 places in 120 ms
[2021-05-08 00:54:42] [INFO ] Deduced a trap composed of 41 places in 106 ms
[2021-05-08 00:54:43] [INFO ] Deduced a trap composed of 37 places in 108 ms
[2021-05-08 00:54:43] [INFO ] Deduced a trap composed of 36 places in 115 ms
[2021-05-08 00:54:43] [INFO ] Deduced a trap composed of 21 places in 85 ms
[2021-05-08 00:54:43] [INFO ] Deduced a trap composed of 37 places in 93 ms
[2021-05-08 00:54:43] [INFO ] Deduced a trap composed of 66 places in 85 ms
[2021-05-08 00:54:43] [INFO ] Deduced a trap composed of 68 places in 91 ms
[2021-05-08 00:54:43] [INFO ] Deduced a trap composed of 60 places in 79 ms
[2021-05-08 00:54:43] [INFO ] Deduced a trap composed of 67 places in 84 ms
[2021-05-08 00:54:43] [INFO ] Deduced a trap composed of 92 places in 83 ms
[2021-05-08 00:54:44] [INFO ] Deduced a trap composed of 86 places in 79 ms
[2021-05-08 00:54:44] [INFO ] Deduced a trap composed of 61 places in 79 ms
[2021-05-08 00:54:44] [INFO ] Deduced a trap composed of 86 places in 76 ms
[2021-05-08 00:54:44] [INFO ] Deduced a trap composed of 80 places in 73 ms
[2021-05-08 00:54:44] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2004 ms
[2021-05-08 00:54:44] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints in 23 ms.
[2021-05-08 00:54:46] [INFO ] Added : 432 causal constraints over 87 iterations in 2185 ms. Result :sat
[2021-05-08 00:54:46] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2021-05-08 00:54:46] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 00:54:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:54:47] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2021-05-08 00:54:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:54:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 21 ms returned unsat
[2021-05-08 00:54:47] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2021-05-08 00:54:47] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 00:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:54:47] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2021-05-08 00:54:47] [INFO ] Deduced a trap composed of 21 places in 104 ms
[2021-05-08 00:54:47] [INFO ] Deduced a trap composed of 40 places in 101 ms
[2021-05-08 00:54:48] [INFO ] Deduced a trap composed of 37 places in 88 ms
[2021-05-08 00:54:48] [INFO ] Deduced a trap composed of 71 places in 69 ms
[2021-05-08 00:54:48] [INFO ] Deduced a trap composed of 43 places in 52 ms
[2021-05-08 00:54:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 508 ms
[2021-05-08 00:54:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:54:48] [INFO ] [Nat]Absence check using 33 positive place invariants in 138 ms returned sat
[2021-05-08 00:54:48] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 00:54:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:54:48] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2021-05-08 00:54:49] [INFO ] Deduced a trap composed of 22 places in 116 ms
[2021-05-08 00:54:49] [INFO ] Deduced a trap composed of 31 places in 114 ms
[2021-05-08 00:54:49] [INFO ] Deduced a trap composed of 21 places in 114 ms
[2021-05-08 00:54:49] [INFO ] Deduced a trap composed of 19 places in 115 ms
[2021-05-08 00:54:49] [INFO ] Deduced a trap composed of 43 places in 124 ms
[2021-05-08 00:54:49] [INFO ] Deduced a trap composed of 29 places in 128 ms
[2021-05-08 00:54:49] [INFO ] Deduced a trap composed of 37 places in 110 ms
[2021-05-08 00:54:50] [INFO ] Deduced a trap composed of 56 places in 133 ms
[2021-05-08 00:54:50] [INFO ] Deduced a trap composed of 41 places in 101 ms
[2021-05-08 00:54:50] [INFO ] Deduced a trap composed of 60 places in 104 ms
[2021-05-08 00:54:50] [INFO ] Deduced a trap composed of 43 places in 108 ms
[2021-05-08 00:54:50] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1446 ms
[2021-05-08 00:54:50] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints in 24 ms.
[2021-05-08 00:54:52] [INFO ] Added : 466 causal constraints over 94 iterations in 2323 ms. Result :sat
[2021-05-08 00:54:52] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2021-05-08 00:54:52] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 00:54:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:54:53] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2021-05-08 00:54:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:54:53] [INFO ] [Nat]Absence check using 33 positive place invariants in 20 ms returned unsat
[2021-05-08 00:54:53] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2021-05-08 00:54:53] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 5 ms returned sat
[2021-05-08 00:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:54:53] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2021-05-08 00:54:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:54:54] [INFO ] [Nat]Absence check using 33 positive place invariants in 142 ms returned sat
[2021-05-08 00:54:54] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 00:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:54:54] [INFO ] [Nat]Absence check using state equation in 457 ms returned sat
[2021-05-08 00:54:54] [INFO ] Deduced a trap composed of 19 places in 106 ms
[2021-05-08 00:54:54] [INFO ] Deduced a trap composed of 24 places in 106 ms
[2021-05-08 00:54:55] [INFO ] Deduced a trap composed of 74 places in 107 ms
[2021-05-08 00:54:55] [INFO ] Deduced a trap composed of 21 places in 104 ms
[2021-05-08 00:54:55] [INFO ] Deduced a trap composed of 29 places in 89 ms
[2021-05-08 00:54:55] [INFO ] Deduced a trap composed of 55 places in 91 ms
[2021-05-08 00:54:55] [INFO ] Deduced a trap composed of 54 places in 78 ms
[2021-05-08 00:54:55] [INFO ] Deduced a trap composed of 56 places in 78 ms
[2021-05-08 00:54:55] [INFO ] Deduced a trap composed of 65 places in 80 ms
[2021-05-08 00:54:55] [INFO ] Deduced a trap composed of 63 places in 72 ms
[2021-05-08 00:54:55] [INFO ] Deduced a trap composed of 54 places in 70 ms
[2021-05-08 00:54:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1152 ms
[2021-05-08 00:54:55] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints in 23 ms.
[2021-05-08 00:54:57] [INFO ] Added : 456 causal constraints over 92 iterations in 2196 ms. Result :sat
[2021-05-08 00:54:58] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2021-05-08 00:54:58] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 00:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:54:58] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2021-05-08 00:54:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:54:58] [INFO ] [Nat]Absence check using 33 positive place invariants in 143 ms returned sat
[2021-05-08 00:54:58] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 00:54:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:54:59] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2021-05-08 00:54:59] [INFO ] Deduced a trap composed of 29 places in 114 ms
[2021-05-08 00:54:59] [INFO ] Deduced a trap composed of 48 places in 109 ms
[2021-05-08 00:54:59] [INFO ] Deduced a trap composed of 21 places in 104 ms
[2021-05-08 00:54:59] [INFO ] Deduced a trap composed of 58 places in 101 ms
[2021-05-08 00:54:59] [INFO ] Deduced a trap composed of 47 places in 99 ms
[2021-05-08 00:54:59] [INFO ] Deduced a trap composed of 39 places in 93 ms
[2021-05-08 00:55:00] [INFO ] Deduced a trap composed of 41 places in 94 ms
[2021-05-08 00:55:00] [INFO ] Deduced a trap composed of 64 places in 98 ms
[2021-05-08 00:55:00] [INFO ] Deduced a trap composed of 42 places in 96 ms
[2021-05-08 00:55:00] [INFO ] Deduced a trap composed of 31 places in 95 ms
[2021-05-08 00:55:00] [INFO ] Deduced a trap composed of 52 places in 91 ms
[2021-05-08 00:55:00] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1269 ms
[2021-05-08 00:55:00] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints in 23 ms.
[2021-05-08 00:55:02] [INFO ] Added : 465 causal constraints over 93 iterations in 2237 ms. Result :sat
[2021-05-08 00:55:02] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2021-05-08 00:55:02] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 00:55:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:55:03] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2021-05-08 00:55:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:55:03] [INFO ] [Nat]Absence check using 33 positive place invariants in 20 ms returned unsat
[2021-05-08 00:55:03] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2021-05-08 00:55:03] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 00:55:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:55:03] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2021-05-08 00:55:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:55:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 141 ms returned sat
[2021-05-08 00:55:04] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 00:55:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:55:04] [INFO ] [Nat]Absence check using state equation in 449 ms returned sat
[2021-05-08 00:55:04] [INFO ] Deduced a trap composed of 21 places in 109 ms
[2021-05-08 00:55:04] [INFO ] Deduced a trap composed of 26 places in 105 ms
[2021-05-08 00:55:04] [INFO ] Deduced a trap composed of 21 places in 104 ms
[2021-05-08 00:55:05] [INFO ] Deduced a trap composed of 35 places in 103 ms
[2021-05-08 00:55:05] [INFO ] Deduced a trap composed of 30 places in 103 ms
[2021-05-08 00:55:05] [INFO ] Deduced a trap composed of 46 places in 102 ms
[2021-05-08 00:55:05] [INFO ] Deduced a trap composed of 68 places in 102 ms
[2021-05-08 00:55:05] [INFO ] Deduced a trap composed of 28 places in 84 ms
[2021-05-08 00:55:05] [INFO ] Deduced a trap composed of 46 places in 83 ms
[2021-05-08 00:55:05] [INFO ] Deduced a trap composed of 39 places in 78 ms
[2021-05-08 00:55:05] [INFO ] Deduced a trap composed of 33 places in 86 ms
[2021-05-08 00:55:05] [INFO ] Deduced a trap composed of 80 places in 88 ms
[2021-05-08 00:55:06] [INFO ] Deduced a trap composed of 23 places in 83 ms
[2021-05-08 00:55:06] [INFO ] Deduced a trap composed of 57 places in 82 ms
[2021-05-08 00:55:06] [INFO ] Deduced a trap composed of 49 places in 80 ms
[2021-05-08 00:55:06] [INFO ] Deduced a trap composed of 80 places in 96 ms
[2021-05-08 00:55:06] [INFO ] Deduced a trap composed of 72 places in 97 ms
[2021-05-08 00:55:06] [INFO ] Deduced a trap composed of 75 places in 79 ms
[2021-05-08 00:55:06] [INFO ] Deduced a trap composed of 72 places in 71 ms
[2021-05-08 00:55:06] [INFO ] Deduced a trap composed of 74 places in 97 ms
[2021-05-08 00:55:06] [INFO ] Deduced a trap composed of 48 places in 94 ms
[2021-05-08 00:55:06] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2248 ms
[2021-05-08 00:55:06] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints in 22 ms.
[2021-05-08 00:55:09] [INFO ] Added : 443 causal constraints over 89 iterations in 2194 ms. Result :sat
[2021-05-08 00:55:09] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2021-05-08 00:55:09] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 00:55:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:55:09] [INFO ] [Real]Absence check using state equation in 455 ms returned sat
[2021-05-08 00:55:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:55:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 21 ms returned unsat
[2021-05-08 00:55:09] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2021-05-08 00:55:09] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 00:55:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:55:10] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2021-05-08 00:55:10] [INFO ] Deduced a trap composed of 30 places in 95 ms
[2021-05-08 00:55:10] [INFO ] Deduced a trap composed of 61 places in 81 ms
[2021-05-08 00:55:10] [INFO ] Deduced a trap composed of 46 places in 75 ms
[2021-05-08 00:55:10] [INFO ] Deduced a trap composed of 39 places in 72 ms
[2021-05-08 00:55:10] [INFO ] Deduced a trap composed of 42 places in 66 ms
[2021-05-08 00:55:10] [INFO ] Deduced a trap composed of 49 places in 66 ms
[2021-05-08 00:55:10] [INFO ] Deduced a trap composed of 41 places in 66 ms
[2021-05-08 00:55:10] [INFO ] Deduced a trap composed of 46 places in 65 ms
[2021-05-08 00:55:11] [INFO ] Deduced a trap composed of 63 places in 60 ms
[2021-05-08 00:55:11] [INFO ] Deduced a trap composed of 64 places in 57 ms
[2021-05-08 00:55:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 864 ms
[2021-05-08 00:55:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:55:11] [INFO ] [Nat]Absence check using 33 positive place invariants in 138 ms returned sat
[2021-05-08 00:55:11] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 00:55:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:55:11] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2021-05-08 00:55:11] [INFO ] Deduced a trap composed of 20 places in 127 ms
[2021-05-08 00:55:12] [INFO ] Deduced a trap composed of 56 places in 125 ms
[2021-05-08 00:55:12] [INFO ] Deduced a trap composed of 39 places in 120 ms
[2021-05-08 00:55:12] [INFO ] Deduced a trap composed of 35 places in 117 ms
[2021-05-08 00:55:12] [INFO ] Deduced a trap composed of 41 places in 90 ms
[2021-05-08 00:55:12] [INFO ] Deduced a trap composed of 21 places in 86 ms
[2021-05-08 00:55:12] [INFO ] Deduced a trap composed of 29 places in 76 ms
[2021-05-08 00:55:12] [INFO ] Deduced a trap composed of 42 places in 65 ms
[2021-05-08 00:55:12] [INFO ] Deduced a trap composed of 58 places in 71 ms
[2021-05-08 00:55:12] [INFO ] Deduced a trap composed of 59 places in 59 ms
[2021-05-08 00:55:12] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1087 ms
[2021-05-08 00:55:12] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints in 22 ms.
[2021-05-08 00:55:15] [INFO ] Added : 477 causal constraints over 96 iterations in 2355 ms. Result :sat
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2021-05-08 00:55:15] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2021-05-08 00:55:15] [INFO ] Flatten gal took : 62 ms
FORMULA AutoFlight-PT-05b-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutoFlight-PT-05b-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-08 00:55:15] [INFO ] Applying decomposition
[2021-05-08 00:55:15] [INFO ] Flatten gal took : 27 ms
[2021-05-08 00:55:15] [INFO ] Decomposing Gal with order
[2021-05-08 00:55:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 00:55:15] [INFO ] Removed a total of 12 redundant transitions.
[2021-05-08 00:55:15] [INFO ] Flatten gal took : 54 ms
[2021-05-08 00:55:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 54 labels/synchronizations in 23 ms.
[2021-05-08 00:55:15] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2021-05-08 00:55:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 4 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ AutoFlight-PT-05b @ 3570 seconds

FORMULA AutoFlight-PT-05b-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

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

FORMULA AutoFlight-PT-05b-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA AutoFlight-PT-05b-00 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: 7520404 kB
After kill :
MemTotal: 16427332 kB
MemFree: 7522828 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-05b"
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-05b, 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-162038006100221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-05b.tgz
mv AutoFlight-PT-05b 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 ;