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.r064-tall-162038396800143.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 DES-PT-50b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038396800143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 23 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 23 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 127K 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 DES-PT-50b-ReachabilityFireability-00
FORMULA_NAME DES-PT-50b-ReachabilityFireability-01
FORMULA_NAME DES-PT-50b-ReachabilityFireability-02
FORMULA_NAME DES-PT-50b-ReachabilityFireability-03
FORMULA_NAME DES-PT-50b-ReachabilityFireability-04
FORMULA_NAME DES-PT-50b-ReachabilityFireability-05
FORMULA_NAME DES-PT-50b-ReachabilityFireability-06
FORMULA_NAME DES-PT-50b-ReachabilityFireability-07
FORMULA_NAME DES-PT-50b-ReachabilityFireability-08
FORMULA_NAME DES-PT-50b-ReachabilityFireability-09
FORMULA_NAME DES-PT-50b-ReachabilityFireability-10
FORMULA_NAME DES-PT-50b-ReachabilityFireability-11
FORMULA_NAME DES-PT-50b-ReachabilityFireability-12
FORMULA_NAME DES-PT-50b-ReachabilityFireability-13
FORMULA_NAME DES-PT-50b-ReachabilityFireability-14
FORMULA_NAME DES-PT-50b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620482591535

Running Version 0
[2021-05-08 14:03:13] [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-08 14:03:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 14:03:13] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2021-05-08 14:03:13] [INFO ] Transformed 479 places.
[2021-05-08 14:03:13] [INFO ] Transformed 430 transitions.
[2021-05-08 14:03:13] [INFO ] Found NUPN structural information;
[2021-05-08 14:03:13] [INFO ] Parsed PT model containing 479 places and 430 transitions in 127 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 81 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :6
FORMULA DES-PT-50b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-50b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 430 rows 479 cols
[2021-05-08 14:03:13] [INFO ] Computed 65 place invariants in 52 ms
[2021-05-08 14:03:13] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned sat
[2021-05-08 14:03:13] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 14:03:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:03:14] [INFO ] [Real]Absence check using state equation in 263 ms returned sat
[2021-05-08 14:03:14] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 4 ms to minimize.
[2021-05-08 14:03:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 248 ms
[2021-05-08 14:03:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:03:14] [INFO ] [Nat]Absence check using 40 positive place invariants in 23 ms returned sat
[2021-05-08 14:03:14] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 14:03:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:03:15] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2021-05-08 14:03:15] [INFO ] Deduced a trap composed of 7 places in 170 ms of which 1 ms to minimize.
[2021-05-08 14:03:15] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 4 ms to minimize.
[2021-05-08 14:03:15] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 2 ms to minimize.
[2021-05-08 14:03:16] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 1 ms to minimize.
[2021-05-08 14:03:16] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 0 ms to minimize.
[2021-05-08 14:03:16] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 0 ms to minimize.
[2021-05-08 14:03:16] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
[2021-05-08 14:03:16] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 0 ms to minimize.
[2021-05-08 14:03:16] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1274 ms
[2021-05-08 14:03:16] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 36 ms.
[2021-05-08 14:03:18] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 0 ms to minimize.
[2021-05-08 14:03:18] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2021-05-08 14:03:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2021-05-08 14:03:18] [INFO ] Added : 285 causal constraints over 58 iterations in 2431 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 14:03:19] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned sat
[2021-05-08 14:03:19] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 18 ms returned sat
[2021-05-08 14:03:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:03:19] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2021-05-08 14:03:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:03:19] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2021-05-08 14:03:19] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 24 ms returned sat
[2021-05-08 14:03:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:03:19] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2021-05-08 14:03:20] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2021-05-08 14:03:20] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2021-05-08 14:03:20] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2021-05-08 14:03:20] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2021-05-08 14:03:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 433 ms
[2021-05-08 14:03:20] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-08 14:03:23] [INFO ] Added : 290 causal constraints over 58 iterations in 2770 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-08 14:03:23] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2021-05-08 14:03:23] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 18 ms returned sat
[2021-05-08 14:03:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:03:23] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2021-05-08 14:03:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:03:23] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2021-05-08 14:03:23] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 313 ms returned sat
[2021-05-08 14:03:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:03:24] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2021-05-08 14:03:24] [INFO ] Deduced a trap composed of 32 places in 127 ms of which 1 ms to minimize.
[2021-05-08 14:03:24] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 0 ms to minimize.
[2021-05-08 14:03:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 269 ms
[2021-05-08 14:03:24] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 28 ms.
[2021-05-08 14:03:26] [INFO ] Added : 332 causal constraints over 67 iterations in 2092 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 14:03:26] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2021-05-08 14:03:26] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 14:03:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:03:26] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2021-05-08 14:03:27] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 1 ms to minimize.
[2021-05-08 14:03:27] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 1 ms to minimize.
[2021-05-08 14:03:27] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2021-05-08 14:03:27] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2021-05-08 14:03:27] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 0 ms to minimize.
[2021-05-08 14:03:27] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2021-05-08 14:03:27] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2021-05-08 14:03:27] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2021-05-08 14:03:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1042 ms
[2021-05-08 14:03:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:03:28] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2021-05-08 14:03:28] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 138 ms returned sat
[2021-05-08 14:03:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:03:28] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2021-05-08 14:03:28] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2021-05-08 14:03:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2021-05-08 14:03:28] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-08 14:03:30] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2021-05-08 14:03:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2021-05-08 14:03:31] [INFO ] Added : 292 causal constraints over 60 iterations in 2599 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2021-05-08 14:03:31] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2021-05-08 14:03:31] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 15 ms returned sat
[2021-05-08 14:03:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:03:31] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2021-05-08 14:03:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:03:31] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2021-05-08 14:03:31] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 20 ms returned sat
[2021-05-08 14:03:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:03:31] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2021-05-08 14:03:31] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 0 ms to minimize.
[2021-05-08 14:03:32] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2021-05-08 14:03:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 223 ms
[2021-05-08 14:03:32] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-08 14:03:34] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2021-05-08 14:03:34] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 9 ms to minimize.
[2021-05-08 14:03:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 291 ms
[2021-05-08 14:03:34] [INFO ] Added : 319 causal constraints over 65 iterations in 2746 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 14:03:34] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2021-05-08 14:03:34] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 10 ms returned unsat
[2021-05-08 14:03:35] [INFO ] [Real]Absence check using 40 positive place invariants in 14 ms returned sat
[2021-05-08 14:03:35] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 25 ms returned sat
[2021-05-08 14:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:03:35] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2021-05-08 14:03:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:03:35] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2021-05-08 14:03:35] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 19 ms returned sat
[2021-05-08 14:03:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:03:35] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2021-05-08 14:03:36] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2021-05-08 14:03:36] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 1 ms to minimize.
[2021-05-08 14:03:36] [INFO ] Deduced a trap composed of 18 places in 109 ms of which 0 ms to minimize.
[2021-05-08 14:03:36] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
[2021-05-08 14:03:36] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 1 ms to minimize.
[2021-05-08 14:03:36] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2021-05-08 14:03:36] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 0 ms to minimize.
[2021-05-08 14:03:36] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 0 ms to minimize.
[2021-05-08 14:03:37] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 1 ms to minimize.
[2021-05-08 14:03:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1118 ms
[2021-05-08 14:03:37] [INFO ] Computed and/alt/rep : 424/923/424 causal constraints (skipped 5 transitions) in 20 ms.
[2021-05-08 14:03:39] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2021-05-08 14:03:39] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 1 ms to minimize.
[2021-05-08 14:03:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 295 ms
[2021-05-08 14:03:39] [INFO ] Added : 274 causal constraints over 56 iterations in 2799 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2021-05-08 14:03:39] [INFO ] [Real]Absence check using 40 positive place invariants in 15 ms returned sat
[2021-05-08 14:03:39] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 22 ms returned sat
[2021-05-08 14:03:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:03:40] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2021-05-08 14:03:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:03:40] [INFO ] [Nat]Absence check using 40 positive place invariants in 14 ms returned sat
[2021-05-08 14:03:40] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 22 ms returned sat
[2021-05-08 14:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:03:45] [INFO ] [Nat]Absence check using state equation in 4906 ms returned unknown
[2021-05-08 14:03:45] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2021-05-08 14:03:45] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 10 ms returned unsat
[2021-05-08 14:03:45] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2021-05-08 14:03:45] [INFO ] [Real]Absence check using 40 positive and 25 generalized place invariants in 17 ms returned sat
[2021-05-08 14:03:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:03:45] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2021-05-08 14:03:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:03:45] [INFO ] [Nat]Absence check using 40 positive place invariants in 10 ms returned unsat
FORMULA DES-PT-50b-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50b-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-50b-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 7 different solutions.
Incomplete Parikh walk after 338700 steps, including 3413 resets, run finished after 1239 ms. (steps per millisecond=273 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 354200 steps, including 3322 resets, run finished after 1284 ms. (steps per millisecond=275 ) properties (out of 7) seen :1 could not realise parikh vector
FORMULA DES-PT-50b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 494800 steps, including 4973 resets, run finished after 1635 ms. (steps per millisecond=302 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 273200 steps, including 2776 resets, run finished after 871 ms. (steps per millisecond=313 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 483300 steps, including 4337 resets, run finished after 1538 ms. (steps per millisecond=314 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 317800 steps, including 3192 resets, run finished after 1002 ms. (steps per millisecond=317 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 20 out of 479 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 479/479 places, 430/430 transitions.
Graph (complete) has 1098 edges and 479 vertex of which 470 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.24 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 470 transition count 408
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 38 place count 452 transition count 408
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 38 place count 452 transition count 401
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 52 place count 445 transition count 401
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 69 place count 428 transition count 384
Iterating global reduction 2 with 17 rules applied. Total rules applied 86 place count 428 transition count 384
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 86 place count 428 transition count 383
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 88 place count 427 transition count 383
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 102 place count 413 transition count 369
Iterating global reduction 2 with 14 rules applied. Total rules applied 116 place count 413 transition count 369
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 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 2 with 14 rules applied. Total rules applied 130 place count 413 transition count 355
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 133 place count 411 transition count 354
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 133 place count 411 transition count 352
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 137 place count 409 transition count 352
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 283 place count 336 transition count 279
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 287 place count 334 transition count 281
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 289 place count 334 transition count 279
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 291 place count 332 transition count 279
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 292 place count 332 transition count 278
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 293 place count 331 transition count 277
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 294 place count 330 transition count 277
Applied a total of 294 rules in 252 ms. Remains 330 /479 variables (removed 149) and now considering 277/430 (removed 153) transitions.
Finished structural reductions, in 1 iterations. Remains : 330/479 places, 277/430 transitions.
[2021-05-08 14:03:54] [INFO ] Flatten gal took : 119 ms
[2021-05-08 14:03:54] [INFO ] Flatten gal took : 27 ms
[2021-05-08 14:03:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2820615417065833815.gal : 14 ms
[2021-05-08 14:03:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7139084265856147240.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/ReachabilityCardinality2820615417065833815.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7139084265856147240.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/ReachabilityCardinality2820615417065833815.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7139084265856147240.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7139084265856147240.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :13 after 15
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :15 after 38
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :38 after 57
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :57 after 201
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :201 after 2637
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :2637 after 13335
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :13335 after 515214
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :515214 after 965284
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :965284 after 9.4594e+06
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :1.07295e+10 after 1.10907e+10
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :1.10907e+10 after 1.38247e+10
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :2.48872e+11 after 2.52654e+11
Detected timeout of ITS tools.
[2021-05-08 14:04:09] [INFO ] Flatten gal took : 25 ms
[2021-05-08 14:04:09] [INFO ] Applying decomposition
[2021-05-08 14:04:09] [INFO ] Flatten gal took : 23 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/graph9945426138772965753.txt, -o, /tmp/graph9945426138772965753.bin, -w, /tmp/graph9945426138772965753.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/graph9945426138772965753.bin, -l, -1, -v, -w, /tmp/graph9945426138772965753.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 14:04:09] [INFO ] Decomposing Gal with order
[2021-05-08 14:04:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 14:04:09] [INFO ] Removed a total of 51 redundant transitions.
[2021-05-08 14:04:09] [INFO ] Flatten gal took : 53 ms
[2021-05-08 14:04:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 9 ms.
[2021-05-08 14:04:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13080379834095850952.gal : 6 ms
[2021-05-08 14:04:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15632898799630944816.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/ReachabilityCardinality13080379834095850952.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15632898799630944816.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/ReachabilityCardinality13080379834095850952.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15632898799630944816.prop --nowitness
Loading property file /tmp/ReachabilityCardinality15632898799630944816.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :9 after 9
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :9 after 49
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :49 after 1038
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :196433 after 3.83101e+09
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :3.83101e+09 after 1.06568e+10
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1.06568e+10 after 1.75988e+10
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1.75988e+10 after 2.71433e+10
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :2.71433e+10 after 4.24125e+10
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :4.24125e+10 after 6.79245e+10
Reachability property DES-PT-50b-ReachabilityFireability-10 is true.
FORMULA DES-PT-50b-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-50b-ReachabilityFireability-07 is true.
FORMULA DES-PT-50b-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-50b-ReachabilityFireability-02 is true.
FORMULA DES-PT-50b-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :5.50002e+14 after 5.75287e+14
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.20135e+15,3.82416,96684,5020,6674,183089,43163,412,160434,484,288295,0
Total reachable state count : 1201349713847784

Verifying 6 reachability properties.
Reachability property DES-PT-50b-ReachabilityFireability-02 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
DES-PT-50b-ReachabilityFireability-02,2.80115e+12,3.83197,96948,636,763,183089,43163,420,160434,491,288295,0
Invariant property DES-PT-50b-ReachabilityFireability-06 does not hold.
FORMULA DES-PT-50b-ReachabilityFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-50b-ReachabilityFireability-06,4.24042e+12,3.83519,96948,821,1106,183089,43163,426,160434,495,288295,0
Reachability property DES-PT-50b-ReachabilityFireability-07 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
DES-PT-50b-ReachabilityFireability-07,4.24042e+12,3.83656,96948,821,835,183089,43163,433,160434,499,288295,0
Invariant property DES-PT-50b-ReachabilityFireability-08 does not hold.
FORMULA DES-PT-50b-ReachabilityFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-50b-ReachabilityFireability-08,240,3.85768,96948,70,230,183089,43163,445,160434,505,288295,2146
Reachability property DES-PT-50b-ReachabilityFireability-10 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
DES-PT-50b-ReachabilityFireability-10,1.22472e+07,3.86268,96948,86,207,183089,43163,479,160434,519,288295,2678
Reachability property DES-PT-50b-ReachabilityFireability-11 is true.
FORMULA DES-PT-50b-ReachabilityFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-50b-ReachabilityFireability-11,14400,3.87977,96948,79,252,183089,43163,494,160434,524,288295,4101
All properties solved without resorting to model-checking.

BK_STOP 1620482654360

--------------------
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="DES-PT-50b"
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 DES-PT-50b, 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 r064-tall-162038396800143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b 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 ;