Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572600695.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ResAllocation-PT-R050C002, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572600695
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 748K
-rw-r--r-- 1 mcc users 9.0K Apr 30 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 30 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 30 02:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 02:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 02:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 30 02:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 02:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Apr 30 02:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 9 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 212K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654448392873

Running Version 202205111006
[2022-06-05 16:59:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-05 16:59:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-05 16:59:54] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2022-06-05 16:59:54] [INFO ] Transformed 200 places.
[2022-06-05 16:59:54] [INFO ] Transformed 102 transitions.
[2022-06-05 16:59:54] [INFO ] Parsed PT model containing 200 places and 102 transitions in 228 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 15 resets, run finished after 552 ms. (steps per millisecond=18 ) properties (out of 16) seen :2
FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 14) seen :3
FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :1
FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :1
FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 102 rows 200 cols
[2022-06-05 16:59:56] [INFO ] Computed 100 place invariants in 8 ms
[2022-06-05 16:59:56] [INFO ] [Real]Absence check using 100 positive place invariants in 18 ms returned sat
[2022-06-05 16:59:56] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2022-06-05 16:59:56] [INFO ] [Nat]Absence check using 100 positive place invariants in 13 ms returned sat
[2022-06-05 16:59:57] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2022-06-05 16:59:57] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
[2022-06-05 16:59:57] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2022-06-05 16:59:57] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2022-06-05 16:59:57] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
[2022-06-05 16:59:57] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2022-06-05 16:59:57] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2022-06-05 16:59:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 222 ms
[2022-06-05 16:59:57] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2022-06-05 16:59:57] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2022-06-05 16:59:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2022-06-05 16:59:57] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2022-06-05 16:59:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2022-06-05 16:59:57] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2022-06-05 16:59:57] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2022-06-05 16:59:57] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2022-06-05 16:59:57] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2022-06-05 16:59:57] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-06-05 16:59:57] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-06-05 16:59:57] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2022-06-05 16:59:57] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2022-06-05 16:59:57] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 397 ms
[2022-06-05 16:59:58] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2022-06-05 16:59:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2022-06-05 16:59:58] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-06-05 16:59:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-06-05 16:59:58] [INFO ] After 1431ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 249 ms.
[2022-06-05 16:59:58] [INFO ] After 1806ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 8 different solutions.
FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 3 properties in 10799 ms.
Support contains 136 out of 200 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 200/200 places, 102/102 transitions.
Applied a total of 0 rules in 31 ms. Remains 200 /200 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 102/102 transitions.
Incomplete random walk after 1000000 steps, including 1505 resets, run finished after 24541 ms. (steps per millisecond=40 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 640860 steps, including 157 resets, run timeout after 5001 ms. (steps per millisecond=128 ) properties seen 0
Interrupted Best-First random walk after 814629 steps, including 210 resets, run timeout after 5001 ms. (steps per millisecond=162 ) properties seen 0
Interrupted Best-First random walk after 629147 steps, including 190 resets, run timeout after 5001 ms. (steps per millisecond=125 ) properties seen 0
Interrupted Best-First random walk after 769086 steps, including 196 resets, run timeout after 5001 ms. (steps per millisecond=153 ) properties seen 0
Interrupted Best-First random walk after 645841 steps, including 206 resets, run timeout after 5001 ms. (steps per millisecond=129 ) properties seen 0
Interrupted probabilistic random walk after 24544708 steps, run timeout after 147001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 24544708 steps, saw 4432067 distinct states, run finished after 147005 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 102 rows 200 cols
[2022-06-05 17:03:25] [INFO ] Computed 100 place invariants in 18 ms
[2022-06-05 17:03:25] [INFO ] [Real]Absence check using 100 positive place invariants in 17 ms returned sat
[2022-06-05 17:03:25] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-05 17:03:26] [INFO ] [Nat]Absence check using 100 positive place invariants in 12 ms returned sat
[2022-06-05 17:03:26] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-05 17:03:26] [INFO ] Deduced a trap composed of 4 places in 562 ms of which 1 ms to minimize.
[2022-06-05 17:03:26] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2022-06-05 17:03:26] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-06-05 17:03:27] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2022-06-05 17:03:27] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2022-06-05 17:03:27] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-06-05 17:03:27] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 10 ms to minimize.
[2022-06-05 17:03:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 902 ms
[2022-06-05 17:03:27] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2022-06-05 17:03:27] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2022-06-05 17:03:27] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2022-06-05 17:03:27] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-06-05 17:03:27] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2022-06-05 17:03:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 282 ms
[2022-06-05 17:03:27] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2022-06-05 17:03:27] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2022-06-05 17:03:27] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-06-05 17:03:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-06-05 17:03:27] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2022-06-05 17:03:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 371 ms
[2022-06-05 17:03:27] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-06-05 17:03:28] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-06-05 17:03:28] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-06-05 17:03:28] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2022-06-05 17:03:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 220 ms
[2022-06-05 17:03:28] [INFO ] After 2119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 168 ms.
[2022-06-05 17:03:28] [INFO ] After 2375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 10573 ms.
Support contains 136 out of 200 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 200/200 places, 102/102 transitions.
Applied a total of 0 rules in 6 ms. Remains 200 /200 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 200/200 places, 102/102 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 200/200 places, 102/102 transitions.
Applied a total of 0 rules in 6 ms. Remains 200 /200 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 200 cols
[2022-06-05 17:03:38] [INFO ] Computed 100 place invariants in 1 ms
[2022-06-05 17:03:39] [INFO ] Implicit Places using invariants in 129 ms returned [101, 109, 113, 115, 119, 123, 129, 131, 137, 149, 161, 173, 179, 185, 189, 191, 193, 195]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 132 ms to find 18 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 182/200 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 182/200 places, 102/102 transitions.
Incomplete random walk after 1000000 steps, including 1507 resets, run finished after 29735 ms. (steps per millisecond=33 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 736311 steps, including 172 resets, run timeout after 5001 ms. (steps per millisecond=147 ) properties seen 0
Interrupted Best-First random walk after 831009 steps, including 216 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen 0
Interrupted Best-First random walk after 675412 steps, including 201 resets, run timeout after 5001 ms. (steps per millisecond=135 ) properties seen 0
Interrupted Best-First random walk after 800934 steps, including 204 resets, run timeout after 5001 ms. (steps per millisecond=160 ) properties seen 0
Interrupted Best-First random walk after 734822 steps, including 236 resets, run timeout after 5001 ms. (steps per millisecond=146 ) properties seen 0
Interrupted probabilistic random walk after 26930943 steps, run timeout after 162001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 26930943 steps, saw 4809023 distinct states, run finished after 162001 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 102 rows 182 cols
[2022-06-05 17:07:15] [INFO ] Computed 82 place invariants in 1 ms
[2022-06-05 17:07:15] [INFO ] [Real]Absence check using 82 positive place invariants in 9 ms returned sat
[2022-06-05 17:07:15] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-05 17:07:15] [INFO ] [Nat]Absence check using 82 positive place invariants in 12 ms returned sat
[2022-06-05 17:07:16] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-05 17:07:16] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2022-06-05 17:07:16] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2022-06-05 17:07:16] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2022-06-05 17:07:16] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2022-06-05 17:07:16] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
[2022-06-05 17:07:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 281 ms
[2022-06-05 17:07:16] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2022-06-05 17:07:16] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2022-06-05 17:07:16] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2022-06-05 17:07:16] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2022-06-05 17:07:16] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2022-06-05 17:07:16] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-06-05 17:07:16] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-06-05 17:07:16] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2022-06-05 17:07:16] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-06-05 17:07:17] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
[2022-06-05 17:07:17] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 489 ms
[2022-06-05 17:07:17] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2022-06-05 17:07:17] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2022-06-05 17:07:17] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2022-06-05 17:07:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 151 ms
[2022-06-05 17:07:17] [INFO ] After 1263ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 187 ms.
[2022-06-05 17:07:17] [INFO ] After 1529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 6361 ms.
Support contains 136 out of 182 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 182/182 places, 102/102 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 182 cols
[2022-06-05 17:07:23] [INFO ] Computed 82 place invariants in 2 ms
[2022-06-05 17:07:23] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 102 rows 182 cols
[2022-06-05 17:07:23] [INFO ] Computed 82 place invariants in 6 ms
[2022-06-05 17:07:23] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2022-06-05 17:07:23] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 102 rows 182 cols
[2022-06-05 17:07:23] [INFO ] Computed 82 place invariants in 1 ms
[2022-06-05 17:07:24] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 182/182 places, 102/102 transitions.
Incomplete random walk after 1000000 steps, including 1506 resets, run finished after 23520 ms. (steps per millisecond=42 ) properties (out of 5) seen :0
Interrupted Best-First random walk after 654822 steps, including 161 resets, run timeout after 5001 ms. (steps per millisecond=130 ) properties seen 0
Interrupted Best-First random walk after 870031 steps, including 220 resets, run timeout after 5001 ms. (steps per millisecond=173 ) properties seen 0
Interrupted Best-First random walk after 698922 steps, including 208 resets, run timeout after 5001 ms. (steps per millisecond=139 ) properties seen 0
Interrupted Best-First random walk after 748671 steps, including 191 resets, run timeout after 5001 ms. (steps per millisecond=149 ) properties seen 0
Interrupted Best-First random walk after 691894 steps, including 221 resets, run timeout after 5001 ms. (steps per millisecond=138 ) properties seen 0
Interrupted probabilistic random walk after 25672089 steps, run timeout after 144001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 25672089 steps, saw 4622470 distinct states, run finished after 144005 ms. (steps per millisecond=178 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 102 rows 182 cols
[2022-06-05 17:10:36] [INFO ] Computed 82 place invariants in 1 ms
[2022-06-05 17:10:36] [INFO ] [Real]Absence check using 82 positive place invariants in 9 ms returned sat
[2022-06-05 17:10:36] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-05 17:10:36] [INFO ] [Nat]Absence check using 82 positive place invariants in 12 ms returned sat
[2022-06-05 17:10:36] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-05 17:10:36] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2022-06-05 17:10:37] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2022-06-05 17:10:37] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2022-06-05 17:10:37] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-06-05 17:10:37] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2022-06-05 17:10:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 232 ms
[2022-06-05 17:10:37] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2022-06-05 17:10:37] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2022-06-05 17:10:37] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2022-06-05 17:10:37] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2022-06-05 17:10:37] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2022-06-05 17:10:37] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-06-05 17:10:37] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-06-05 17:10:37] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-06-05 17:10:37] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-06-05 17:10:37] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2022-06-05 17:10:37] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 495 ms
[2022-06-05 17:10:37] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2022-06-05 17:10:37] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2022-06-05 17:10:37] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-06-05 17:10:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 159 ms
[2022-06-05 17:10:37] [INFO ] After 1197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 211 ms.
[2022-06-05 17:10:38] [INFO ] After 1489ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 6432 ms.
Support contains 136 out of 182 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 5 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 182/182 places, 102/102 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
// Phase 1: matrix 102 rows 182 cols
[2022-06-05 17:10:44] [INFO ] Computed 82 place invariants in 1 ms
[2022-06-05 17:10:44] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 102 rows 182 cols
[2022-06-05 17:10:44] [INFO ] Computed 82 place invariants in 6 ms
[2022-06-05 17:10:44] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2022-06-05 17:10:44] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 102 rows 182 cols
[2022-06-05 17:10:44] [INFO ] Computed 82 place invariants in 1 ms
[2022-06-05 17:10:44] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 182/182 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 182 /182 variables (removed 0) and now considering 102/102 (removed 0) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 102 rows 182 cols
[2022-06-05 17:10:44] [INFO ] Computed 82 place invariants in 0 ms
[2022-06-05 17:10:44] [INFO ] [Real]Absence check using 82 positive place invariants in 11 ms returned sat
[2022-06-05 17:10:44] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-06-05 17:10:44] [INFO ] [Nat]Absence check using 82 positive place invariants in 7 ms returned sat
[2022-06-05 17:10:45] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-06-05 17:10:45] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2022-06-05 17:10:45] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2022-06-05 17:10:45] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2022-06-05 17:10:45] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2022-06-05 17:10:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2022-06-05 17:10:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 231 ms
[2022-06-05 17:10:45] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 0 ms to minimize.
[2022-06-05 17:10:45] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-06-05 17:10:45] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2022-06-05 17:10:45] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2022-06-05 17:10:45] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2022-06-05 17:10:45] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-06-05 17:10:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2022-06-05 17:10:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-06-05 17:10:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-06-05 17:10:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-06-05 17:10:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 452 ms
[2022-06-05 17:10:46] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2022-06-05 17:10:46] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2022-06-05 17:10:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-06-05 17:10:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 164 ms
[2022-06-05 17:10:46] [INFO ] After 1249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 207 ms.
[2022-06-05 17:10:46] [INFO ] After 1530ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2022-06-05 17:10:46] [INFO ] Flatten gal took : 44 ms
[2022-06-05 17:10:46] [INFO ] Flatten gal took : 19 ms
[2022-06-05 17:10:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12651734288390155942.gal : 10 ms
[2022-06-05 17:10:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13914034949444896805.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12651734288390155942.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13914034949444896805.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality13914034949444896805.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :8 after 32
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :32 after 448
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :448 after 14336
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :14336 after 1.67772e+07
Detected timeout of ITS tools.
[2022-06-05 17:11:01] [INFO ] Flatten gal took : 30 ms
[2022-06-05 17:11:01] [INFO ] Applying decomposition
[2022-06-05 17:11:01] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15995821630429549952.txt' '-o' '/tmp/graph15995821630429549952.bin' '-w' '/tmp/graph15995821630429549952.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15995821630429549952.bin' '-l' '-1' '-v' '-w' '/tmp/graph15995821630429549952.weights' '-q' '0' '-e' '0.001'
[2022-06-05 17:11:02] [INFO ] Decomposing Gal with order
[2022-06-05 17:11:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-05 17:11:02] [INFO ] Flatten gal took : 78 ms
[2022-06-05 17:11:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-06-05 17:11:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7972898605534843714.gal : 6 ms
[2022-06-05 17:11:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5666714074599714631.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7972898605534843714.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5666714074599714631.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality5666714074599714631.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.92734e+16,0.221747,9732,216,11,13180,56,543,19953,23,92,0
Total reachable state count : 29273397577908224

Verifying 5 reachability properties.
Reachability property ResAllocation-PT-R050C002-ReachabilityFireability-02 does not hold.
No reachable states exhibit your property : ResAllocation-PT-R050C002-ReachabilityFireability-02

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ResAllocation-PT-R050C002-ReachabilityFireability-02,0,0.229333,9996,1,0,13180,56,819,19953,29,92,860
Reachability property ResAllocation-PT-R050C002-ReachabilityFireability-03 does not hold.
No reachable states exhibit your property : ResAllocation-PT-R050C002-ReachabilityFireability-03

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ResAllocation-PT-R050C002-ReachabilityFireability-03,0,0.231356,9996,1,0,13180,56,906,19953,29,92,926
Reachability property ResAllocation-PT-R050C002-ReachabilityFireability-04 does not hold.
No reachable states exhibit your property : ResAllocation-PT-R050C002-ReachabilityFireability-04

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ResAllocation-PT-R050C002-ReachabilityFireability-04,0,0.231735,9996,1,0,13180,56,913,19953,29,92,961
Invariant property ResAllocation-PT-R050C002-ReachabilityFireability-05 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
ResAllocation-PT-R050C002-ReachabilityFireability-05,0,0.235957,9996,1,0,13180,56,999,19953,30,92,1619
Reachability property ResAllocation-PT-R050C002-ReachabilityFireability-13 does not hold.
No reachable states exhibit your property : ResAllocation-PT-R050C002-ReachabilityFireability-13

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ResAllocation-PT-R050C002-ReachabilityFireability-13,0,0.240253,9996,1,0,13180,56,1149,19953,30,92,1899
FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-02 FALSE TECHNIQUES OVER_APPROXIMATION
FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-13 FALSE TECHNIQUES OVER_APPROXIMATION
FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-05 TRUE TECHNIQUES OVER_APPROXIMATION
FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-03 FALSE TECHNIQUES OVER_APPROXIMATION
FORMULA ResAllocation-PT-R050C002-ReachabilityFireability-04 FALSE TECHNIQUES OVER_APPROXIMATION
All properties solved without resorting to model-checking.
Total runtime 668065 ms.

BK_STOP 1654449062596

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="ResAllocation-PT-R050C002"
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 ResAllocation-PT-R050C002, 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 r186-tajo-165281572600695"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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