Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 44K Apr 30 09:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 212K Apr 30 09:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 34K Apr 30 09:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 169K Apr 30 09:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 19K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 63K Apr 30 09:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 327K Apr 30 09:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 74K Apr 30 09:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 359K Apr 30 09:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 143K 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 Peterson-PT-3-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-3-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655068563014

Running Version 0
[2022-06-12 21:16:04] [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-12 21:16:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:16:04] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2022-06-12 21:16:04] [INFO ] Transformed 244 places.
[2022-06-12 21:16:04] [INFO ] Transformed 332 transitions.
[2022-06-12 21:16:04] [INFO ] Found NUPN structural information;
[2022-06-12 21:16:04] [INFO ] Completing missing partition info from NUPN : creating a component with [TestAlone_1_2_3, TestAlone_2_2_3]
[2022-06-12 21:16:04] [INFO ] Parsed PT model containing 244 places and 332 transitions in 180 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-3-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 15) seen :5
FORMULA Peterson-PT-3-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :1
FORMULA Peterson-PT-3-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2022-06-12 21:16:05] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2022-06-12 21:16:05] [INFO ] Computed 15 place invariants in 19 ms
[2022-06-12 21:16:06] [INFO ] [Real]Absence check using 11 positive place invariants in 9 ms returned sat
[2022-06-12 21:16:06] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-12 21:16:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:06] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2022-06-12 21:16:06] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-12 21:16:06] [INFO ] [Real]Added 66 Read/Feed constraints in 10 ms returned sat
[2022-06-12 21:16:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2022-06-12 21:16:06] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2022-06-12 21:16:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:06] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2022-06-12 21:16:06] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2022-06-12 21:16:06] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 3 ms to minimize.
[2022-06-12 21:16:06] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2022-06-12 21:16:06] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2022-06-12 21:16:06] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 0 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Deduced a trap composed of 41 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1263 ms
[2022-06-12 21:16:07] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 23 ms.
[2022-06-12 21:16:09] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:16:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2022-06-12 21:16:09] [INFO ] Added : 255 causal constraints over 51 iterations in 1480 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 21:16:09] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned sat
[2022-06-12 21:16:09] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-12 21:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:09] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2022-06-12 21:16:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:09] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2022-06-12 21:16:09] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 12 ms returned sat
[2022-06-12 21:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:09] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2022-06-12 21:16:09] [INFO ] [Nat]Added 66 Read/Feed constraints in 8 ms returned sat
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 50 places in 37 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 47 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 4 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 53 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 52 places in 34 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 78 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 52 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 69 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 84 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 69 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 75 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 61 places in 30 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 61 places in 37 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 60 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 79 places in 39 ms of which 1 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 50 places in 35 ms of which 1 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 65 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 70 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 56 places in 34 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 90 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 57 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 68 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 69 places in 33 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 74 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 86 places in 40 ms of which 1 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 56 trap constraints in 4283 ms
[2022-06-12 21:16:14] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2022-06-12 21:16:14] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2022-06-12 21:16:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:14] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2022-06-12 21:16:14] [INFO ] [Real]Added 66 Read/Feed constraints in 11 ms returned sat
[2022-06-12 21:16:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:14] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-06-12 21:16:14] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2022-06-12 21:16:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:14] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2022-06-12 21:16:14] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 1 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 8 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 705 ms
[2022-06-12 21:16:15] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 21 ms.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 0 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 0 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 256 ms
[2022-06-12 21:16:17] [INFO ] Added : 283 causal constraints over 57 iterations in 1648 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
[2022-06-12 21:16:17] [INFO ] [Real]Absence check using 11 positive place invariants in 15 ms returned sat
[2022-06-12 21:16:17] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-12 21:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:17] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2022-06-12 21:16:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2022-06-12 21:16:17] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 17 ms returned unsat
[2022-06-12 21:16:17] [INFO ] [Real]Absence check using 11 positive place invariants in 27 ms returned sat
[2022-06-12 21:16:17] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-12 21:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:17] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2022-06-12 21:16:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 17 ms returned sat
[2022-06-12 21:16:17] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-12 21:16:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:18] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2022-06-12 21:16:18] [INFO ] [Nat]Added 66 Read/Feed constraints in 11 ms returned sat
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 253 ms
[2022-06-12 21:16:18] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 16 ms.
[2022-06-12 21:16:19] [INFO ] Added : 282 causal constraints over 57 iterations in 1391 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 21:16:19] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-06-12 21:16:19] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2022-06-12 21:16:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:19] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2022-06-12 21:16:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:19] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-06-12 21:16:19] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2022-06-12 21:16:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:20] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2022-06-12 21:16:20] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2022-06-12 21:16:20] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 18 ms.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 0 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 0 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 970 ms
[2022-06-12 21:16:22] [INFO ] Added : 254 causal constraints over 52 iterations in 2187 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 21:16:22] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2022-06-12 21:16:22] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
[2022-06-12 21:16:22] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2022-06-12 21:16:22] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2022-06-12 21:16:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:22] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-06-12 21:16:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-06-12 21:16:22] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2022-06-12 21:16:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:22] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-06-12 21:16:22] [INFO ] [Nat]Added 66 Read/Feed constraints in 8 ms returned sat
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 41 places in 33 ms of which 0 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 31 places in 26 ms of which 1 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 397 ms
[2022-06-12 21:16:23] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 14 ms.
[2022-06-12 21:16:24] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2022-06-12 21:16:24] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:16:24] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2022-06-12 21:16:24] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 0 ms to minimize.
[2022-06-12 21:16:24] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2022-06-12 21:16:24] [INFO ] Deduced a trap composed of 38 places in 31 ms of which 0 ms to minimize.
[2022-06-12 21:16:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 401 ms
[2022-06-12 21:16:24] [INFO ] Added : 254 causal constraints over 52 iterations in 1572 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
FORMULA Peterson-PT-3-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-3-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 5 different solutions.
Incomplete Parikh walk after 41200 steps, including 820 resets, run finished after 155 ms. (steps per millisecond=265 ) properties (out of 5) seen :2 could not realise parikh vector
FORMULA Peterson-PT-3-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-3-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 90000 steps, including 911 resets, run finished after 237 ms. (steps per millisecond=379 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 82400 steps, including 995 resets, run finished after 216 ms. (steps per millisecond=381 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 64400 steps, including 970 resets, run finished after 185 ms. (steps per millisecond=348 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 72200 steps, including 910 resets, run finished after 183 ms. (steps per millisecond=394 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 88 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 244 transition count 293
Reduce places removed 39 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 42 rules applied. Total rules applied 81 place count 205 transition count 290
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 84 place count 202 transition count 290
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 84 place count 202 transition count 246
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 172 place count 158 transition count 246
Applied a total of 172 rules in 45 ms. Remains 158 /244 variables (removed 86) and now considering 246/332 (removed 86) transitions.
Finished structural reductions, in 1 iterations. Remains : 158/244 places, 246/332 transitions.
[2022-06-12 21:16:25] [INFO ] Flatten gal took : 47 ms
[2022-06-12 21:16:25] [INFO ] Flatten gal took : 17 ms
[2022-06-12 21:16:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14844024244599699675.gal : 10 ms
[2022-06-12 21:16:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12494894640231397218.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/ReachabilityCardinality14844024244599699675.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12494894640231397218.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/ReachabilityCardinality14844024244599699675.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12494894640231397218.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality12494894640231397218.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :5 after 19
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :19 after 24
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :24 after 39
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :39 after 62
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :62 after 187
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :187 after 426
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :426 after 1373
Invariant property Peterson-PT-3-ReachabilityFireability-14 does not hold.
FORMULA Peterson-PT-3-ReachabilityFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property Peterson-PT-3-ReachabilityFireability-02 is true.
FORMULA Peterson-PT-3-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1373 after 5136
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :5136 after 7926
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :7926 after 14494
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :14494 after 32187
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :32187 after 84180
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :84180 after 198232
Detected timeout of ITS tools.
[2022-06-12 21:16:40] [INFO ] Flatten gal took : 15 ms
[2022-06-12 21:16:40] [INFO ] Applying decomposition
[2022-06-12 21:16:40] [INFO ] Flatten gal took : 13 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/graph3972549256574107247.txt, -o, /tmp/graph3972549256574107247.bin, -w, /tmp/graph3972549256574107247.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/graph3972549256574107247.bin, -l, -1, -v, -w, /tmp/graph3972549256574107247.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:16:41] [INFO ] Decomposing Gal with order
[2022-06-12 21:16:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:16:41] [INFO ] Removed a total of 207 redundant transitions.
[2022-06-12 21:16:41] [INFO ] Flatten gal took : 48 ms
[2022-06-12 21:16:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 65 labels/synchronizations in 13 ms.
[2022-06-12 21:16:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3909064031431926594.gal : 52 ms
[2022-06-12 21:16:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14174857940040108635.prop : 2 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/ReachabilityCardinality3909064031431926594.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14174857940040108635.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/ReachabilityCardinality3909064031431926594.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14174857940040108635.prop --nowitness
Loading property file /tmp/ReachabilityCardinality14174857940040108635.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 55
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :55 after 313
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :313 after 2022
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2022 after 44742
Reachability property Peterson-PT-3-ReachabilityFireability-10 is true.
FORMULA Peterson-PT-3-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,351490,2.42773,57408,1784,331,84397,5846,727,210574,136,31610,0
Total reachable state count : 351490

Verifying 1 reachability properties.
Reachability property Peterson-PT-3-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
Peterson-PT-3-ReachabilityFireability-10,1,2.5612,57408,69,31,84397,5846,1030,210574,176,31610,0
All properties solved without resorting to model-checking.

BK_STOP 1655068604754

--------------------
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="Peterson-PT-3"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is Peterson-PT-3, 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 r179-tall-165277026700024"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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