fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r105-tall-167814480700085
Last Updated
May 14, 2023

About the Execution of LTSMin+red for CloudReconfiguration-PT-311

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
683.911 114999.00 133932.00 721.80 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r105-tall-167814480700085.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is CloudReconfiguration-PT-311, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814480700085
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.2K Feb 25 11:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 11:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 11:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 11:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 11:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 11:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 11:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 660K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-00
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-01
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-02
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-03
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-04
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-05
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-06
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-07
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-08
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-09
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-10
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-11
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-12
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-13
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-14
FORMULA_NAME CloudReconfiguration-PT-311-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678258335874

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudReconfiguration-PT-311
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 06:52:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 06:52:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 06:52:17] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2023-03-08 06:52:17] [INFO ] Transformed 2585 places.
[2023-03-08 06:52:17] [INFO ] Transformed 3095 transitions.
[2023-03-08 06:52:17] [INFO ] Found NUPN structural information;
[2023-03-08 06:52:17] [INFO ] Parsed PT model containing 2585 places and 3095 transitions and 6463 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 3095 rows 2585 cols
[2023-03-08 06:52:17] [INFO ] Computed 4 place invariants in 57 ms
Incomplete random walk after 10000 steps, including 97 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 30 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 32 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :0
[2023-03-08 06:52:18] [INFO ] Invariant cache hit.
[2023-03-08 06:52:19] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2023-03-08 06:52:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:52:20] [INFO ] [Real]Absence check using state equation in 1279 ms returned sat
[2023-03-08 06:52:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:52:20] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 48 ms returned sat
[2023-03-08 06:52:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:52:22] [INFO ] [Nat]Absence check using state equation in 1339 ms returned sat
[2023-03-08 06:52:22] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 191 ms.
[2023-03-08 06:52:25] [INFO ] Added : 105 causal constraints over 21 iterations in 3191 ms. Result :unknown
[2023-03-08 06:52:26] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 06:52:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:52:27] [INFO ] [Real]Absence check using state equation in 1237 ms returned sat
[2023-03-08 06:52:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:52:27] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:52:29] [INFO ] [Nat]Absence check using state equation in 1252 ms returned sat
[2023-03-08 06:52:29] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 147 ms.
[2023-03-08 06:52:32] [INFO ] Added : 120 causal constraints over 24 iterations in 3319 ms. Result :unknown
[2023-03-08 06:52:32] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:52:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:52:34] [INFO ] [Real]Absence check using state equation in 1298 ms returned sat
[2023-03-08 06:52:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:52:34] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 06:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:52:36] [INFO ] [Nat]Absence check using state equation in 1574 ms returned sat
[2023-03-08 06:52:36] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 206 ms.
[2023-03-08 06:52:39] [INFO ] Added : 110 causal constraints over 22 iterations in 3051 ms. Result :unknown
[2023-03-08 06:52:39] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 06:52:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:52:40] [INFO ] [Real]Absence check using state equation in 1237 ms returned sat
[2023-03-08 06:52:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:52:41] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:52:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:52:42] [INFO ] [Nat]Absence check using state equation in 1220 ms returned sat
[2023-03-08 06:52:42] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 146 ms.
[2023-03-08 06:52:46] [INFO ] Added : 125 causal constraints over 25 iterations in 3350 ms. Result :unknown
[2023-03-08 06:52:46] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 06:52:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:52:47] [INFO ] [Real]Absence check using state equation in 1311 ms returned sat
[2023-03-08 06:52:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:52:48] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 06:52:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:52:50] [INFO ] [Nat]Absence check using state equation in 1846 ms returned sat
[2023-03-08 06:52:50] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 148 ms.
[2023-03-08 06:52:52] [INFO ] Added : 100 causal constraints over 20 iterations in 2731 ms. Result :unknown
[2023-03-08 06:52:53] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 06:52:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:52:54] [INFO ] [Real]Absence check using state equation in 1193 ms returned sat
[2023-03-08 06:52:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:52:55] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 06:52:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:52:56] [INFO ] [Nat]Absence check using state equation in 1189 ms returned sat
[2023-03-08 06:52:56] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 140 ms.
[2023-03-08 06:52:59] [INFO ] Added : 125 causal constraints over 25 iterations in 3367 ms. Result :unknown
[2023-03-08 06:53:00] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 06:53:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:53:01] [INFO ] [Real]Absence check using state equation in 1165 ms returned sat
[2023-03-08 06:53:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:53:01] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 06:53:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:53:02] [INFO ] [Nat]Absence check using state equation in 1123 ms returned sat
[2023-03-08 06:53:03] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 139 ms.
[2023-03-08 06:53:06] [INFO ] Added : 121 causal constraints over 25 iterations in 3416 ms. Result :unknown
[2023-03-08 06:53:06] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:53:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:53:07] [INFO ] [Real]Absence check using state equation in 1153 ms returned sat
[2023-03-08 06:53:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:53:08] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 06:53:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:53:09] [INFO ] [Nat]Absence check using state equation in 1142 ms returned sat
[2023-03-08 06:53:09] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 129 ms.
[2023-03-08 06:53:13] [INFO ] Added : 129 causal constraints over 26 iterations in 3421 ms. Result :unknown
[2023-03-08 06:53:13] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 40 ms returned sat
[2023-03-08 06:53:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:53:14] [INFO ] [Real]Absence check using state equation in 1255 ms returned sat
[2023-03-08 06:53:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:53:15] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 43 ms returned sat
[2023-03-08 06:53:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:53:16] [INFO ] [Nat]Absence check using state equation in 1302 ms returned sat
[2023-03-08 06:53:16] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 133 ms.
[2023-03-08 06:53:19] [INFO ] Added : 125 causal constraints over 25 iterations in 3284 ms. Result :unknown
[2023-03-08 06:53:20] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:53:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:53:21] [INFO ] [Real]Absence check using state equation in 1214 ms returned sat
[2023-03-08 06:53:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:53:22] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 06:53:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:53:23] [INFO ] [Nat]Absence check using state equation in 1210 ms returned sat
[2023-03-08 06:53:23] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 142 ms.
[2023-03-08 06:53:26] [INFO ] Added : 125 causal constraints over 25 iterations in 3368 ms. Result :unknown
[2023-03-08 06:53:27] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:53:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:53:28] [INFO ] [Real]Absence check using state equation in 1257 ms returned sat
[2023-03-08 06:53:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:53:28] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2023-03-08 06:53:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:53:30] [INFO ] [Nat]Absence check using state equation in 1241 ms returned sat
[2023-03-08 06:53:30] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 146 ms.
[2023-03-08 06:53:33] [INFO ] Added : 125 causal constraints over 25 iterations in 3331 ms. Result :unknown
[2023-03-08 06:53:33] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 41 ms returned sat
[2023-03-08 06:53:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:53:35] [INFO ] [Real]Absence check using state equation in 1349 ms returned sat
[2023-03-08 06:53:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:53:35] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 47 ms returned sat
[2023-03-08 06:53:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:53:37] [INFO ] [Nat]Absence check using state equation in 1567 ms returned sat
[2023-03-08 06:53:37] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 135 ms.
[2023-03-08 06:53:40] [INFO ] Added : 110 causal constraints over 22 iterations in 2992 ms. Result :unknown
[2023-03-08 06:53:40] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:53:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:53:42] [INFO ] [Real]Absence check using state equation in 1331 ms returned sat
[2023-03-08 06:53:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:53:42] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 06:53:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:53:43] [INFO ] [Nat]Absence check using state equation in 1327 ms returned sat
[2023-03-08 06:53:44] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 144 ms.
[2023-03-08 06:53:47] [INFO ] Added : 120 causal constraints over 24 iterations in 3238 ms. Result :unknown
[2023-03-08 06:53:47] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:53:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:53:48] [INFO ] [Real]Absence check using state equation in 1158 ms returned sat
[2023-03-08 06:53:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:53:49] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2023-03-08 06:53:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:53:50] [INFO ] [Nat]Absence check using state equation in 1598 ms returned sat
[2023-03-08 06:53:51] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 136 ms.
[2023-03-08 06:53:54] [INFO ] Added : 110 causal constraints over 22 iterations in 2955 ms. Result :unknown
[2023-03-08 06:53:54] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:53:55] [INFO ] [Real]Absence check using state equation in 1280 ms returned sat
[2023-03-08 06:53:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:53:56] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 45 ms returned sat
[2023-03-08 06:53:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:53:57] [INFO ] [Nat]Absence check using state equation in 1263 ms returned sat
[2023-03-08 06:53:57] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 136 ms.
[2023-03-08 06:54:00] [INFO ] Added : 120 causal constraints over 24 iterations in 3265 ms. Result :unknown
[2023-03-08 06:54:01] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 42 ms returned sat
[2023-03-08 06:54:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:54:02] [INFO ] [Real]Absence check using state equation in 1216 ms returned sat
[2023-03-08 06:54:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:54:02] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 44 ms returned sat
[2023-03-08 06:54:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:54:04] [INFO ] [Nat]Absence check using state equation in 1264 ms returned sat
[2023-03-08 06:54:04] [INFO ] Computed and/alt/rep : 3086/3793/3086 causal constraints (skipped 8 transitions) in 140 ms.
[2023-03-08 06:54:07] [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 15
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 2585 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2585/2585 places, 3095/3095 transitions.
Graph (trivial) has 2923 edges and 2585 vertex of which 839 / 2585 are part of one of the 62 SCC in 16 ms
Free SCC test removed 777 places
Drop transitions removed 948 transitions
Reduce isomorphic transitions removed 948 transitions.
Graph (complete) has 2427 edges and 1808 vertex of which 1794 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.5 ms
Discarding 14 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 1193 transitions
Trivial Post-agglo rules discarded 1193 transitions
Performed 1193 trivial Post agglomeration. Transition count delta: 1193
Iterating post reduction 0 with 1202 rules applied. Total rules applied 1204 place count 1794 transition count 936
Reduce places removed 1193 places and 0 transitions.
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 1 with 1330 rules applied. Total rules applied 2534 place count 601 transition count 799
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 2 with 72 rules applied. Total rules applied 2606 place count 540 transition count 788
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 9 rules applied. Total rules applied 2615 place count 536 transition count 783
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 8 rules applied. Total rules applied 2623 place count 533 transition count 778
Reduce places removed 3 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 5 with 14 rules applied. Total rules applied 2637 place count 530 transition count 767
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 2648 place count 519 transition count 767
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 23 Pre rules applied. Total rules applied 2648 place count 519 transition count 744
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 2694 place count 496 transition count 744
Discarding 79 places :
Symmetric choice reduction at 7 with 79 rule applications. Total rules 2773 place count 417 transition count 665
Iterating global reduction 7 with 79 rules applied. Total rules applied 2852 place count 417 transition count 665
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 2852 place count 417 transition count 657
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 2868 place count 409 transition count 657
Discarding 60 places :
Symmetric choice reduction at 7 with 60 rule applications. Total rules 2928 place count 349 transition count 597
Iterating global reduction 7 with 60 rules applied. Total rules applied 2988 place count 349 transition count 597
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 7 with 36 rules applied. Total rules applied 3024 place count 349 transition count 561
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 28 rules applied. Total rules applied 3052 place count 331 transition count 551
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 3057 place count 326 transition count 551
Discarding 20 places :
Symmetric choice reduction at 10 with 20 rule applications. Total rules 3077 place count 306 transition count 519
Iterating global reduction 10 with 20 rules applied. Total rules applied 3097 place count 306 transition count 519
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 3105 place count 306 transition count 511
Discarding 9 places :
Symmetric choice reduction at 11 with 9 rule applications. Total rules 3114 place count 297 transition count 493
Iterating global reduction 11 with 9 rules applied. Total rules applied 3123 place count 297 transition count 493
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 3126 place count 294 transition count 487
Iterating global reduction 11 with 3 rules applied. Total rules applied 3129 place count 294 transition count 487
Performed 146 Post agglomeration using F-continuation condition with reduction of 71 identical transitions.
Deduced a syphon composed of 146 places in 0 ms
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 11 with 292 rules applied. Total rules applied 3421 place count 148 transition count 270
Drop transitions removed 1 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3427 place count 148 transition count 264
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 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 3431 place count 146 transition count 262
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 3435 place count 146 transition count 258
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 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 3439 place count 144 transition count 256
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 3443 place count 144 transition count 252
Performed 38 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 14 with 76 rules applied. Total rules applied 3519 place count 106 transition count 293
Drop transitions removed 8 transitions
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 14 with 42 rules applied. Total rules applied 3561 place count 106 transition count 251
Discarding 20 places :
Symmetric choice reduction at 15 with 20 rule applications. Total rules 3581 place count 86 transition count 217
Iterating global reduction 15 with 20 rules applied. Total rules applied 3601 place count 86 transition count 217
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 15 with 10 rules applied. Total rules applied 3611 place count 86 transition count 207
Discarding 4 places :
Symmetric choice reduction at 16 with 4 rule applications. Total rules 3615 place count 82 transition count 199
Iterating global reduction 16 with 4 rules applied. Total rules applied 3619 place count 82 transition count 199
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 3622 place count 82 transition count 196
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 17 with 13 rules applied. Total rules applied 3635 place count 82 transition count 183
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 3636 place count 81 transition count 179
Iterating global reduction 17 with 1 rules applied. Total rules applied 3637 place count 81 transition count 179
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 3638 place count 81 transition count 178
Free-agglomeration rule applied 6 times.
Iterating global reduction 17 with 6 rules applied. Total rules applied 3644 place count 81 transition count 172
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 7 rules applied. Total rules applied 3651 place count 75 transition count 171
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 3652 place count 75 transition count 170
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 18 with 1 rules applied. Total rules applied 3653 place count 75 transition count 169
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 3654 place count 74 transition count 169
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 3655 place count 74 transition count 169
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 3656 place count 73 transition count 168
Applied a total of 3656 rules in 367 ms. Remains 73 /2585 variables (removed 2512) and now considering 168/3095 (removed 2927) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 73/2585 places, 168/3095 transitions.
Normalized transition count is 160 out of 168 initially.
// Phase 1: matrix 160 rows 73 cols
[2023-03-08 06:54:07] [INFO ] Computed 4 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 15927 resets, run finished after 1155 ms. (steps per millisecond=865 ) properties (out of 16) seen :15
FORMULA CloudReconfiguration-PT-311-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudReconfiguration-PT-311-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 4238 resets, run finished after 324 ms. (steps per millisecond=3086 ) properties (out of 1) seen :0
[2023-03-08 06:54:09] [INFO ] Flow matrix only has 160 transitions (discarded 8 similar events)
// Phase 1: matrix 160 rows 73 cols
[2023-03-08 06:54:09] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-08 06:54:09] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-08 06:54:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 06:54:09] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-08 06:54:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 06:54:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-08 06:54:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 06:54:09] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-08 06:54:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 06:54:09] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2023-03-08 06:54:09] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 4 ms to minimize.
[2023-03-08 06:54:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 40 ms
Current structural bounds on expressions (after SMT) : [0] Max seen :[0]
FORMULA CloudReconfiguration-PT-311-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 112193 ms.
ITS solved all properties within timeout

BK_STOP 1678258450873

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="CloudReconfiguration-PT-311"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is CloudReconfiguration-PT-311, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814480700085"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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