About the Execution of 2021-gold for AutoFlight-PT-04b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
284.703 | 44022.00 | 62168.00 | 115.30 | TFTTTFFTTTFTFTFT | 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-165245701700162.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-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-tajo-165245701700162
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.2K Apr 30 01:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 01:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 01:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 01:30 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.7K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 30 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 30 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 01:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 30 01:31 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 91K 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-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 1655069584868
Running Version 0
[2022-06-12 21:33:07] [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:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:33:07] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2022-06-12 21:33:07] [INFO ] Transformed 390 places.
[2022-06-12 21:33:07] [INFO ] Transformed 388 transitions.
[2022-06-12 21:33:07] [INFO ] Found NUPN structural information;
[2022-06-12 21:33:07] [INFO ] Parsed PT model containing 390 places and 388 transitions in 137 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 50 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :7
FORMULA AutoFlight-PT-04b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 388 rows 390 cols
[2022-06-12 21:33:08] [INFO ] Computed 28 place invariants in 25 ms
[2022-06-12 21:33:08] [INFO ] [Real]Absence check using 27 positive place invariants in 55 ms returned sat
[2022-06-12 21:33:08] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:08] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2022-06-12 21:33:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:08] [INFO ] [Nat]Absence check using 27 positive place invariants in 6 ms returned unsat
[2022-06-12 21:33:08] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2022-06-12 21:33:08] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:09] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2022-06-12 21:33:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:09] [INFO ] [Nat]Absence check using 27 positive place invariants in 18 ms returned sat
[2022-06-12 21:33:09] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:09] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2022-06-12 21:33:09] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 3 ms to minimize.
[2022-06-12 21:33:09] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 2 ms to minimize.
[2022-06-12 21:33:09] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 1 ms to minimize.
[2022-06-12 21:33:09] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 1 ms to minimize.
[2022-06-12 21:33:10] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:33:10] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:33:10] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 1 ms to minimize.
[2022-06-12 21:33:10] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:33:10] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 0 ms to minimize.
[2022-06-12 21:33:10] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
[2022-06-12 21:33:10] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:33:10] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 1 ms to minimize.
[2022-06-12 21:33:10] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1382 ms
[2022-06-12 21:33:10] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 20 ms.
[2022-06-12 21:33:12] [INFO ] Added : 355 causal constraints over 71 iterations in 1748 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-12 21:33:12] [INFO ] [Real]Absence check using 27 positive place invariants in 24 ms returned sat
[2022-06-12 21:33:12] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned unsat
[2022-06-12 21:33:12] [INFO ] [Real]Absence check using 27 positive place invariants in 28 ms returned sat
[2022-06-12 21:33:12] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:33:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:12] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2022-06-12 21:33:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:13] [INFO ] [Nat]Absence check using 27 positive place invariants in 18 ms returned sat
[2022-06-12 21:33:13] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:13] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2022-06-12 21:33:13] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2022-06-12 21:33:13] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2022-06-12 21:33:13] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 1 ms to minimize.
[2022-06-12 21:33:13] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 0 ms to minimize.
[2022-06-12 21:33:13] [INFO ] Deduced a trap composed of 51 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:33:13] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2022-06-12 21:33:14] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 0 ms to minimize.
[2022-06-12 21:33:14] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 1 ms to minimize.
[2022-06-12 21:33:14] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2022-06-12 21:33:14] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:33:14] [INFO ] Deduced a trap composed of 59 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:33:14] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:33:14] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1209 ms
[2022-06-12 21:33:14] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 17 ms.
[2022-06-12 21:33:16] [INFO ] Added : 387 causal constraints over 78 iterations in 2042 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-12 21:33:16] [INFO ] [Real]Absence check using 27 positive place invariants in 19 ms returned sat
[2022-06-12 21:33:16] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:16] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2022-06-12 21:33:16] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 0 ms to minimize.
[2022-06-12 21:33:17] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 0 ms to minimize.
[2022-06-12 21:33:17] [INFO ] Deduced a trap composed of 28 places in 121 ms of which 0 ms to minimize.
[2022-06-12 21:33:17] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 0 ms to minimize.
[2022-06-12 21:33:17] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 1 ms to minimize.
[2022-06-12 21:33:17] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:33:17] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2022-06-12 21:33:17] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:33:17] [INFO ] Deduced a trap composed of 36 places in 75 ms of which 4 ms to minimize.
[2022-06-12 21:33:18] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:33:18] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:33:18] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2022-06-12 21:33:18] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:33:18] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:33:18] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1499 ms
[2022-06-12 21:33:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:18] [INFO ] [Nat]Absence check using 27 positive place invariants in 14 ms returned sat
[2022-06-12 21:33:18] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:18] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2022-06-12 21:33:18] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:33:18] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2022-06-12 21:33:18] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:33:18] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:33:19] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2022-06-12 21:33:19] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2022-06-12 21:33:19] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:33:19] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:33:19] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:33:19] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2022-06-12 21:33:19] [INFO ] Deduced a trap composed of 61 places in 81 ms of which 1 ms to minimize.
[2022-06-12 21:33:19] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:33:19] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:33:19] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1093 ms
[2022-06-12 21:33:19] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 16 ms.
[2022-06-12 21:33:21] [INFO ] Added : 352 causal constraints over 71 iterations in 1371 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-12 21:33:21] [INFO ] [Real]Absence check using 27 positive place invariants in 11 ms returned sat
[2022-06-12 21:33:21] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:21] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2022-06-12 21:33:21] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:21] [INFO ] [Nat]Absence check using 27 positive place invariants in 21 ms returned sat
[2022-06-12 21:33:21] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:21] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2022-06-12 21:33:21] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:33:21] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 9 ms to minimize.
[2022-06-12 21:33:21] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:33:22] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2022-06-12 21:33:22] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2022-06-12 21:33:22] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:33:22] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:33:22] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:33:22] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 0 ms to minimize.
[2022-06-12 21:33:22] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:33:22] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2022-06-12 21:33:22] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 3 ms to minimize.
[2022-06-12 21:33:22] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 0 ms to minimize.
[2022-06-12 21:33:22] [INFO ] Deduced a trap composed of 87 places in 63 ms of which 2 ms to minimize.
[2022-06-12 21:33:23] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 13 ms to minimize.
[2022-06-12 21:33:23] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 2 ms to minimize.
[2022-06-12 21:33:23] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1512 ms
[2022-06-12 21:33:23] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 22 ms.
[2022-06-12 21:33:25] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2022-06-12 21:33:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
[2022-06-12 21:33:25] [INFO ] Added : 333 causal constraints over 67 iterations in 1966 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 21:33:25] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned sat
[2022-06-12 21:33:25] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:25] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2022-06-12 21:33:25] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 0 ms to minimize.
[2022-06-12 21:33:25] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 1 ms to minimize.
[2022-06-12 21:33:25] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2022-06-12 21:33:25] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 1 ms to minimize.
[2022-06-12 21:33:25] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:33:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 565 ms
[2022-06-12 21:33:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:26] [INFO ] [Nat]Absence check using 27 positive place invariants in 13 ms returned sat
[2022-06-12 21:33:26] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:26] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2022-06-12 21:33:26] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 1 ms to minimize.
[2022-06-12 21:33:26] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 0 ms to minimize.
[2022-06-12 21:33:26] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2022-06-12 21:33:26] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 11 ms to minimize.
[2022-06-12 21:33:26] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:33:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 559 ms
[2022-06-12 21:33:26] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 29 ms.
[2022-06-12 21:33:28] [INFO ] Added : 356 causal constraints over 72 iterations in 1566 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-12 21:33:28] [INFO ] [Real]Absence check using 27 positive place invariants in 11 ms returned sat
[2022-06-12 21:33:28] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 4 ms returned unsat
[2022-06-12 21:33:28] [INFO ] [Real]Absence check using 27 positive place invariants in 16 ms returned sat
[2022-06-12 21:33:28] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:28] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2022-06-12 21:33:28] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2022-06-12 21:33:28] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 0 ms to minimize.
[2022-06-12 21:33:28] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:33:28] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2022-06-12 21:33:29] [INFO ] Deduced a trap composed of 54 places in 44 ms of which 1 ms to minimize.
[2022-06-12 21:33:29] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:33:29] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 0 ms to minimize.
[2022-06-12 21:33:29] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2022-06-12 21:33:29] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:33:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 743 ms
[2022-06-12 21:33:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:29] [INFO ] [Nat]Absence check using 27 positive place invariants in 10 ms returned sat
[2022-06-12 21:33:29] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:29] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-06-12 21:33:29] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2022-06-12 21:33:29] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2022-06-12 21:33:29] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:33:29] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
[2022-06-12 21:33:29] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:33:30] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:33:30] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:33:30] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:33:30] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
[2022-06-12 21:33:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 718 ms
[2022-06-12 21:33:30] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 16 ms.
[2022-06-12 21:33:31] [INFO ] Added : 377 causal constraints over 76 iterations in 1508 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-04b-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-04b-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 6 different solutions.
Incomplete Parikh walk after 38600 steps, including 210 resets, run finished after 101 ms. (steps per millisecond=382 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 65500 steps, including 316 resets, run finished after 155 ms. (steps per millisecond=422 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 40500 steps, including 225 resets, run finished after 93 ms. (steps per millisecond=435 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 28500 steps, including 142 resets, run finished after 65 ms. (steps per millisecond=438 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 34500 steps, including 178 resets, run finished after 69 ms. (steps per millisecond=500 ) properties (out of 6) seen :2 could not realise parikh vector
FORMULA AutoFlight-PT-04b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-04b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 42900 steps, including 210 resets, run finished after 70 ms. (steps per millisecond=612 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 65 out of 390 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 390 transition count 307
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 113 rules applied. Total rules applied 194 place count 309 transition count 275
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 27 rules applied. Total rules applied 221 place count 286 transition count 271
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 285 transition count 271
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 222 place count 285 transition count 235
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 294 place count 249 transition count 235
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 314 place count 229 transition count 215
Iterating global reduction 4 with 20 rules applied. Total rules applied 334 place count 229 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 335 place count 229 transition count 214
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 335 place count 229 transition count 208
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 347 place count 223 transition count 208
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 429 place count 182 transition count 167
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 431 place count 181 transition count 167
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 436 place count 181 transition count 162
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 438 place count 180 transition count 161
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 446 place count 180 transition count 153
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 454 place count 172 transition count 153
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 455 place count 172 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 456 place count 171 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 458 place count 169 transition count 151
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 458 place count 169 transition count 149
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 462 place count 167 transition count 149
Applied a total of 462 rules in 137 ms. Remains 167 /390 variables (removed 223) and now considering 149/388 (removed 239) transitions.
Finished structural reductions, in 1 iterations. Remains : 167/390 places, 149/388 transitions.
[2022-06-12 21:33:32] [INFO ] Flatten gal took : 74 ms
[2022-06-12 21:33:32] [INFO ] Flatten gal took : 15 ms
[2022-06-12 21:33:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11529647140383755224.gal : 16 ms
[2022-06-12 21:33:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16080102477754534428.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/ReachabilityCardinality11529647140383755224.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16080102477754534428.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/ReachabilityCardinality11529647140383755224.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16080102477754534428.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16080102477754534428.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 28
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :28 after 162
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :162 after 1732
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1732 after 8978
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :8978 after 181137
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :181137 after 9.3508e+08
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :9.3508e+08 after 1.08232e+10
Detected timeout of ITS tools.
[2022-06-12 21:33:47] [INFO ] Flatten gal took : 10 ms
[2022-06-12 21:33:47] [INFO ] Applying decomposition
[2022-06-12 21:33:47] [INFO ] Flatten gal took : 9 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/graph4371781470310642827.txt, -o, /tmp/graph4371781470310642827.bin, -w, /tmp/graph4371781470310642827.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/graph4371781470310642827.bin, -l, -1, -v, -w, /tmp/graph4371781470310642827.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:33:48] [INFO ] Decomposing Gal with order
[2022-06-12 21:33:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:33:48] [INFO ] Removed a total of 19 redundant transitions.
[2022-06-12 21:33:48] [INFO ] Flatten gal took : 58 ms
[2022-06-12 21:33:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2022-06-12 21:33:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2226231326430675465.gal : 5 ms
[2022-06-12 21:33:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12756499746060495063.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/ReachabilityCardinality2226231326430675465.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12756499746060495063.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/ReachabilityCardinality2226231326430675465.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12756499746060495063.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12756499746060495063.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :4 after 41780
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :41780 after 1.37515e+11
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,1.53975e+13,0.311401,12672,1878,28,18931,284,622,26133,72,568,0
Total reachable state count : 15397510465918
Verifying 4 reachability properties.
Reachability property AutoFlight-PT-04b-ReachabilityFireability-04 is true.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-04 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-04b-ReachabilityFireability-04,155520,0.316697,12936,86,17,18931,284,627,26133,78,568,1121
Reachability property AutoFlight-PT-04b-ReachabilityFireability-09 is true.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-09 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-04b-ReachabilityFireability-09,2.32875e+08,0.317155,12936,100,19,18931,284,628,26133,78,568,1127
Invariant property AutoFlight-PT-04b-ReachabilityFireability-10 does not hold.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-10 FALSE 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-04b-ReachabilityFireability-10,3.58214e+08,0.40259,12936,144,23,19743,284,725,26133,81,568,33732
Reachability property AutoFlight-PT-04b-ReachabilityFireability-15 is true.
FORMULA AutoFlight-PT-04b-ReachabilityFireability-15 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-04b-ReachabilityFireability-15,3.0618e+07,0.402993,12936,88,17,19761,284,725,26133,81,568,33732
All properties solved without resorting to model-checking.
BK_STOP 1655069628890
--------------------
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-04b"
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-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 r010-tajo-165245701700162"
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 '
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 ;