fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r010-tajo-165245701700168
Last Updated
Jun 22, 2022

About the Execution of 2021-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
280.380 45749.00 61444.00 131.60 FTFTTTTTFFFFTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r010-tajo-165245701700168.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 gold2021
Input is AutoFlight-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-tajo-165245701700168
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.6K Apr 30 01:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 30 01:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 01:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 30 01:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 30 01:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 30 01:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 30 01:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 30 01:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 113K May 10 09:33 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-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655069614452

Running Version 0
[2022-06-12 21:33:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:33:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:33:36] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2022-06-12 21:33:36] [INFO ] Transformed 482 places.
[2022-06-12 21:33:36] [INFO ] Transformed 480 transitions.
[2022-06-12 21:33:36] [INFO ] Found NUPN structural information;
[2022-06-12 21:33:36] [INFO ] Parsed PT model containing 482 places and 480 transitions in 140 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 41 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 16) seen :9
FORMULA AutoFlight-PT-05b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 7) seen :1
FORMULA AutoFlight-PT-05b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 480 rows 482 cols
[2022-06-12 21:33:37] [INFO ] Computed 34 place invariants in 27 ms
[2022-06-12 21:33:37] [INFO ] [Real]Absence check using 33 positive place invariants in 28 ms returned sat
[2022-06-12 21:33:37] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-12 21:33:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:37] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2022-06-12 21:33:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 16 ms returned sat
[2022-06-12 21:33:38] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:38] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2022-06-12 21:33:38] [INFO ] Deduced a trap composed of 26 places in 233 ms of which 7 ms to minimize.
[2022-06-12 21:33:38] [INFO ] Deduced a trap composed of 23 places in 199 ms of which 1 ms to minimize.
[2022-06-12 21:33:39] [INFO ] Deduced a trap composed of 35 places in 157 ms of which 1 ms to minimize.
[2022-06-12 21:33:39] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 1 ms to minimize.
[2022-06-12 21:33:39] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 0 ms to minimize.
[2022-06-12 21:33:39] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 1 ms to minimize.
[2022-06-12 21:33:39] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2022-06-12 21:33:39] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 0 ms to minimize.
[2022-06-12 21:33:39] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 0 ms to minimize.
[2022-06-12 21:33:40] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 0 ms to minimize.
[2022-06-12 21:33:40] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 1 ms to minimize.
[2022-06-12 21:33:40] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 2 ms to minimize.
[2022-06-12 21:33:40] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2022-06-12 21:33:40] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:33:40] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 4 ms to minimize.
[2022-06-12 21:33:40] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 1 ms to minimize.
[2022-06-12 21:33:41] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:33:41] [INFO ] Deduced a trap composed of 71 places in 107 ms of which 0 ms to minimize.
[2022-06-12 21:33:41] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 0 ms to minimize.
[2022-06-12 21:33:41] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2022-06-12 21:33:41] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 2981 ms
[2022-06-12 21:33:41] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 52 ms.
[2022-06-12 21:33:43] [INFO ] Deduced a trap composed of 8 places in 195 ms of which 0 ms to minimize.
[2022-06-12 21:33:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-12 21:33:43] [INFO ] [Real]Absence check using 33 positive place invariants in 25 ms returned sat
[2022-06-12 21:33:43] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-12 21:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:43] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2022-06-12 21:33:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 19 ms returned sat
[2022-06-12 21:33:43] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-12 21:33:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:44] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2022-06-12 21:33:44] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 1 ms to minimize.
[2022-06-12 21:33:44] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 1 ms to minimize.
[2022-06-12 21:33:44] [INFO ] Deduced a trap composed of 39 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:33:44] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 1 ms to minimize.
[2022-06-12 21:33:44] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:33:44] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:33:44] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:33:44] [INFO ] Deduced a trap composed of 49 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:33:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 838 ms
[2022-06-12 21:33:44] [INFO ] [Real]Absence check using 33 positive place invariants in 16 ms returned sat
[2022-06-12 21:33:44] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:33:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:45] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2022-06-12 21:33:45] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 1 ms to minimize.
[2022-06-12 21:33:45] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:33:45] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2022-06-12 21:33:45] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:33:45] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:33:45] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 5 ms to minimize.
[2022-06-12 21:33:45] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:33:45] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:33:45] [INFO ] Deduced a trap composed of 90 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:33:46] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:33:46] [INFO ] Deduced a trap composed of 76 places in 75 ms of which 1 ms to minimize.
[2022-06-12 21:33:46] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:33:46] [INFO ] Deduced a trap composed of 81 places in 63 ms of which 0 ms to minimize.
[2022-06-12 21:33:46] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1220 ms
[2022-06-12 21:33:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:46] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2022-06-12 21:33:46] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-12 21:33:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:46] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2022-06-12 21:33:46] [INFO ] Deduced a trap composed of 36 places in 117 ms of which 0 ms to minimize.
[2022-06-12 21:33:46] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:33:46] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 0 ms to minimize.
[2022-06-12 21:33:47] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:33:47] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 1 ms to minimize.
[2022-06-12 21:33:47] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 0 ms to minimize.
[2022-06-12 21:33:47] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 1 ms to minimize.
[2022-06-12 21:33:47] [INFO ] Deduced a trap composed of 79 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:33:47] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:33:47] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:33:47] [INFO ] Deduced a trap composed of 81 places in 58 ms of which 0 ms to minimize.
[2022-06-12 21:33:47] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1181 ms
[2022-06-12 21:33:47] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 28 ms.
[2022-06-12 21:33:50] [INFO ] Added : 477 causal constraints over 96 iterations in 3003 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 21:33:50] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2022-06-12 21:33:50] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:51] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2022-06-12 21:33:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:51] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2022-06-12 21:33:51] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:51] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2022-06-12 21:33:51] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 1 ms to minimize.
[2022-06-12 21:33:51] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 1 ms to minimize.
[2022-06-12 21:33:51] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 10 ms to minimize.
[2022-06-12 21:33:51] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:33:51] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2022-06-12 21:33:51] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:33:52] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:33:52] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 0 ms to minimize.
[2022-06-12 21:33:52] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 1 ms to minimize.
[2022-06-12 21:33:52] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:33:52] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:33:52] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:33:52] [INFO ] Deduced a trap composed of 55 places in 82 ms of which 2 ms to minimize.
[2022-06-12 21:33:52] [INFO ] Deduced a trap composed of 78 places in 72 ms of which 2 ms to minimize.
[2022-06-12 21:33:52] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 11 ms to minimize.
[2022-06-12 21:33:52] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 13 ms to minimize.
[2022-06-12 21:33:53] [INFO ] Deduced a trap composed of 78 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:33:53] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:33:53] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:33:53] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2022-06-12 21:33:53] [INFO ] Deduced a trap composed of 49 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:33:53] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:33:53] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
[2022-06-12 21:33:53] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:33:53] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:33:53] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:33:53] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:33:54] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:33:54] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:33:54] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:33:54] [INFO ] Deduced a trap composed of 52 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:33:54] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 2999 ms
[2022-06-12 21:33:54] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 25 ms.
[2022-06-12 21:33:56] [INFO ] Added : 340 causal constraints over 68 iterations in 1790 ms. Result :unknown
[2022-06-12 21:33:56] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2022-06-12 21:33:56] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-12 21:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:56] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2022-06-12 21:33:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 23 ms returned sat
[2022-06-12 21:33:56] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:56] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2022-06-12 21:33:56] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 0 ms to minimize.
[2022-06-12 21:33:56] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2022-06-12 21:33:57] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 0 ms to minimize.
[2022-06-12 21:33:57] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 0 ms to minimize.
[2022-06-12 21:33:57] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 1 ms to minimize.
[2022-06-12 21:33:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 659 ms
[2022-06-12 21:33:57] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 25 ms.
[2022-06-12 21:33:59] [INFO ] Added : 383 causal constraints over 77 iterations in 2252 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-12 21:33:59] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2022-06-12 21:33:59] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:00] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2022-06-12 21:34:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:34:00] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2022-06-12 21:34:00] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:34:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:00] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2022-06-12 21:34:00] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 0 ms to minimize.
[2022-06-12 21:34:00] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 0 ms to minimize.
[2022-06-12 21:34:00] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 0 ms to minimize.
[2022-06-12 21:34:00] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:34:00] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:34:00] [INFO ] Deduced a trap composed of 54 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:34:01] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:34:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 752 ms
[2022-06-12 21:34:01] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 29 ms.
[2022-06-12 21:34:03] [INFO ] Added : 398 causal constraints over 81 iterations in 2410 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
FORMULA AutoFlight-PT-05b-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Incomplete Parikh walk after 59400 steps, including 210 resets, run finished after 186 ms. (steps per millisecond=319 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 65800 steps, including 304 resets, run finished after 168 ms. (steps per millisecond=391 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 30600 steps, including 166 resets, run finished after 75 ms. (steps per millisecond=408 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 36300 steps, including 154 resets, run finished after 82 ms. (steps per millisecond=442 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 77 out of 482 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 482/482 places, 480/480 transitions.
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 482 transition count 368
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 127 rules applied. Total rules applied 239 place count 370 transition count 353
Reduce places removed 4 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 2 with 25 rules applied. Total rules applied 264 place count 366 transition count 332
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 288 place count 345 transition count 329
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 288 place count 345 transition count 285
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 376 place count 301 transition count 285
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 411 place count 266 transition count 250
Iterating global reduction 4 with 35 rules applied. Total rules applied 446 place count 266 transition count 250
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 451 place count 266 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 452 place count 265 transition count 245
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 452 place count 265 transition count 239
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 464 place count 259 transition count 239
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 6 with 98 rules applied. Total rules applied 562 place count 210 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 564 place count 209 transition count 190
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 569 place count 209 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 571 place count 208 transition count 184
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 580 place count 208 transition count 175
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 589 place count 199 transition count 175
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 590 place count 198 transition count 174
Applied a total of 590 rules in 138 ms. Remains 198 /482 variables (removed 284) and now considering 174/480 (removed 306) transitions.
Finished structural reductions, in 1 iterations. Remains : 198/482 places, 174/480 transitions.
[2022-06-12 21:34:04] [INFO ] Flatten gal took : 41 ms
[2022-06-12 21:34:04] [INFO ] Flatten gal took : 13 ms
[2022-06-12 21:34:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10788753920904426238.gal : 8 ms
[2022-06-12 21:34:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6505065203865762411.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality10788753920904426238.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6505065203865762411.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality10788753920904426238.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6505065203865762411.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6505065203865762411.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :18 after 108
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :108 after 252
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :252 after 2018
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :2018 after 5.8061e+06
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :5.8061e+06 after 1.11617e+08
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :1.11617e+08 after 1.03976e+11
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1.03976e+11 after 1.63554e+11
Detected timeout of ITS tools.
[2022-06-12 21:34:19] [INFO ] Flatten gal took : 27 ms
[2022-06-12 21:34:19] [INFO ] Applying decomposition
[2022-06-12 21:34:19] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14225578044748701719.txt, -o, /tmp/graph14225578044748701719.bin, -w, /tmp/graph14225578044748701719.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14225578044748701719.bin, -l, -1, -v, -w, /tmp/graph14225578044748701719.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:34:19] [INFO ] Decomposing Gal with order
[2022-06-12 21:34:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:34:19] [INFO ] Removed a total of 32 redundant transitions.
[2022-06-12 21:34:19] [INFO ] Flatten gal took : 51 ms
[2022-06-12 21:34:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 8 ms.
[2022-06-12 21:34:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5597463385439450412.gal : 27 ms
[2022-06-12 21:34:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17058248918185183058.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality5597463385439450412.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17058248918185183058.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality5597463385439450412.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17058248918185183058.prop --nowitness
Loading property file /tmp/ReachabilityCardinality17058248918185183058.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :3 after 24
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :24 after 15264
Invariant property AutoFlight-PT-05b-ReachabilityFireability-15 does not hold.
FORMULA AutoFlight-PT-05b-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :15264 after 2.62714e+12
Reachability property AutoFlight-PT-05b-ReachabilityFireability-13 is true.
FORMULA AutoFlight-PT-05b-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property AutoFlight-PT-05b-ReachabilityFireability-09 does not hold.
FORMULA AutoFlight-PT-05b-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2.62714e+12 after 1.15917e+15
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.51348e+16,0.131467,8728,881,44,10693,375,614,12700,83,829,0
Total reachable state count : 35134795996529400

Verifying 5 reachability properties.
Reachability property AutoFlight-PT-05b-ReachabilityFireability-01 is true.
FORMULA AutoFlight-PT-05b-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-05b-ReachabilityFireability-01,1.5766e+10,0.138208,8992,110,26,10693,375,685,12700,93,829,2618
Reachability property AutoFlight-PT-05b-ReachabilityFireability-07 is true.
FORMULA AutoFlight-PT-05b-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-05b-ReachabilityFireability-07,9.4596e+10,0.138508,8992,109,26,10693,375,685,12700,93,829,2618
Invariant property AutoFlight-PT-05b-ReachabilityFireability-09 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-05b-ReachabilityFireability-09,3.43985e+10,0.138905,8992,103,27,10693,375,690,12700,93,829,2667
Reachability property AutoFlight-PT-05b-ReachabilityFireability-13 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-05b-ReachabilityFireability-13,8.59963e+08,0.141652,8992,107,24,10693,375,758,12700,95,829,3692
Invariant property AutoFlight-PT-05b-ReachabilityFireability-15 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-05b-ReachabilityFireability-15,8.10153e+12,0.151863,8992,307,34,10693,375,847,12700,96,829,8117
All properties solved without resorting to model-checking.

BK_STOP 1655069660201

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ReachabilityFireability"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is AutoFlight-PT-05b, 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 r010-tajo-165245701700168"
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 [ "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 ;