Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127600271.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NoC3x3-PT-3B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127600271
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 980K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 92K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 06:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 06:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 07:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 07:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 581K May 5 16:51 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620956391229

Running Version 0
[2021-05-14 01:39:52] [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]
[2021-05-14 01:39:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 01:39:53] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2021-05-14 01:39:53] [INFO ] Transformed 2117 places.
[2021-05-14 01:39:53] [INFO ] Transformed 2435 transitions.
[2021-05-14 01:39:53] [INFO ] Found NUPN structural information;
[2021-05-14 01:39:53] [INFO ] Parsed PT model containing 2117 places and 2435 transitions in 196 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 17 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 16) seen :7
FORMULA NoC3x3-PT-3B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :1
FORMULA NoC3x3-PT-3B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :1
FORMULA NoC3x3-PT-3B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 2435 rows 2117 cols
[2021-05-14 01:39:53] [INFO ] Computed 66 place invariants in 40 ms
[2021-05-14 01:39:54] [INFO ] [Real]Absence check using 66 positive place invariants in 59 ms returned sat
[2021-05-14 01:39:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 01:39:54] [INFO ] [Real]Absence check using state equation in 877 ms returned sat
[2021-05-14 01:39:55] [INFO ] Deduced a trap composed of 52 places in 554 ms of which 6 ms to minimize.
[2021-05-14 01:39:56] [INFO ] Deduced a trap composed of 72 places in 469 ms of which 2 ms to minimize.
[2021-05-14 01:39:56] [INFO ] Deduced a trap composed of 44 places in 324 ms of which 1 ms to minimize.
[2021-05-14 01:39:57] [INFO ] Deduced a trap composed of 80 places in 344 ms of which 1 ms to minimize.
[2021-05-14 01:39:57] [INFO ] Deduced a trap composed of 78 places in 234 ms of which 1 ms to minimize.
[2021-05-14 01:39:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2461 ms
[2021-05-14 01:39:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 01:39:57] [INFO ] [Nat]Absence check using 66 positive place invariants in 58 ms returned sat
[2021-05-14 01:39:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 01:39:58] [INFO ] [Nat]Absence check using state equation in 869 ms returned sat
[2021-05-14 01:39:59] [INFO ] Deduced a trap composed of 52 places in 428 ms of which 1 ms to minimize.
[2021-05-14 01:39:59] [INFO ] Deduced a trap composed of 72 places in 401 ms of which 1 ms to minimize.
[2021-05-14 01:40:00] [INFO ] Deduced a trap composed of 44 places in 324 ms of which 1 ms to minimize.
[2021-05-14 01:40:00] [INFO ] Deduced a trap composed of 80 places in 327 ms of which 0 ms to minimize.
[2021-05-14 01:40:00] [INFO ] Deduced a trap composed of 78 places in 210 ms of which 1 ms to minimize.
[2021-05-14 01:40:00] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2172 ms
[2021-05-14 01:40:01] [INFO ] Computed and/alt/rep : 2387/5262/2387 causal constraints (skipped 47 transitions) in 159 ms.
[2021-05-14 01:40:03] [INFO ] Deduced a trap composed of 7 places in 1076 ms of which 14 ms to minimize.
[2021-05-14 01:40:03] [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
[2021-05-14 01:40:04] [INFO ] [Real]Absence check using 66 positive place invariants in 58 ms returned sat
[2021-05-14 01:40:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 01:40:04] [INFO ] [Real]Absence check using state equation in 816 ms returned sat
[2021-05-14 01:40:05] [INFO ] Deduced a trap composed of 59 places in 428 ms of which 1 ms to minimize.
[2021-05-14 01:40:05] [INFO ] Deduced a trap composed of 86 places in 432 ms of which 1 ms to minimize.
[2021-05-14 01:40:06] [INFO ] Deduced a trap composed of 81 places in 441 ms of which 1 ms to minimize.
[2021-05-14 01:40:06] [INFO ] Deduced a trap composed of 54 places in 383 ms of which 1 ms to minimize.
[2021-05-14 01:40:07] [INFO ] Deduced a trap composed of 71 places in 330 ms of which 1 ms to minimize.
[2021-05-14 01:40:07] [INFO ] Deduced a trap composed of 107 places in 290 ms of which 1 ms to minimize.
[2021-05-14 01:40:08] [INFO ] Deduced a trap composed of 61 places in 271 ms of which 1 ms to minimize.
[2021-05-14 01:40:08] [INFO ] Deduced a trap composed of 67 places in 270 ms of which 2 ms to minimize.
[2021-05-14 01:40:08] [INFO ] Deduced a trap composed of 95 places in 242 ms of which 0 ms to minimize.
[2021-05-14 01:40:08] [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
[2021-05-14 01:40:09] [INFO ] [Real]Absence check using 66 positive place invariants in 55 ms returned sat
[2021-05-14 01:40:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 01:40:10] [INFO ] [Real]Absence check using state equation in 915 ms returned sat
[2021-05-14 01:40:10] [INFO ] Deduced a trap composed of 105 places in 253 ms of which 1 ms to minimize.
[2021-05-14 01:40:10] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 1 ms to minimize.
[2021-05-14 01:40:10] [INFO ] Deduced a trap composed of 73 places in 200 ms of which 0 ms to minimize.
[2021-05-14 01:40:11] [INFO ] Deduced a trap composed of 104 places in 200 ms of which 1 ms to minimize.
[2021-05-14 01:40:11] [INFO ] Deduced a trap composed of 91 places in 169 ms of which 0 ms to minimize.
[2021-05-14 01:40:11] [INFO ] Deduced a trap composed of 91 places in 185 ms of which 0 ms to minimize.
[2021-05-14 01:40:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1724 ms
[2021-05-14 01:40:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 01:40:12] [INFO ] [Nat]Absence check using 66 positive place invariants in 56 ms returned sat
[2021-05-14 01:40:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 01:40:13] [INFO ] [Nat]Absence check using state equation in 973 ms returned sat
[2021-05-14 01:40:13] [INFO ] Deduced a trap composed of 105 places in 257 ms of which 1 ms to minimize.
[2021-05-14 01:40:13] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 1 ms to minimize.
[2021-05-14 01:40:14] [INFO ] Deduced a trap composed of 73 places in 231 ms of which 1 ms to minimize.
[2021-05-14 01:40:14] [INFO ] Deduced a trap composed of 104 places in 189 ms of which 1 ms to minimize.
[2021-05-14 01:40:14] [INFO ] Deduced a trap composed of 91 places in 199 ms of which 1 ms to minimize.
[2021-05-14 01:40:14] [INFO ] Deduced a trap composed of 91 places in 189 ms of which 0 ms to minimize.
[2021-05-14 01:40:15] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1816 ms
[2021-05-14 01:40:15] [INFO ] Computed and/alt/rep : 2387/5262/2387 causal constraints (skipped 47 transitions) in 147 ms.
[2021-05-14 01:40:16] [INFO ] Added : 85 causal constraints over 17 iterations in 1826 ms. Result :unknown
[2021-05-14 01:40:17] [INFO ] [Real]Absence check using 66 positive place invariants in 54 ms returned sat
[2021-05-14 01:40:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 01:40:18] [INFO ] [Real]Absence check using state equation in 900 ms returned sat
[2021-05-14 01:40:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 01:40:18] [INFO ] [Nat]Absence check using 66 positive place invariants in 56 ms returned sat
[2021-05-14 01:40:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 01:40:19] [INFO ] [Nat]Absence check using state equation in 864 ms returned sat
[2021-05-14 01:40:19] [INFO ] Deduced a trap composed of 56 places in 332 ms of which 1 ms to minimize.
[2021-05-14 01:40:20] [INFO ] Deduced a trap composed of 73 places in 323 ms of which 1 ms to minimize.
[2021-05-14 01:40:20] [INFO ] Deduced a trap composed of 61 places in 293 ms of which 5 ms to minimize.
[2021-05-14 01:40:21] [INFO ] Deduced a trap composed of 102 places in 304 ms of which 1 ms to minimize.
[2021-05-14 01:40:21] [INFO ] Deduced a trap composed of 78 places in 260 ms of which 0 ms to minimize.
[2021-05-14 01:40:21] [INFO ] Deduced a trap composed of 120 places in 291 ms of which 1 ms to minimize.
[2021-05-14 01:40:22] [INFO ] Deduced a trap composed of 114 places in 289 ms of which 1 ms to minimize.
[2021-05-14 01:40:22] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2681 ms
[2021-05-14 01:40:22] [INFO ] Computed and/alt/rep : 2387/5262/2387 causal constraints (skipped 47 transitions) in 176 ms.
[2021-05-14 01:40:24] [INFO ] Deduced a trap composed of 7 places in 942 ms of which 13 ms to minimize.
[2021-05-14 01:40:24] [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
[2021-05-14 01:40:24] [INFO ] [Real]Absence check using 66 positive place invariants in 53 ms returned sat
[2021-05-14 01:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 01:40:25] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2021-05-14 01:40:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 01:40:25] [INFO ] [Nat]Absence check using 66 positive place invariants in 55 ms returned sat
[2021-05-14 01:40:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 01:40:26] [INFO ] [Nat]Absence check using state equation in 883 ms returned sat
[2021-05-14 01:40:27] [INFO ] Deduced a trap composed of 46 places in 252 ms of which 0 ms to minimize.
[2021-05-14 01:40:27] [INFO ] Deduced a trap composed of 72 places in 237 ms of which 1 ms to minimize.
[2021-05-14 01:40:27] [INFO ] Deduced a trap composed of 96 places in 173 ms of which 0 ms to minimize.
[2021-05-14 01:40:27] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 1 ms to minimize.
[2021-05-14 01:40:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1200 ms
[2021-05-14 01:40:28] [INFO ] Computed and/alt/rep : 2387/5262/2387 causal constraints (skipped 47 transitions) in 146 ms.
[2021-05-14 01:40:30] [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
[2021-05-14 01:40:30] [INFO ] [Real]Absence check using 66 positive place invariants in 55 ms returned sat
[2021-05-14 01:40:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 01:40:31] [INFO ] [Real]Absence check using state equation in 973 ms returned sat
[2021-05-14 01:40:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 01:40:32] [INFO ] [Nat]Absence check using 66 positive place invariants in 58 ms returned sat
[2021-05-14 01:40:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 01:40:33] [INFO ] [Nat]Absence check using state equation in 1000 ms returned sat
[2021-05-14 01:40:33] [INFO ] Deduced a trap composed of 66 places in 189 ms of which 1 ms to minimize.
[2021-05-14 01:40:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2021-05-14 01:40:33] [INFO ] Computed and/alt/rep : 2387/5262/2387 causal constraints (skipped 47 transitions) in 143 ms.
[2021-05-14 01:40:37] [INFO ] Deduced a trap composed of 7 places in 976 ms of which 4 ms to minimize.
[2021-05-14 01:40:37] [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 5
[2021-05-14 01:40:38] [INFO ] [Real]Absence check using 66 positive place invariants in 82 ms returned sat
[2021-05-14 01:40:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 01:40:39] [INFO ] [Real]Absence check using state equation in 785 ms returned sat
[2021-05-14 01:40:39] [INFO ] Deduced a trap composed of 52 places in 326 ms of which 1 ms to minimize.
[2021-05-14 01:40:39] [INFO ] Deduced a trap composed of 77 places in 298 ms of which 5 ms to minimize.
[2021-05-14 01:40:40] [INFO ] Deduced a trap composed of 77 places in 249 ms of which 1 ms to minimize.
[2021-05-14 01:40:40] [INFO ] Deduced a trap composed of 49 places in 217 ms of which 1 ms to minimize.
[2021-05-14 01:40:40] [INFO ] Deduced a trap composed of 74 places in 188 ms of which 1 ms to minimize.
[2021-05-14 01:40:41] [INFO ] Deduced a trap composed of 107 places in 170 ms of which 0 ms to minimize.
[2021-05-14 01:40:41] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 1 ms to minimize.
[2021-05-14 01:40:41] [INFO ] Deduced a trap composed of 87 places in 111 ms of which 1 ms to minimize.
[2021-05-14 01:40:41] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 1 ms to minimize.
[2021-05-14 01:40:41] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 0 ms to minimize.
[2021-05-14 01:40:41] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2682 ms
[2021-05-14 01:40:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 01:40:42] [INFO ] [Nat]Absence check using 66 positive place invariants in 55 ms returned sat
[2021-05-14 01:40:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 01:40:43] [INFO ] [Nat]Absence check using state equation in 838 ms returned sat
[2021-05-14 01:40:43] [INFO ] Deduced a trap composed of 52 places in 334 ms of which 15 ms to minimize.
[2021-05-14 01:40:43] [INFO ] Deduced a trap composed of 77 places in 271 ms of which 0 ms to minimize.
[2021-05-14 01:40:44] [INFO ] Deduced a trap composed of 77 places in 267 ms of which 1 ms to minimize.
[2021-05-14 01:40:44] [INFO ] Deduced a trap composed of 49 places in 230 ms of which 1 ms to minimize.
[2021-05-14 01:40:44] [INFO ] Deduced a trap composed of 74 places in 214 ms of which 1 ms to minimize.
[2021-05-14 01:40:45] [INFO ] Deduced a trap composed of 107 places in 169 ms of which 0 ms to minimize.
[2021-05-14 01:40:45] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 1 ms to minimize.
[2021-05-14 01:40:45] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 0 ms to minimize.
[2021-05-14 01:40:45] [INFO ] Deduced a trap composed of 63 places in 93 ms of which 0 ms to minimize.
[2021-05-14 01:40:45] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 0 ms to minimize.
[2021-05-14 01:40:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2675 ms
[2021-05-14 01:40:45] [INFO ] Computed and/alt/rep : 2387/5262/2387 causal constraints (skipped 47 transitions) in 148 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2021-05-14 01:40:47] [INFO ] Deduced a trap composed of 7 places in 979 ms of which 4 ms to minimize.
[2021-05-14 01:40:47] [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 6
Fused 7 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 69900 steps, including 167 resets, run finished after 404 ms. (steps per millisecond=173 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 35 out of 2117 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2117/2117 places, 2435/2435 transitions.
Graph (trivial) has 1678 edges and 2117 vertex of which 56 / 2117 are part of one of the 7 SCC in 9 ms
Free SCC test removed 49 places
Drop transitions removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 418 transitions
Trivial Post-agglo rules discarded 418 transitions
Performed 418 trivial Post agglomeration. Transition count delta: 418
Iterating post reduction 0 with 423 rules applied. Total rules applied 424 place count 2063 transition count 1961
Reduce places removed 418 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 422 rules applied. Total rules applied 846 place count 1645 transition count 1957
Reduce places removed 2 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 2 with 16 rules applied. Total rules applied 862 place count 1643 transition count 1943
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 876 place count 1629 transition count 1943
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 876 place count 1629 transition count 1915
Deduced a syphon composed of 28 places in 7 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 932 place count 1601 transition count 1915
Discarding 363 places :
Symmetric choice reduction at 4 with 363 rule applications. Total rules 1295 place count 1238 transition count 1552
Iterating global reduction 4 with 363 rules applied. Total rules applied 1658 place count 1238 transition count 1552
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 1658 place count 1238 transition count 1515
Deduced a syphon composed of 37 places in 10 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 1732 place count 1201 transition count 1515
Discarding 133 places :
Symmetric choice reduction at 4 with 133 rule applications. Total rules 1865 place count 1068 transition count 1345
Iterating global reduction 4 with 133 rules applied. Total rules applied 1998 place count 1068 transition count 1345
Discarding 135 places :
Symmetric choice reduction at 4 with 135 rule applications. Total rules 2133 place count 933 transition count 1195
Iterating global reduction 4 with 135 rules applied. Total rules applied 2268 place count 933 transition count 1195
Discarding 51 places :
Symmetric choice reduction at 4 with 51 rule applications. Total rules 2319 place count 882 transition count 1105
Iterating global reduction 4 with 51 rules applied. Total rules applied 2370 place count 882 transition count 1105
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 19 rules applied. Total rules applied 2389 place count 880 transition count 1088
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2391 place count 878 transition count 1088
Discarding 36 places :
Symmetric choice reduction at 6 with 36 rule applications. Total rules 2427 place count 842 transition count 1052
Iterating global reduction 6 with 36 rules applied. Total rules applied 2463 place count 842 transition count 1052
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 4 rules applied. Total rules applied 2467 place count 840 transition count 1050
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 2469 place count 838 transition count 1050
Discarding 22 places :
Symmetric choice reduction at 8 with 22 rule applications. Total rules 2491 place count 816 transition count 1006
Iterating global reduction 8 with 22 rules applied. Total rules applied 2513 place count 816 transition count 1006
Discarding 21 places :
Symmetric choice reduction at 8 with 21 rule applications. Total rules 2534 place count 795 transition count 985
Iterating global reduction 8 with 21 rules applied. Total rules applied 2555 place count 795 transition count 985
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 23 rules applied. Total rules applied 2578 place count 794 transition count 963
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2579 place count 793 transition count 963
Performed 303 Post agglomeration using F-continuation condition.Transition count delta: 303
Deduced a syphon composed of 303 places in 0 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 10 with 606 rules applied. Total rules applied 3185 place count 490 transition count 660
Discarding 13 places :
Symmetric choice reduction at 10 with 13 rule applications. Total rules 3198 place count 477 transition count 647
Iterating global reduction 10 with 13 rules applied. Total rules applied 3211 place count 477 transition count 647
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 3219 place count 469 transition count 631
Iterating global reduction 10 with 8 rules applied. Total rules applied 3227 place count 469 transition count 631
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 3229 place count 469 transition count 629
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 3231 place count 467 transition count 625
Iterating global reduction 11 with 2 rules applied. Total rules applied 3233 place count 467 transition count 625
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 11 with 40 rules applied. Total rules applied 3273 place count 447 transition count 663
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 3274 place count 447 transition count 662
Free-agglomeration rule applied 28 times.
Iterating global reduction 11 with 28 rules applied. Total rules applied 3302 place count 447 transition count 634
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 36 rules applied. Total rules applied 3338 place count 419 transition count 626
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 12 with 4 rules applied. Total rules applied 3342 place count 419 transition count 622
Free-agglomeration rule applied 1 times.
Iterating global reduction 12 with 1 rules applied. Total rules applied 3343 place count 419 transition count 621
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 3344 place count 418 transition count 621
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 13 with 1 rules applied. Total rules applied 3345 place count 418 transition count 620
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 3346 place count 417 transition count 620
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 14 with 5 rules applied. Total rules applied 3351 place count 417 transition count 620
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 14 with 4 rules applied. Total rules applied 3355 place count 417 transition count 620
Applied a total of 3355 rules in 924 ms. Remains 417 /2117 variables (removed 1700) and now considering 620/2435 (removed 1815) transitions.
Finished structural reductions, in 1 iterations. Remains : 417/2117 places, 620/2435 transitions.
[2021-05-14 01:40:49] [INFO ] Flatten gal took : 105 ms
[2021-05-14 01:40:49] [INFO ] Flatten gal took : 59 ms
[2021-05-14 01:40:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5240029694692308354.gal : 21 ms
[2021-05-14 01:40:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7395207419872819269.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/ReachabilityCardinality5240029694692308354.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7395207419872819269.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/ReachabilityCardinality5240029694692308354.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7395207419872819269.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7395207419872819269.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :16 after 17
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :17 after 35
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :35 after 115
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :115 after 281
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :281 after 2255
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :2255 after 8099
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :8099 after 27917
Invariant property NoC3x3-PT-3B-ReachabilityFireability-10 does not hold.
FORMULA NoC3x3-PT-3B-ReachabilityFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :27917 after 200395
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :200395 after 285269
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :285269 after 1.93226e+06
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :1.93226e+06 after 7.09473e+08
Detected timeout of ITS tools.
[2021-05-14 01:41:04] [INFO ] Flatten gal took : 49 ms
[2021-05-14 01:41:04] [INFO ] Applying decomposition
[2021-05-14 01:41:04] [INFO ] Flatten gal took : 42 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/graph16792930303208006679.txt, -o, /tmp/graph16792930303208006679.bin, -w, /tmp/graph16792930303208006679.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/graph16792930303208006679.bin, -l, -1, -v, -w, /tmp/graph16792930303208006679.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 01:41:04] [INFO ] Decomposing Gal with order
[2021-05-14 01:41:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 01:41:05] [INFO ] Removed a total of 521 redundant transitions.
[2021-05-14 01:41:05] [INFO ] Flatten gal took : 133 ms
[2021-05-14 01:41:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 388 labels/synchronizations in 40 ms.
[2021-05-14 01:41:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1992898841642832298.gal : 12 ms
[2021-05-14 01:41:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality331838774505387845.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/ReachabilityCardinality1992898841642832298.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality331838774505387845.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/ReachabilityCardinality1992898841642832298.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality331838774505387845.prop --nowitness
Loading property file /tmp/ReachabilityCardinality331838774505387845.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 219
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :219 after 5059
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :5059 after 47559
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :47559 after 8.38365e+08
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :8.38365e+08 after 2.72483e+09
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :2.72483e+09 after 3.71253e+09
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :3.71253e+09 after 2.22627e+11
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :2.22627e+11 after 3.28004e+11
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :3.28004e+11 after 2.64449e+15
Reachability property NoC3x3-PT-3B-ReachabilityFireability-06 is true.
FORMULA NoC3x3-PT-3B-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :2.64449e+15 after 1.48603e+17
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9759240496284134763
[2021-05-14 01:41:20] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9759240496284134763
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9759240496284134763]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9759240496284134763] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin9759240496284134763] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 10783 resets, run finished after 5129 ms. (steps per millisecond=194 ) properties (out of 5) seen :3
FORMULA NoC3x3-PT-3B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-3B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 662 resets, run finished after 1394 ms. (steps per millisecond=717 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 681 resets, run finished after 1448 ms. (steps per millisecond=690 ) properties (out of 2) seen :1
FORMULA NoC3x3-PT-3B-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 620 rows 417 cols
[2021-05-14 01:41:29] [INFO ] Computed 57 place invariants in 14 ms
[2021-05-14 01:41:29] [INFO ] [Real]Absence check using 57 positive place invariants in 11 ms returned sat
[2021-05-14 01:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 01:41:29] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2021-05-14 01:41:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 01:41:29] [INFO ] [Nat]Absence check using 57 positive place invariants in 11 ms returned sat
[2021-05-14 01:41:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 01:41:29] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2021-05-14 01:41:29] [INFO ] State equation strengthened by 67 read => feed constraints.
[2021-05-14 01:41:29] [INFO ] [Nat]Added 67 Read/Feed constraints in 14 ms returned sat
[2021-05-14 01:41:29] [INFO ] Computed and/alt/rep : 295/1646/295 causal constraints (skipped 317 transitions) in 38 ms.
[2021-05-14 01:41:30] [INFO ] Added : 160 causal constraints over 33 iterations in 1071 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Finished Parikh walk after 317 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=79 )
FORMULA NoC3x3-PT-3B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1620956491955

--------------------
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
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ 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="NoC3x3-PT-3B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is NoC3x3-PT-3B, 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 r140-tall-162089127600271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-3B.tgz
mv NoC3x3-PT-3B 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 ;