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.r060-tall-165254772300614.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 itstools
Input is Dekker-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772300614
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 7.7K Apr 30 05:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 30 05:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 30 05:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 30 05:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 30 05:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Apr 30 05:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 30 05:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Apr 30 05:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 247K May 10 09:33 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 Dekker-PT-020-ReachabilityCardinality-00
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-01
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-02
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-03
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-04
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-05
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-06
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-07
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-08
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-09
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-10
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-11
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-12
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-13
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-14
FORMULA_NAME Dekker-PT-020-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654188607689

Running Version 202205111006
[2022-06-02 16:50:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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-02 16:50:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 16:50:09] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2022-06-02 16:50:09] [INFO ] Transformed 100 places.
[2022-06-02 16:50:09] [INFO ] Transformed 440 transitions.
[2022-06-02 16:50:09] [INFO ] Found NUPN structural information;
[2022-06-02 16:50:09] [INFO ] Parsed PT model containing 100 places and 440 transitions in 231 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Dekker-PT-020-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-020-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 268716 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 268716 steps, saw 148831 distinct states, run finished after 3005 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 6 properties.
[2022-06-02 16:50:12] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2022-06-02 16:50:12] [INFO ] Computed 60 place invariants in 10 ms
[2022-06-02 16:50:13] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-06-02 16:50:13] [INFO ] [Nat]Absence check using 40 positive place invariants in 8 ms returned sat
[2022-06-02 16:50:13] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 3 ms returned sat
[2022-06-02 16:50:13] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :1
[2022-06-02 16:50:13] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-02 16:50:13] [INFO ] After 16ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :5 sat :1
[2022-06-02 16:50:13] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
[2022-06-02 16:50:13] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2022-06-02 16:50:13] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2022-06-02 16:50:13] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 2 ms to minimize.
[2022-06-02 16:50:13] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2022-06-02 16:50:13] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2022-06-02 16:50:13] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2022-06-02 16:50:13] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 2 ms to minimize.
[2022-06-02 16:50:13] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-06-02 16:50:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-06-02 16:50:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-06-02 16:50:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2022-06-02 16:50:13] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-06-02 16:50:13] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2022-06-02 16:50:13] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2022-06-02 16:50:13] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2022-06-02 16:50:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2022-06-02 16:50:13] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 561 ms
[2022-06-02 16:50:13] [INFO ] After 590ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-02 16:50:13] [INFO ] After 711ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
FORMULA Dekker-PT-020-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-020-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-020-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-020-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Dekker-PT-020-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 12 out of 100 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 40 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 440/440 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3976 ms. (steps per millisecond=251 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9218370 steps, run timeout after 15001 ms. (steps per millisecond=614 ) properties seen :{}
Probabilistic random walk after 9218370 steps, saw 1044139 distinct states, run finished after 15001 ms. (steps per millisecond=614 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-02 16:50:33] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2022-06-02 16:50:33] [INFO ] Computed 60 place invariants in 14 ms
[2022-06-02 16:50:33] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:50:33] [INFO ] [Nat]Absence check using 40 positive place invariants in 6 ms returned sat
[2022-06-02 16:50:33] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 8 ms returned sat
[2022-06-02 16:50:34] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:50:34] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-02 16:50:34] [INFO ] After 19ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2022-06-02 16:50:34] [INFO ] Trap strengthening procedure interrupted after too many repetitions 600 ms
[2022-06-02 16:50:34] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 600 ms
[2022-06-02 16:50:34] [INFO ] After 629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-02 16:50:34] [INFO ] After 721ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 12 out of 100 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 31 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 100/100 places, 440/440 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 100/100 places, 440/440 transitions.
Applied a total of 0 rules in 18 ms. Remains 100 /100 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-06-02 16:50:34] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 100 cols
[2022-06-02 16:50:34] [INFO ] Computed 60 place invariants in 2 ms
[2022-06-02 16:50:34] [INFO ] Implicit Places using invariants in 160 ms returned [40, 43, 46, 49, 52, 55, 58, 61, 64, 70, 73, 85, 88, 91, 94, 97]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 163 ms to find 16 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 84/100 places, 440/440 transitions.
Applied a total of 0 rules in 13 ms. Remains 84 /84 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 84/100 places, 440/440 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4058 ms. (steps per millisecond=246 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1122 ms. (steps per millisecond=891 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9272361 steps, run timeout after 15001 ms. (steps per millisecond=618 ) properties seen :{}
Probabilistic random walk after 9272361 steps, saw 1047898 distinct states, run finished after 15001 ms. (steps per millisecond=618 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-02 16:50:55] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 84 cols
[2022-06-02 16:50:55] [INFO ] Computed 44 place invariants in 4 ms
[2022-06-02 16:50:55] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:50:55] [INFO ] [Nat]Absence check using 40 positive place invariants in 4 ms returned sat
[2022-06-02 16:50:55] [INFO ] [Nat]Absence check using 40 positive and 4 generalized place invariants in 0 ms returned sat
[2022-06-02 16:50:55] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:50:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-02 16:50:55] [INFO ] After 16ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:50:55] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2022-06-02 16:50:55] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2022-06-02 16:50:55] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-06-02 16:50:55] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2022-06-02 16:50:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-06-02 16:50:55] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2022-06-02 16:50:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-06-02 16:50:55] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2022-06-02 16:50:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-06-02 16:50:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-06-02 16:50:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-06-02 16:50:55] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2022-06-02 16:50:55] [INFO ] Trap strengthening procedure interrupted after too many repetitions 432 ms
[2022-06-02 16:50:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 432 ms
[2022-06-02 16:50:55] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-02 16:50:55] [INFO ] After 542ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 12 out of 84 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 440/440 transitions.
Applied a total of 0 rules in 18 ms. Remains 84 /84 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 440/440 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 440/440 transitions.
Applied a total of 0 rules in 11 ms. Remains 84 /84 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-06-02 16:50:55] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 84 cols
[2022-06-02 16:50:55] [INFO ] Computed 44 place invariants in 2 ms
[2022-06-02 16:50:55] [INFO ] Implicit Places using invariants in 109 ms returned []
[2022-06-02 16:50:55] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 84 cols
[2022-06-02 16:50:55] [INFO ] Computed 44 place invariants in 1 ms
[2022-06-02 16:50:55] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-02 16:50:55] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2022-06-02 16:50:55] [INFO ] Redundant transitions in 31 ms returned []
[2022-06-02 16:50:55] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 84 cols
[2022-06-02 16:50:55] [INFO ] Computed 44 place invariants in 0 ms
[2022-06-02 16:50:56] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 440/440 transitions.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4093 ms. (steps per millisecond=244 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1126 ms. (steps per millisecond=888 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9296805 steps, run timeout after 15001 ms. (steps per millisecond=619 ) properties seen :{}
Probabilistic random walk after 9296805 steps, saw 1047903 distinct states, run finished after 15001 ms. (steps per millisecond=619 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-02 16:51:16] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 84 cols
[2022-06-02 16:51:16] [INFO ] Computed 44 place invariants in 1 ms
[2022-06-02 16:51:16] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:51:16] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2022-06-02 16:51:16] [INFO ] [Nat]Absence check using 40 positive and 4 generalized place invariants in 1 ms returned sat
[2022-06-02 16:51:16] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:51:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-02 16:51:16] [INFO ] After 18ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:51:16] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2022-06-02 16:51:16] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2022-06-02 16:51:16] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-06-02 16:51:16] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2022-06-02 16:51:16] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2022-06-02 16:51:16] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2022-06-02 16:51:16] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2022-06-02 16:51:16] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-06-02 16:51:16] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-06-02 16:51:16] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2022-06-02 16:51:16] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2022-06-02 16:51:16] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2022-06-02 16:51:16] [INFO ] Trap strengthening procedure interrupted after too many repetitions 412 ms
[2022-06-02 16:51:16] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 412 ms
[2022-06-02 16:51:16] [INFO ] After 441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-06-02 16:51:16] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 12 out of 84 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 440/440 transitions.
Applied a total of 0 rules in 12 ms. Remains 84 /84 variables (removed 0) and now considering 440/440 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 440/440 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 440/440 transitions.
Applied a total of 0 rules in 9 ms. Remains 84 /84 variables (removed 0) and now considering 440/440 (removed 0) transitions.
[2022-06-02 16:51:16] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 84 cols
[2022-06-02 16:51:16] [INFO ] Computed 44 place invariants in 1 ms
[2022-06-02 16:51:17] [INFO ] Implicit Places using invariants in 88 ms returned []
[2022-06-02 16:51:17] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 84 cols
[2022-06-02 16:51:17] [INFO ] Computed 44 place invariants in 1 ms
[2022-06-02 16:51:17] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-06-02 16:51:17] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2022-06-02 16:51:17] [INFO ] Redundant transitions in 3 ms returned []
[2022-06-02 16:51:17] [INFO ] Flow matrix only has 80 transitions (discarded 360 similar events)
// Phase 1: matrix 80 rows 84 cols
[2022-06-02 16:51:17] [INFO ] Computed 44 place invariants in 2 ms
[2022-06-02 16:51:17] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 440/440 transitions.
Graph (complete) has 140 edges and 84 vertex of which 36 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.3 ms
Discarding 48 places :
Also discarding 264 output transitions
Drop transitions removed 264 transitions
Ensure Unique test removed 4 places
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 148 rules applied. Total rules applied 149 place count 32 transition count 32
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 152 place count 30 transition count 31
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 153 place count 30 transition count 30
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 156 place count 30 transition count 27
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 165 place count 24 transition count 24
Applied a total of 165 rules in 13 ms. Remains 24 /84 variables (removed 60) and now considering 24/440 (removed 416) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 24 rows 24 cols
[2022-06-02 16:51:17] [INFO ] Computed 12 place invariants in 0 ms
[2022-06-02 16:51:17] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 16:51:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 1 ms returned sat
[2022-06-02 16:51:17] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 16:51:17] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-02 16:51:17] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-02 16:51:17] [INFO ] Flatten gal took : 19 ms
[2022-06-02 16:51:17] [INFO ] Flatten gal took : 4 ms
[2022-06-02 16:51:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16128622492195437002.gal : 4 ms
[2022-06-02 16:51:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8494440727775130511.prop : 0 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/ReachabilityCardinality16128622492195437002.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8494440727775130511.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...320
Loading property file /tmp/ReachabilityCardinality8494440727775130511.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 216
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,1296,0.011385,3440,2,41,7,197,7,0,143,102,0
Total reachable state count : 1296

Verifying 1 reachability properties.
Reachability property Dekker-PT-020-ReachabilityCardinality-03 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-020-ReachabilityCardinality-03,48,0.012551,3864,2,32,7,223,7,0,164,102,0
[2022-06-02 16:51:17] [INFO ] Flatten gal took : 48 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15069765117337084099
[2022-06-02 16:51:17] [INFO ] Computing symmetric may disable matrix : 440 transitions.
[2022-06-02 16:51:17] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:51:17] [INFO ] Computing symmetric may enable matrix : 440 transitions.
[2022-06-02 16:51:17] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:51:17] [INFO ] Applying decomposition
[2022-06-02 16:51:17] [INFO ] Flatten gal took : 68 ms
[2022-06-02 16:51:17] [INFO ] Flatten gal took : 66 ms
[2022-06-02 16:51:17] [INFO ] Input system was already deterministic with 440 transitions.
[2022-06-02 16:51:17] [INFO ] Computing Do-Not-Accords matrix : 440 transitions.
[2022-06-02 16:51:17] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 16:51:17] [INFO ] Built C files in 215ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15069765117337084099
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/graph16001006609493101024.txt' '-o' '/tmp/graph16001006609493101024.bin' '-w' '/tmp/graph16001006609493101024.weights'
Running compilation step : cd /tmp/ltsmin15069765117337084099;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16001006609493101024.bin' '-l' '-1' '-v' '-w' '/tmp/graph16001006609493101024.weights' '-q' '0' '-e' '0.001'
[2022-06-02 16:51:18] [INFO ] Decomposing Gal with order
[2022-06-02 16:51:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 16:51:18] [INFO ] Removed a total of 1118 redundant transitions.
[2022-06-02 16:51:18] [INFO ] Ran tautology test, simplified 0 / 1 in 319 ms.
[2022-06-02 16:51:18] [INFO ] Flatten gal took : 87 ms
[2022-06-02 16:51:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2022-06-02 16:51:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11377302094327879857.gal : 4 ms
[2022-06-02 16:51:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11021885801908849225.prop : 0 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/ReachabilityCardinality11377302094327879857.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11021885801908849225.prop' '--nowitness'
[2022-06-02 16:51:18] [INFO ] BMC solution for property Dekker-PT-020-ReachabilityCardinality-03(UNSAT) depth K=0 took 8 ms
[2022-06-02 16:51:18] [INFO ] BMC solution for property Dekker-PT-020-ReachabilityCardinality-03(UNSAT) depth K=1 took 4 ms

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...300
Loading property file /tmp/ReachabilityCardinality11021885801908849225.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 1.04862e+06
Reachability property Dekker-PT-020-ReachabilityCardinality-03 is true.
FORMULA Dekker-PT-020-ReachabilityCardinality-03 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 9 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.81805e+06,0.039832,5728,63,24,644,274,562,517,40,337,0
Total reachable state count : 2818048

Verifying 1 reachability properties.
Reachability property Dekker-PT-020-ReachabilityCardinality-03 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Dekker-PT-020-ReachabilityCardinality-03,2048,0.041121,5728,36,17,644,274,616,517,57,337,0
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
ITS tools runner thread asked to quit. Dying gracefully.
[2022-06-02 16:51:18] [WARNING] Interrupting SMT solver.
[2022-06-02 16:51:18] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 16:51:18] [WARNING] Unexpected error occurred while running SMT. Was verifying Dekker-PT-020-ReachabilityCardinality-03 SMT depth 2
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
[2022-06-02 16:51:18] [INFO ] During BMC, SMT solver timed out at depth 2
[2022-06-02 16:51:18] [INFO ] BMC solving timed out (3600000 secs) at depth 2
[2022-06-02 16:51:18] [WARNING] Script execution failed on command (declare-fun s () (Array Int (Array Int Int))) with error
[2022-06-02 16:51:18] [WARNING] Script execution failed on command (define-fun _enabledsrc__0 ((src (Array Int Int))) Bool (and (and (>= (select src 1) 1) (>= (select src 3) 1)) (>= (select src 40) 1))) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Exception in thread "Thread-7" java.lang.RuntimeException: Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.init(NextBMCSolver.java:93)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:60)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:283)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-02 16:51:18] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
Total runtime 69436 ms.

BK_STOP 1654188678336

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="Dekker-PT-020"
export BK_EXAMINATION="ReachabilityCardinality"
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 Dekker-PT-020, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r060-tall-165254772300614"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-020.tgz
mv Dekker-PT-020 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;