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-162038006100216.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-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-tall-162038006100216
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 119K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K 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.0K 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 1.9K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 01:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 22 10:15 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 91K 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-04b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-04b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620433838110

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 00:30:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-08 00:30:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 00:30:39] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-08 00:30:39] [INFO ] Transformed 390 places.
[2021-05-08 00:30:39] [INFO ] Transformed 388 transitions.
[2021-05-08 00:30:39] [INFO ] Found NUPN structural information;
[2021-05-08 00:30:39] [INFO ] Parsed PT model containing 390 places and 388 transitions in 109 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 25 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 49 resets, run finished after 64 ms. (steps per millisecond=156 ) properties seen :[0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0]
FORMULA AutoFlight-PT-04b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 388 rows 390 cols
[2021-05-08 00:30:40] [INFO ] Computed 28 place invariants in 12 ms
[2021-05-08 00:30:40] [INFO ] [Real]Absence check using 27 positive place invariants in 30 ms returned sat
[2021-05-08 00:30:40] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 00:30:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:30:40] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2021-05-08 00:30:40] [INFO ] Deduced a trap composed of 49 places in 157 ms
[2021-05-08 00:30:40] [INFO ] Deduced a trap composed of 24 places in 115 ms
[2021-05-08 00:30:41] [INFO ] Deduced a trap composed of 39 places in 145 ms
[2021-05-08 00:30:41] [INFO ] Deduced a trap composed of 46 places in 84 ms
[2021-05-08 00:30:41] [INFO ] Deduced a trap composed of 47 places in 92 ms
[2021-05-08 00:30:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 692 ms
[2021-05-08 00:30:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:30:41] [INFO ] [Nat]Absence check using 27 positive place invariants in 318 ms returned sat
[2021-05-08 00:30:41] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 00:30:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:30:42] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2021-05-08 00:30:42] [INFO ] Deduced a trap composed of 43 places in 110 ms
[2021-05-08 00:30:42] [INFO ] Deduced a trap composed of 24 places in 105 ms
[2021-05-08 00:30:42] [INFO ] Deduced a trap composed of 39 places in 88 ms
[2021-05-08 00:30:42] [INFO ] Deduced a trap composed of 38 places in 141 ms
[2021-05-08 00:30:42] [INFO ] Deduced a trap composed of 38 places in 82 ms
[2021-05-08 00:30:42] [INFO ] Deduced a trap composed of 47 places in 72 ms
[2021-05-08 00:30:42] [INFO ] Deduced a trap composed of 50 places in 54 ms
[2021-05-08 00:30:42] [INFO ] Deduced a trap composed of 40 places in 53 ms
[2021-05-08 00:30:43] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 870 ms
[2021-05-08 00:30:43] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints in 28 ms.
[2021-05-08 00:30:44] [INFO ] Added : 387 causal constraints over 78 iterations in 1695 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2021-05-08 00:30:44] [INFO ] [Real]Absence check using 27 positive place invariants in 22 ms returned sat
[2021-05-08 00:30:44] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 00:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:30:45] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2021-05-08 00:30:45] [INFO ] Deduced a trap composed of 41 places in 100 ms
[2021-05-08 00:30:45] [INFO ] Deduced a trap composed of 64 places in 93 ms
[2021-05-08 00:30:45] [INFO ] Deduced a trap composed of 27 places in 89 ms
[2021-05-08 00:30:45] [INFO ] Deduced a trap composed of 68 places in 72 ms
[2021-05-08 00:30:45] [INFO ] Deduced a trap composed of 56 places in 68 ms
[2021-05-08 00:30:45] [INFO ] Deduced a trap composed of 50 places in 77 ms
[2021-05-08 00:30:45] [INFO ] Deduced a trap composed of 54 places in 84 ms
[2021-05-08 00:30:45] [INFO ] Deduced a trap composed of 57 places in 82 ms
[2021-05-08 00:30:46] [INFO ] Deduced a trap composed of 48 places in 52 ms
[2021-05-08 00:30:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 863 ms
[2021-05-08 00:30:46] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:30:46] [INFO ] [Nat]Absence check using 27 positive place invariants in 302 ms returned sat
[2021-05-08 00:30:46] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 00:30:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:30:46] [INFO ] [Nat]Absence check using state equation in 324 ms returned sat
[2021-05-08 00:30:46] [INFO ] Deduced a trap composed of 17 places in 96 ms
[2021-05-08 00:30:46] [INFO ] Deduced a trap composed of 20 places in 95 ms
[2021-05-08 00:30:47] [INFO ] Deduced a trap composed of 54 places in 92 ms
[2021-05-08 00:30:47] [INFO ] Deduced a trap composed of 22 places in 86 ms
[2021-05-08 00:30:47] [INFO ] Deduced a trap composed of 29 places in 84 ms
[2021-05-08 00:30:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 530 ms
[2021-05-08 00:30:47] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints in 24 ms.
[2021-05-08 00:30:48] [INFO ] Added : 376 causal constraints over 76 iterations in 1522 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-08 00:30:48] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned unsat
[2021-05-08 00:30:48] [INFO ] [Real]Absence check using 27 positive place invariants in 20 ms returned sat
[2021-05-08 00:30:48] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 00:30:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:30:49] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2021-05-08 00:30:49] [INFO ] Deduced a trap composed of 44 places in 111 ms
[2021-05-08 00:30:49] [INFO ] Deduced a trap composed of 35 places in 105 ms
[2021-05-08 00:30:49] [INFO ] Deduced a trap composed of 47 places in 95 ms
[2021-05-08 00:30:49] [INFO ] Deduced a trap composed of 51 places in 67 ms
[2021-05-08 00:30:49] [INFO ] Deduced a trap composed of 52 places in 66 ms
[2021-05-08 00:30:49] [INFO ] Deduced a trap composed of 36 places in 64 ms
[2021-05-08 00:30:49] [INFO ] Deduced a trap composed of 53 places in 72 ms
[2021-05-08 00:30:50] [INFO ] Deduced a trap composed of 37 places in 64 ms
[2021-05-08 00:30:50] [INFO ] Deduced a trap composed of 43 places in 57 ms
[2021-05-08 00:30:50] [INFO ] Deduced a trap composed of 62 places in 74 ms
[2021-05-08 00:30:50] [INFO ] Deduced a trap composed of 52 places in 76 ms
[2021-05-08 00:30:50] [INFO ] Deduced a trap composed of 54 places in 66 ms
[2021-05-08 00:30:50] [INFO ] Deduced a trap composed of 54 places in 62 ms
[2021-05-08 00:30:50] [INFO ] Deduced a trap composed of 63 places in 53 ms
[2021-05-08 00:30:50] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1237 ms
[2021-05-08 00:30:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:30:50] [INFO ] [Nat]Absence check using 27 positive place invariants in 323 ms returned sat
[2021-05-08 00:30:50] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 6 ms returned sat
[2021-05-08 00:30:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:30:51] [INFO ] [Nat]Absence check using state equation in 325 ms returned sat
[2021-05-08 00:30:51] [INFO ] Deduced a trap composed of 44 places in 109 ms
[2021-05-08 00:30:51] [INFO ] Deduced a trap composed of 35 places in 97 ms
[2021-05-08 00:30:51] [INFO ] Deduced a trap composed of 47 places in 104 ms
[2021-05-08 00:30:51] [INFO ] Deduced a trap composed of 51 places in 72 ms
[2021-05-08 00:30:51] [INFO ] Deduced a trap composed of 52 places in 65 ms
[2021-05-08 00:30:51] [INFO ] Deduced a trap composed of 54 places in 60 ms
[2021-05-08 00:30:51] [INFO ] Deduced a trap composed of 54 places in 65 ms
[2021-05-08 00:30:51] [INFO ] Deduced a trap composed of 43 places in 70 ms
[2021-05-08 00:30:52] [INFO ] Deduced a trap composed of 62 places in 84 ms
[2021-05-08 00:30:52] [INFO ] Deduced a trap composed of 37 places in 71 ms
[2021-05-08 00:30:52] [INFO ] Deduced a trap composed of 35 places in 68 ms
[2021-05-08 00:30:52] [INFO ] Deduced a trap composed of 53 places in 73 ms
[2021-05-08 00:30:52] [INFO ] Deduced a trap composed of 48 places in 84 ms
[2021-05-08 00:30:52] [INFO ] Deduced a trap composed of 52 places in 71 ms
[2021-05-08 00:30:52] [INFO ] Deduced a trap composed of 54 places in 68 ms
[2021-05-08 00:30:52] [INFO ] Deduced a trap composed of 36 places in 67 ms
[2021-05-08 00:30:52] [INFO ] Deduced a trap composed of 29 places in 71 ms
[2021-05-08 00:30:52] [INFO ] Deduced a trap composed of 74 places in 71 ms
[2021-05-08 00:30:52] [INFO ] Deduced a trap composed of 54 places in 68 ms
[2021-05-08 00:30:52] [INFO ] Deduced a trap composed of 54 places in 66 ms
[2021-05-08 00:30:53] [INFO ] Deduced a trap composed of 40 places in 68 ms
[2021-05-08 00:30:53] [INFO ] Deduced a trap composed of 56 places in 72 ms
[2021-05-08 00:30:53] [INFO ] Deduced a trap composed of 55 places in 69 ms
[2021-05-08 00:30:53] [INFO ] Deduced a trap composed of 63 places in 64 ms
[2021-05-08 00:30:53] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2075 ms
[2021-05-08 00:30:53] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints in 24 ms.
[2021-05-08 00:30:54] [INFO ] Added : 387 causal constraints over 78 iterations in 1537 ms. Result :sat
[2021-05-08 00:30:54] [INFO ] Deduced a trap composed of 50 places in 52 ms
[2021-05-08 00:30:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
Attempting to minimize the solution found.
Minimization took 9 ms.
[2021-05-08 00:30:55] [INFO ] [Real]Absence check using 27 positive place invariants in 21 ms returned sat
[2021-05-08 00:30:55] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 00:30:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:30:55] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2021-05-08 00:30:55] [INFO ] Deduced a trap composed of 49 places in 86 ms
[2021-05-08 00:30:55] [INFO ] Deduced a trap composed of 55 places in 87 ms
[2021-05-08 00:30:55] [INFO ] Deduced a trap composed of 32 places in 90 ms
[2021-05-08 00:30:55] [INFO ] Deduced a trap composed of 42 places in 81 ms
[2021-05-08 00:30:55] [INFO ] Deduced a trap composed of 60 places in 83 ms
[2021-05-08 00:30:55] [INFO ] Deduced a trap composed of 41 places in 79 ms
[2021-05-08 00:30:56] [INFO ] Deduced a trap composed of 36 places in 86 ms
[2021-05-08 00:30:56] [INFO ] Deduced a trap composed of 52 places in 77 ms
[2021-05-08 00:30:56] [INFO ] Deduced a trap composed of 37 places in 77 ms
[2021-05-08 00:30:56] [INFO ] Deduced a trap composed of 62 places in 78 ms
[2021-05-08 00:30:56] [INFO ] Deduced a trap composed of 59 places in 89 ms
[2021-05-08 00:30:56] [INFO ] Deduced a trap composed of 65 places in 79 ms
[2021-05-08 00:30:56] [INFO ] Deduced a trap composed of 46 places in 68 ms
[2021-05-08 00:30:56] [INFO ] Deduced a trap composed of 40 places in 55 ms
[2021-05-08 00:30:56] [INFO ] Deduced a trap composed of 39 places in 52 ms
[2021-05-08 00:30:56] [INFO ] Deduced a trap composed of 50 places in 47 ms
[2021-05-08 00:30:56] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1433 ms
[2021-05-08 00:30:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:30:57] [INFO ] [Nat]Absence check using 27 positive place invariants in 289 ms returned sat
[2021-05-08 00:30:57] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 00:30:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:30:57] [INFO ] [Nat]Absence check using state equation in 329 ms returned sat
[2021-05-08 00:30:57] [INFO ] Deduced a trap composed of 41 places in 103 ms
[2021-05-08 00:30:57] [INFO ] Deduced a trap composed of 60 places in 96 ms
[2021-05-08 00:30:57] [INFO ] Deduced a trap composed of 53 places in 96 ms
[2021-05-08 00:30:57] [INFO ] Deduced a trap composed of 66 places in 103 ms
[2021-05-08 00:30:58] [INFO ] Deduced a trap composed of 41 places in 88 ms
[2021-05-08 00:30:58] [INFO ] Deduced a trap composed of 73 places in 88 ms
[2021-05-08 00:30:58] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 661 ms
[2021-05-08 00:30:58] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints in 20 ms.
[2021-05-08 00:30:59] [INFO ] Added : 374 causal constraints over 76 iterations in 1591 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 00:30:59] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned unsat
[2021-05-08 00:30:59] [INFO ] [Real]Absence check using 27 positive place invariants in 20 ms returned sat
[2021-05-08 00:30:59] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 00:30:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:31:00] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2021-05-08 00:31:00] [INFO ] Deduced a trap composed of 24 places in 93 ms
[2021-05-08 00:31:00] [INFO ] Deduced a trap composed of 30 places in 96 ms
[2021-05-08 00:31:00] [INFO ] Deduced a trap composed of 29 places in 97 ms
[2021-05-08 00:31:00] [INFO ] Deduced a trap composed of 52 places in 93 ms
[2021-05-08 00:31:00] [INFO ] Deduced a trap composed of 58 places in 93 ms
[2021-05-08 00:31:00] [INFO ] Deduced a trap composed of 74 places in 95 ms
[2021-05-08 00:31:00] [INFO ] Deduced a trap composed of 69 places in 84 ms
[2021-05-08 00:31:01] [INFO ] Deduced a trap composed of 54 places in 91 ms
[2021-05-08 00:31:01] [INFO ] Deduced a trap composed of 77 places in 86 ms
[2021-05-08 00:31:01] [INFO ] Deduced a trap composed of 76 places in 84 ms
[2021-05-08 00:31:01] [INFO ] Deduced a trap composed of 82 places in 81 ms
[2021-05-08 00:31:01] [INFO ] Deduced a trap composed of 93 places in 82 ms
[2021-05-08 00:31:01] [INFO ] Deduced a trap composed of 82 places in 85 ms
[2021-05-08 00:31:01] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1339 ms
[2021-05-08 00:31:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:31:01] [INFO ] [Nat]Absence check using 27 positive place invariants in 286 ms returned sat
[2021-05-08 00:31:01] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 00:31:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:31:02] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2021-05-08 00:31:02] [INFO ] Deduced a trap composed of 24 places in 107 ms
[2021-05-08 00:31:02] [INFO ] Deduced a trap composed of 30 places in 101 ms
[2021-05-08 00:31:02] [INFO ] Deduced a trap composed of 57 places in 97 ms
[2021-05-08 00:31:02] [INFO ] Deduced a trap composed of 77 places in 95 ms
[2021-05-08 00:31:02] [INFO ] Deduced a trap composed of 75 places in 88 ms
[2021-05-08 00:31:02] [INFO ] Deduced a trap composed of 29 places in 87 ms
[2021-05-08 00:31:03] [INFO ] Deduced a trap composed of 30 places in 87 ms
[2021-05-08 00:31:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 752 ms
[2021-05-08 00:31:03] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints in 22 ms.
[2021-05-08 00:31:04] [INFO ] Added : 386 causal constraints over 78 iterations in 1530 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 00:31:04] [INFO ] [Real]Absence check using 27 positive place invariants in 22 ms returned sat
[2021-05-08 00:31:04] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 00:31:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:31:05] [INFO ] [Real]Absence check using state equation in 331 ms returned sat
[2021-05-08 00:31:05] [INFO ] Deduced a trap composed of 34 places in 87 ms
[2021-05-08 00:31:05] [INFO ] Deduced a trap composed of 17 places in 82 ms
[2021-05-08 00:31:05] [INFO ] Deduced a trap composed of 33 places in 83 ms
[2021-05-08 00:31:05] [INFO ] Deduced a trap composed of 30 places in 72 ms
[2021-05-08 00:31:05] [INFO ] Deduced a trap composed of 31 places in 70 ms
[2021-05-08 00:31:05] [INFO ] Deduced a trap composed of 27 places in 56 ms
[2021-05-08 00:31:05] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 532 ms
[2021-05-08 00:31:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:31:05] [INFO ] [Nat]Absence check using 27 positive place invariants in 110 ms returned sat
[2021-05-08 00:31:05] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 00:31:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:31:06] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2021-05-08 00:31:06] [INFO ] Deduced a trap composed of 46 places in 92 ms
[2021-05-08 00:31:06] [INFO ] Deduced a trap composed of 34 places in 82 ms
[2021-05-08 00:31:06] [INFO ] Deduced a trap composed of 24 places in 80 ms
[2021-05-08 00:31:06] [INFO ] Deduced a trap composed of 27 places in 68 ms
[2021-05-08 00:31:06] [INFO ] Deduced a trap composed of 31 places in 60 ms
[2021-05-08 00:31:06] [INFO ] Deduced a trap composed of 32 places in 57 ms
[2021-05-08 00:31:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 515 ms
[2021-05-08 00:31:06] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints in 21 ms.
[2021-05-08 00:31:07] [INFO ] Added : 332 causal constraints over 67 iterations in 1312 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-04b-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 37300 steps, including 196 resets, run finished after 138 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 47400 steps, including 203 resets, run finished after 139 ms. (steps per millisecond=341 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 45600 steps, including 236 resets, run finished after 123 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 55000 steps, including 242 resets, run finished after 140 ms. (steps per millisecond=392 ) properties seen :[0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 41500 steps, including 206 resets, run finished after 102 ms. (steps per millisecond=406 ) properties seen :[0, 1, 0, 0, 1, 0] could not realise parikh vector
FORMULA AutoFlight-PT-04b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 54500 steps, including 246 resets, run finished after 131 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 19 out of 390 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 390/390 places, 388/388 transitions.
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 390 transition count 246
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 163 rules applied. Total rules applied 305 place count 248 transition count 225
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 310 place count 243 transition count 225
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 310 place count 243 transition count 177
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 406 place count 195 transition count 177
Symmetric choice reduction at 3 with 36 rule applications. Total rules 442 place count 195 transition count 177
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 36 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 514 place count 159 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 515 place count 159 transition count 140
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 515 place count 159 transition count 129
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 537 place count 148 transition count 129
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 609 place count 112 transition count 93
Free-agglomeration rule applied 13 times.
Iterating global reduction 4 with 13 rules applied. Total rules applied 622 place count 112 transition count 80
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 635 place count 99 transition count 80
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 638 place count 99 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 639 place count 98 transition count 79
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 11 rules applied. Total rules applied 650 place count 90 transition count 76
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 653 place count 87 transition count 76
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 10 Pre rules applied. Total rules applied 653 place count 87 transition count 66
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 673 place count 77 transition count 66
Applied a total of 673 rules in 78 ms. Remains 77 /390 variables (removed 313) and now considering 66/388 (removed 322) transitions.
Finished structural reductions, in 1 iterations. Remains : 77/390 places, 66/388 transitions.
Incomplete random walk after 1000000 steps, including 36459 resets, run finished after 2048 ms. (steps per millisecond=488 ) properties seen :[1, 1, 1, 0]
FORMULA AutoFlight-PT-04b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4639 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties seen :[0]
// Phase 1: matrix 66 rows 77 cols
[2021-05-08 00:31:11] [INFO ] Computed 20 place invariants in 2 ms
[2021-05-08 00:31:11] [INFO ] [Real]Absence check using 18 positive place invariants in 31 ms returned sat
[2021-05-08 00:31:11] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-08 00:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:31:11] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-08 00:31:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2021-05-08 00:31:11] [INFO ] [Real]Added 7 Read/Feed constraints in 2 ms returned sat
[2021-05-08 00:31:11] [INFO ] Computed and/alt/rep : 52/88/52 causal constraints in 3 ms.
[2021-05-08 00:31:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:31:11] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2021-05-08 00:31:11] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 1 ms returned sat
[2021-05-08 00:31:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:31:11] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-08 00:31:11] [INFO ] [Nat]Added 7 Read/Feed constraints in 10 ms returned sat
[2021-05-08 00:31:11] [INFO ] Computed and/alt/rep : 52/88/52 causal constraints in 3 ms.
[2021-05-08 00:31:11] [INFO ] Added : 30 causal constraints over 6 iterations in 33 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
Incomplete Parikh walk after 4900 steps, including 278 resets, run finished after 11 ms. (steps per millisecond=445 ) properties seen :[0] could not realise parikh vector
Support contains 11 out of 77 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 77/77 places, 66/66 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 77 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 76 transition count 65
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 76 transition count 62
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 9 place count 72 transition count 62
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 72 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 71 transition count 61
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 16 place count 68 transition count 59
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 16 place count 68 transition count 55
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 64 transition count 55
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 64 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 62 transition count 54
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 27 place count 62 transition count 50
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 35 place count 58 transition count 50
Applied a total of 35 rules in 10 ms. Remains 58 /77 variables (removed 19) and now considering 50/66 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 58/77 places, 50/66 transitions.
Incomplete random walk after 1000000 steps, including 32731 resets, run finished after 1804 ms. (steps per millisecond=554 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 5437 resets, run finished after 808 ms. (steps per millisecond=1237 ) properties seen :[0]
Finished probabilistic random walk after 640125 steps, run visited all 1 properties in 591 ms. (steps per millisecond=1083 )
Probabilistic random walk after 640125 steps, saw 92600 distinct states, run finished after 591 ms. (steps per millisecond=1083 ) properties seen :[1]
FORMULA AutoFlight-PT-04b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.

--------------------
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-04b"
export BK_EXAMINATION="ReachabilityFireability"
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-04b, examination is ReachabilityFireability"
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-162038006100216"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-04b.tgz
mv AutoFlight-PT-04b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;