fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r233-tall-165286037600372
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for ShieldRVt-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
288.827 57934.00 76357.00 728.80 FTFTTTFTFTTFTFTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r233-tall-165286037600372.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is ShieldRVt-PT-020B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037600372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 5.1K Apr 30 00:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 30 00:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 00:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 00:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 00:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 30 00:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 30 00:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 30 00:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 239K May 10 09:34 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 ShieldRVt-PT-020B-ReachabilityFireability-00
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-01
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-02
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-03
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-04
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-05
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-06
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-07
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-08
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-09
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-10
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-11
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-12
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-13
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-14
FORMULA_NAME ShieldRVt-PT-020B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655081322970

Running Version 0
[2022-06-13 00:48:44] [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-13 00:48:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-13 00:48:44] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2022-06-13 00:48:44] [INFO ] Transformed 1003 places.
[2022-06-13 00:48:44] [INFO ] Transformed 1003 transitions.
[2022-06-13 00:48:44] [INFO ] Found NUPN structural information;
[2022-06-13 00:48:44] [INFO ] Parsed PT model containing 1003 places and 1003 transitions in 143 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 16) seen :10
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 1003 rows 1003 cols
[2022-06-13 00:48:45] [INFO ] Computed 81 place invariants in 31 ms
[2022-06-13 00:48:45] [INFO ] [Real]Absence check using 81 positive place invariants in 40 ms returned sat
[2022-06-13 00:48:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:45] [INFO ] [Real]Absence check using state equation in 412 ms returned sat
[2022-06-13 00:48:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:48:46] [INFO ] [Nat]Absence check using 81 positive place invariants in 42 ms returned sat
[2022-06-13 00:48:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:46] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2022-06-13 00:48:46] [INFO ] Deduced a trap composed of 27 places in 269 ms of which 13 ms to minimize.
[2022-06-13 00:48:47] [INFO ] Deduced a trap composed of 34 places in 254 ms of which 1 ms to minimize.
[2022-06-13 00:48:47] [INFO ] Deduced a trap composed of 38 places in 262 ms of which 1 ms to minimize.
[2022-06-13 00:48:47] [INFO ] Deduced a trap composed of 33 places in 227 ms of which 1 ms to minimize.
[2022-06-13 00:48:48] [INFO ] Deduced a trap composed of 40 places in 257 ms of which 3 ms to minimize.
[2022-06-13 00:48:48] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 3 ms to minimize.
[2022-06-13 00:48:48] [INFO ] Deduced a trap composed of 23 places in 219 ms of which 2 ms to minimize.
[2022-06-13 00:48:48] [INFO ] Deduced a trap composed of 24 places in 169 ms of which 0 ms to minimize.
[2022-06-13 00:48:49] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 1 ms to minimize.
[2022-06-13 00:48:49] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 1 ms to minimize.
[2022-06-13 00:48:49] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 1 ms to minimize.
[2022-06-13 00:48:49] [INFO ] Deduced a trap composed of 21 places in 150 ms of which 1 ms to minimize.
[2022-06-13 00:48:49] [INFO ] Deduced a trap composed of 34 places in 125 ms of which 1 ms to minimize.
[2022-06-13 00:48:50] [INFO ] Deduced a trap composed of 33 places in 134 ms of which 1 ms to minimize.
[2022-06-13 00:48:50] [INFO ] Deduced a trap composed of 33 places in 141 ms of which 0 ms to minimize.
[2022-06-13 00:48:50] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2022-06-13 00:48:50] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 1 ms to minimize.
[2022-06-13 00:48:50] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 0 ms to minimize.
[2022-06-13 00:48:50] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 0 ms to minimize.
[2022-06-13 00:48:51] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 1 ms to minimize.
[2022-06-13 00:48:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-13 00:48:51] [INFO ] [Real]Absence check using 81 positive place invariants in 42 ms returned sat
[2022-06-13 00:48:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:51] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2022-06-13 00:48:51] [INFO ] Deduced a trap composed of 32 places in 209 ms of which 0 ms to minimize.
[2022-06-13 00:48:52] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 0 ms to minimize.
[2022-06-13 00:48:52] [INFO ] Deduced a trap composed of 72 places in 185 ms of which 1 ms to minimize.
[2022-06-13 00:48:52] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 1 ms to minimize.
[2022-06-13 00:48:52] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 1 ms to minimize.
[2022-06-13 00:48:53] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 1 ms to minimize.
[2022-06-13 00:48:53] [INFO ] Deduced a trap composed of 47 places in 187 ms of which 0 ms to minimize.
[2022-06-13 00:48:53] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 1 ms to minimize.
[2022-06-13 00:48:53] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 1 ms to minimize.
[2022-06-13 00:48:53] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 0 ms to minimize.
[2022-06-13 00:48:54] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 1 ms to minimize.
[2022-06-13 00:48:54] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 1 ms to minimize.
[2022-06-13 00:48:54] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 1 ms to minimize.
[2022-06-13 00:48:54] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 1 ms to minimize.
[2022-06-13 00:48:54] [INFO ] Deduced a trap composed of 66 places in 172 ms of which 1 ms to minimize.
[2022-06-13 00:48:55] [INFO ] Deduced a trap composed of 38 places in 165 ms of which 1 ms to minimize.
[2022-06-13 00:48:55] [INFO ] Deduced a trap composed of 37 places in 159 ms of which 1 ms to minimize.
[2022-06-13 00:48:55] [INFO ] Deduced a trap composed of 73 places in 148 ms of which 1 ms to minimize.
[2022-06-13 00:48:55] [INFO ] Deduced a trap composed of 43 places in 153 ms of which 1 ms to minimize.
[2022-06-13 00:48:55] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 2 ms to minimize.
[2022-06-13 00:48:56] [INFO ] Deduced a trap composed of 34 places in 152 ms of which 0 ms to minimize.
[2022-06-13 00:48:56] [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 1
[2022-06-13 00:48:56] [INFO ] [Real]Absence check using 81 positive place invariants in 35 ms returned sat
[2022-06-13 00:48:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:48:56] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2022-06-13 00:48:56] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 0 ms to minimize.
[2022-06-13 00:48:57] [INFO ] Deduced a trap composed of 53 places in 189 ms of which 1 ms to minimize.
[2022-06-13 00:48:57] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 1 ms to minimize.
[2022-06-13 00:48:57] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 1 ms to minimize.
[2022-06-13 00:48:57] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 0 ms to minimize.
[2022-06-13 00:48:57] [INFO ] Deduced a trap composed of 30 places in 167 ms of which 2 ms to minimize.
[2022-06-13 00:48:58] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 0 ms to minimize.
[2022-06-13 00:48:58] [INFO ] Deduced a trap composed of 35 places in 181 ms of which 1 ms to minimize.
[2022-06-13 00:48:58] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 1 ms to minimize.
[2022-06-13 00:48:58] [INFO ] Deduced a trap composed of 40 places in 171 ms of which 1 ms to minimize.
[2022-06-13 00:48:59] [INFO ] Deduced a trap composed of 32 places in 188 ms of which 0 ms to minimize.
[2022-06-13 00:48:59] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 1 ms to minimize.
[2022-06-13 00:48:59] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 1 ms to minimize.
[2022-06-13 00:48:59] [INFO ] Deduced a trap composed of 54 places in 164 ms of which 1 ms to minimize.
[2022-06-13 00:48:59] [INFO ] Deduced a trap composed of 37 places in 161 ms of which 1 ms to minimize.
[2022-06-13 00:49:00] [INFO ] Deduced a trap composed of 37 places in 175 ms of which 13 ms to minimize.
[2022-06-13 00:49:00] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 1 ms to minimize.
[2022-06-13 00:49:00] [INFO ] Deduced a trap composed of 37 places in 154 ms of which 1 ms to minimize.
[2022-06-13 00:49:00] [INFO ] Deduced a trap composed of 41 places in 156 ms of which 1 ms to minimize.
[2022-06-13 00:49:00] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 1 ms to minimize.
[2022-06-13 00:49:01] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 1 ms to minimize.
[2022-06-13 00:49:01] [INFO ] Deduced a trap composed of 29 places in 157 ms of which 1 ms to minimize.
[2022-06-13 00:49:01] [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 2
[2022-06-13 00:49:01] [INFO ] [Real]Absence check using 81 positive place invariants in 32 ms returned sat
[2022-06-13 00:49:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:49:01] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2022-06-13 00:49:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:49:01] [INFO ] [Nat]Absence check using 81 positive place invariants in 33 ms returned sat
[2022-06-13 00:49:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:49:02] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2022-06-13 00:49:02] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 1 ms to minimize.
[2022-06-13 00:49:02] [INFO ] Deduced a trap composed of 57 places in 176 ms of which 0 ms to minimize.
[2022-06-13 00:49:02] [INFO ] Deduced a trap composed of 39 places in 176 ms of which 2 ms to minimize.
[2022-06-13 00:49:03] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 1 ms to minimize.
[2022-06-13 00:49:03] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 9 ms to minimize.
[2022-06-13 00:49:03] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 1 ms to minimize.
[2022-06-13 00:49:03] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 1 ms to minimize.
[2022-06-13 00:49:03] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 1 ms to minimize.
[2022-06-13 00:49:04] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 0 ms to minimize.
[2022-06-13 00:49:04] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 1 ms to minimize.
[2022-06-13 00:49:04] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 1 ms to minimize.
[2022-06-13 00:49:04] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 1 ms to minimize.
[2022-06-13 00:49:04] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 1 ms to minimize.
[2022-06-13 00:49:05] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 1 ms to minimize.
[2022-06-13 00:49:05] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 0 ms to minimize.
[2022-06-13 00:49:05] [INFO ] Deduced a trap composed of 34 places in 173 ms of which 0 ms to minimize.
[2022-06-13 00:49:05] [INFO ] Deduced a trap composed of 30 places in 165 ms of which 1 ms to minimize.
[2022-06-13 00:49:05] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 1 ms to minimize.
[2022-06-13 00:49:06] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 0 ms to minimize.
[2022-06-13 00:49:06] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 1 ms to minimize.
[2022-06-13 00:49:06] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2022-06-13 00:49:06] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4265 ms
[2022-06-13 00:49:06] [INFO ] Computed and/alt/rep : 1002/1483/1002 causal constraints (skipped 0 transitions) in 55 ms.
[2022-06-13 00:49:07] [INFO ] Deduced a trap composed of 15 places in 264 ms of which 1 ms to minimize.
[2022-06-13 00:49: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 3
[2022-06-13 00:49:07] [INFO ] [Real]Absence check using 81 positive place invariants in 32 ms returned sat
[2022-06-13 00:49:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:49:07] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2022-06-13 00:49:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:49:07] [INFO ] [Nat]Absence check using 81 positive place invariants in 37 ms returned sat
[2022-06-13 00:49:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:49:08] [INFO ] [Nat]Absence check using state equation in 343 ms returned sat
[2022-06-13 00:49:08] [INFO ] Deduced a trap composed of 79 places in 194 ms of which 0 ms to minimize.
[2022-06-13 00:49:08] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 1 ms to minimize.
[2022-06-13 00:49:08] [INFO ] Deduced a trap composed of 39 places in 194 ms of which 1 ms to minimize.
[2022-06-13 00:49:09] [INFO ] Deduced a trap composed of 77 places in 185 ms of which 0 ms to minimize.
[2022-06-13 00:49:09] [INFO ] Deduced a trap composed of 64 places in 185 ms of which 1 ms to minimize.
[2022-06-13 00:49:09] [INFO ] Deduced a trap composed of 33 places in 184 ms of which 1 ms to minimize.
[2022-06-13 00:49:09] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 1 ms to minimize.
[2022-06-13 00:49:09] [INFO ] Deduced a trap composed of 58 places in 195 ms of which 1 ms to minimize.
[2022-06-13 00:49:10] [INFO ] Deduced a trap composed of 38 places in 190 ms of which 0 ms to minimize.
[2022-06-13 00:49:10] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 0 ms to minimize.
[2022-06-13 00:49:10] [INFO ] Deduced a trap composed of 25 places in 190 ms of which 1 ms to minimize.
[2022-06-13 00:49:10] [INFO ] Deduced a trap composed of 41 places in 185 ms of which 1 ms to minimize.
[2022-06-13 00:49:11] [INFO ] Deduced a trap composed of 35 places in 189 ms of which 1 ms to minimize.
[2022-06-13 00:49:11] [INFO ] Deduced a trap composed of 38 places in 216 ms of which 1 ms to minimize.
[2022-06-13 00:49:11] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 1 ms to minimize.
[2022-06-13 00:49:11] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 0 ms to minimize.
[2022-06-13 00:49:11] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 0 ms to minimize.
[2022-06-13 00:49:12] [INFO ] Deduced a trap composed of 52 places in 188 ms of which 1 ms to minimize.
[2022-06-13 00:49:12] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 1 ms to minimize.
[2022-06-13 00:49:12] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 0 ms to minimize.
[2022-06-13 00:49:12] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 0 ms to minimize.
[2022-06-13 00:49:12] [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 4
[2022-06-13 00:49:12] [INFO ] [Real]Absence check using 81 positive place invariants in 32 ms returned sat
[2022-06-13 00:49:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-13 00:49:13] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2022-06-13 00:49:13] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 1 ms to minimize.
[2022-06-13 00:49:13] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 1 ms to minimize.
[2022-06-13 00:49:13] [INFO ] Deduced a trap composed of 28 places in 174 ms of which 0 ms to minimize.
[2022-06-13 00:49:14] [INFO ] Deduced a trap composed of 28 places in 183 ms of which 1 ms to minimize.
[2022-06-13 00:49:14] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 0 ms to minimize.
[2022-06-13 00:49:14] [INFO ] Deduced a trap composed of 35 places in 165 ms of which 1 ms to minimize.
[2022-06-13 00:49:14] [INFO ] Deduced a trap composed of 70 places in 159 ms of which 0 ms to minimize.
[2022-06-13 00:49:14] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 1 ms to minimize.
[2022-06-13 00:49:15] [INFO ] Deduced a trap composed of 34 places in 149 ms of which 1 ms to minimize.
[2022-06-13 00:49:15] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 1 ms to minimize.
[2022-06-13 00:49:15] [INFO ] Deduced a trap composed of 29 places in 140 ms of which 1 ms to minimize.
[2022-06-13 00:49:15] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 1 ms to minimize.
[2022-06-13 00:49:15] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 0 ms to minimize.
[2022-06-13 00:49:16] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 0 ms to minimize.
[2022-06-13 00:49:16] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 1 ms to minimize.
[2022-06-13 00:49:16] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 1 ms to minimize.
[2022-06-13 00:49:16] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 1 ms to minimize.
[2022-06-13 00:49:16] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 0 ms to minimize.
[2022-06-13 00:49:16] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 1 ms to minimize.
[2022-06-13 00:49:17] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 0 ms to minimize.
[2022-06-13 00:49:17] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 1 ms to minimize.
[2022-06-13 00:49:17] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 1 ms to minimize.
[2022-06-13 00:49:17] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
[2022-06-13 00:49:17] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 0 ms to minimize.
[2022-06-13 00:49:17] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4396 ms
[2022-06-13 00:49:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-13 00:49:17] [INFO ] [Nat]Absence check using 81 positive place invariants in 37 ms returned sat
[2022-06-13 00:49:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-13 00:49:18] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2022-06-13 00:49:18] [INFO ] Deduced a trap composed of 40 places in 179 ms of which 1 ms to minimize.
[2022-06-13 00:49:18] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 0 ms to minimize.
[2022-06-13 00:49:18] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 1 ms to minimize.
[2022-06-13 00:49:18] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 1 ms to minimize.
[2022-06-13 00:49:19] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 1 ms to minimize.
[2022-06-13 00:49:19] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 1 ms to minimize.
[2022-06-13 00:49:19] [INFO ] Deduced a trap composed of 70 places in 165 ms of which 0 ms to minimize.
[2022-06-13 00:49:19] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 1 ms to minimize.
[2022-06-13 00:49:19] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 0 ms to minimize.
[2022-06-13 00:49:20] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 1 ms to minimize.
[2022-06-13 00:49:20] [INFO ] Deduced a trap composed of 29 places in 142 ms of which 1 ms to minimize.
[2022-06-13 00:49:20] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 0 ms to minimize.
[2022-06-13 00:49:20] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 1 ms to minimize.
[2022-06-13 00:49:20] [INFO ] Deduced a trap composed of 36 places in 129 ms of which 1 ms to minimize.
[2022-06-13 00:49:21] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 0 ms to minimize.
[2022-06-13 00:49:21] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 0 ms to minimize.
[2022-06-13 00:49:21] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 0 ms to minimize.
[2022-06-13 00:49:21] [INFO ] Deduced a trap composed of 32 places in 124 ms of which 0 ms to minimize.
[2022-06-13 00:49:21] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 1 ms to minimize.
[2022-06-13 00:49:21] [INFO ] Deduced a trap composed of 41 places in 119 ms of which 1 ms to minimize.
[2022-06-13 00:49:22] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 1 ms to minimize.
[2022-06-13 00:49:22] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2022-06-13 00:49:22] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2022-06-13 00:49:22] [INFO ] Deduced a trap composed of 49 places in 105 ms of which 0 ms to minimize.
[2022-06-13 00:49:22] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4375 ms
[2022-06-13 00:49:22] [INFO ] Computed and/alt/rep : 1002/1483/1002 causal constraints (skipped 0 transitions) in 50 ms.
[2022-06-13 00:49:22] [INFO ] Added : 15 causal constraints over 3 iterations in 184 ms. Result :unknown
Fused 6 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 61800 steps, including 240 resets, run finished after 198 ms. (steps per millisecond=312 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 50 out of 1003 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1003/1003 places, 1003/1003 transitions.
Drop transitions removed 274 transitions
Trivial Post-agglo rules discarded 274 transitions
Performed 274 trivial Post agglomeration. Transition count delta: 274
Iterating post reduction 0 with 274 rules applied. Total rules applied 274 place count 1003 transition count 729
Reduce places removed 274 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 276 rules applied. Total rules applied 550 place count 729 transition count 727
Reduce places removed 1 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 2 with 18 rules applied. Total rules applied 568 place count 728 transition count 710
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 585 place count 711 transition count 710
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 82 Pre rules applied. Total rules applied 585 place count 711 transition count 628
Deduced a syphon composed of 82 places in 2 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 4 with 164 rules applied. Total rules applied 749 place count 629 transition count 628
Discarding 128 places :
Symmetric choice reduction at 4 with 128 rule applications. Total rules 877 place count 501 transition count 500
Iterating global reduction 4 with 128 rules applied. Total rules applied 1005 place count 501 transition count 500
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 1005 place count 501 transition count 453
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1099 place count 454 transition count 453
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 1 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 4 with 346 rules applied. Total rules applied 1445 place count 281 transition count 280
Renaming transitions due to excessive name length > 1024 char.
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 1539 place count 234 transition count 313
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 1542 place count 234 transition count 310
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1545 place count 231 transition count 310
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1547 place count 231 transition count 308
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1548 place count 231 transition count 308
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1549 place count 230 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1550 place count 229 transition count 307
Applied a total of 1550 rules in 211 ms. Remains 229 /1003 variables (removed 774) and now considering 307/1003 (removed 696) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/1003 places, 307/1003 transitions.
[2022-06-13 00:49:23] [INFO ] Flatten gal took : 64 ms
[2022-06-13 00:49:23] [INFO ] Flatten gal took : 30 ms
[2022-06-13 00:49:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16507729400132040878.gal : 15 ms
[2022-06-13 00:49:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality511805237483213262.prop : 0 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/ReachabilityCardinality16507729400132040878.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality511805237483213262.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/ReachabilityCardinality16507729400132040878.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality511805237483213262.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality511805237483213262.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 12
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :12 after 36
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :36 after 3564
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :3564 after 85536
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :898128 after 3.59076e+06
Reachability property ShieldRVt-PT-020B-ReachabilityFireability-14 is true.
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :3.59076e+06 after 3.6133e+06
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :3.6133e+06 after 3.81075e+06
Reachability property ShieldRVt-PT-020B-ReachabilityFireability-05 is true.
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :3.81075e+06 after 6.64946e+10
Detected timeout of ITS tools.
[2022-06-13 00:49:38] [INFO ] Flatten gal took : 26 ms
[2022-06-13 00:49:38] [INFO ] Applying decomposition
[2022-06-13 00:49:38] [INFO ] Flatten gal took : 22 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/graph8644345073218611219.txt, -o, /tmp/graph8644345073218611219.bin, -w, /tmp/graph8644345073218611219.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/graph8644345073218611219.bin, -l, -1, -v, -w, /tmp/graph8644345073218611219.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-13 00:49:38] [INFO ] Decomposing Gal with order
[2022-06-13 00:49:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-13 00:49:38] [INFO ] Removed a total of 369 redundant transitions.
[2022-06-13 00:49:38] [INFO ] Flatten gal took : 64 ms
[2022-06-13 00:49:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 206 labels/synchronizations in 13 ms.
[2022-06-13 00:49:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13891592619326182535.gal : 6 ms
[2022-06-13 00:49:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8631144363090914299.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/ReachabilityCardinality13891592619326182535.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8631144363090914299.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/ReachabilityCardinality13891592619326182535.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8631144363090914299.prop --nowitness
Loading property file /tmp/ReachabilityCardinality8631144363090914299.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :12 after 36
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :2.7919e+08 after 3.43822e+11
Invariant property ShieldRVt-PT-020B-ReachabilityFireability-08 does not hold.
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldRVt-PT-020B-ReachabilityFireability-03 is true.
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldRVt-PT-020B-ReachabilityFireability-02 does not hold.
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3.43822e+11 after 3.05224e+24
Reachability property ShieldRVt-PT-020B-ReachabilityFireability-09 is true.
FORMULA ShieldRVt-PT-020B-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
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,2.24977e+30,0.551664,21476,775,93,33809,590,646,92671,109,3856,0
Total reachable state count : 2249771466463856742651387707392

Verifying 4 reachability properties.
Invariant property ShieldRVt-PT-020B-ReachabilityFireability-02 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-020B-ReachabilityFireability-02,6.58013e+28,0.631171,21740,469,74,33809,590,753,92671,122,3856,0
Reachability property ShieldRVt-PT-020B-ReachabilityFireability-03 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-020B-ReachabilityFireability-03,4.6616e+27,0.632994,21740,177,57,33809,590,825,92671,125,3856,0
Invariant property ShieldRVt-PT-020B-ReachabilityFireability-08 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-020B-ReachabilityFireability-08,3.82987e+27,0.639243,21740,325,68,33809,590,844,92671,126,3856,0
Reachability property ShieldRVt-PT-020B-ReachabilityFireability-09 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldRVt-PT-020B-ReachabilityFireability-09,5.03296e+18,0.670862,21740,148,40,33809,590,880,92671,127,3856,0
All properties solved without resorting to model-checking.

BK_STOP 1655081380904

--------------------
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="ShieldRVt-PT-020B"
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 ShieldRVt-PT-020B, 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 r233-tall-165286037600372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-020B.tgz
mv ShieldRVt-PT-020B execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;