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.r042-smll-165252095700398.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 DES-PT-00b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095700398
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 5.6K Apr 29 15:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 29 15:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 15:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 29 15:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 29 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 29 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 29 15:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:21 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 66K 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 DES-PT-00b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-00b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654183083807

Running Version 202205111006
[2022-06-02 15:18:06] [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 15:18:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 15:18:06] [INFO ] Load time of PNML (sax parser for PT used): 199 ms
[2022-06-02 15:18:06] [INFO ] Transformed 271 places.
[2022-06-02 15:18:06] [INFO ] Transformed 230 transitions.
[2022-06-02 15:18:06] [INFO ] Found NUPN structural information;
[2022-06-02 15:18:06] [INFO ] Parsed PT model containing 271 places and 230 transitions in 449 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 50 ms.
Working with output stream class java.io.PrintStream
FORMULA DES-PT-00b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 92 resets, run finished after 1019 ms. (steps per millisecond=9 ) properties (out of 14) seen :10
FORMULA DES-PT-00b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-00b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 230 rows 271 cols
[2022-06-02 15:18:08] [INFO ] Computed 59 place invariants in 20 ms
[2022-06-02 15:18:08] [INFO ] After 381ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-06-02 15:18:08] [INFO ] [Nat]Absence check using 37 positive place invariants in 29 ms returned sat
[2022-06-02 15:18:08] [INFO ] [Nat]Absence check using 37 positive and 22 generalized place invariants in 18 ms returned sat
[2022-06-02 15:18:09] [INFO ] After 278ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2022-06-02 15:18:09] [INFO ] Deduced a trap composed of 8 places in 208 ms of which 11 ms to minimize.
[2022-06-02 15:18:09] [INFO ] Deduced a trap composed of 31 places in 233 ms of which 5 ms to minimize.
[2022-06-02 15:18:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 533 ms
[2022-06-02 15:18:10] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 2 ms to minimize.
[2022-06-02 15:18:10] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 2 ms to minimize.
[2022-06-02 15:18:10] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 2 ms to minimize.
[2022-06-02 15:18:10] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 1 ms to minimize.
[2022-06-02 15:18:10] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 2 ms to minimize.
[2022-06-02 15:18:10] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 1 ms to minimize.
[2022-06-02 15:18:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1087 ms
[2022-06-02 15:18:10] [INFO ] After 1953ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-06-02 15:18:11] [INFO ] After 2267ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
FORMULA DES-PT-00b-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-00b-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 475 ms.
Support contains 12 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 230/230 transitions.
Graph (complete) has 489 edges and 271 vertex of which 266 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.11 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 266 transition count 204
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 244 transition count 204
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 46 place count 244 transition count 195
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 64 place count 235 transition count 195
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 82 place count 217 transition count 177
Iterating global reduction 2 with 18 rules applied. Total rules applied 100 place count 217 transition count 177
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 100 place count 217 transition count 176
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 216 transition count 176
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 115 place count 203 transition count 163
Iterating global reduction 2 with 13 rules applied. Total rules applied 128 place count 203 transition count 163
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 13 rules applied. Total rules applied 141 place count 203 transition count 150
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 144 place count 201 transition count 149
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 144 place count 201 transition count 147
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 148 place count 199 transition count 147
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 268 place count 139 transition count 87
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 276 place count 135 transition count 93
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 277 place count 135 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 278 place count 134 transition count 92
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 280 place count 134 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 282 place count 132 transition count 90
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 283 place count 131 transition count 89
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 285 place count 129 transition count 89
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 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 287 place count 128 transition count 88
Applied a total of 287 rules in 242 ms. Remains 128 /271 variables (removed 143) and now considering 88/230 (removed 142) transitions.
Finished structural reductions, in 1 iterations. Remains : 128/271 places, 88/230 transitions.
Incomplete random walk after 1000000 steps, including 36901 resets, run finished after 3738 ms. (steps per millisecond=267 ) properties (out of 2) seen :1
FORMULA DES-PT-00b-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 6740 resets, run finished after 1035 ms. (steps per millisecond=966 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 88 rows 128 cols
[2022-06-02 15:18:16] [INFO ] Computed 56 place invariants in 5 ms
[2022-06-02 15:18:16] [INFO ] [Real]Absence check using 33 positive place invariants in 11 ms returned sat
[2022-06-02 15:18:16] [INFO ] [Real]Absence check using 33 positive and 23 generalized place invariants in 9 ms returned sat
[2022-06-02 15:18:16] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 15:18:16] [INFO ] [Nat]Absence check using 33 positive place invariants in 11 ms returned sat
[2022-06-02 15:18:16] [INFO ] [Nat]Absence check using 33 positive and 23 generalized place invariants in 11 ms returned sat
[2022-06-02 15:18:16] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 15:18:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-06-02 15:18:16] [INFO ] After 12ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 15:18:16] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-06-02 15:18:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-06-02 15:18:16] [INFO ] After 63ms 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 15:18:16] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 3 out of 128 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 128/128 places, 88/88 transitions.
Graph (complete) has 396 edges and 128 vertex of which 127 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 127 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 126 transition count 85
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 126 transition count 84
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 125 transition count 84
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 18 place count 119 transition count 78
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 118 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 118 transition count 76
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 24 place count 118 transition count 72
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 118 transition count 71
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 29 place count 117 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 116 transition count 67
Applied a total of 30 rules in 27 ms. Remains 116 /128 variables (removed 12) and now considering 67/88 (removed 21) transitions.
Finished structural reductions, in 1 iterations. Remains : 116/128 places, 67/88 transitions.
Incomplete random walk after 1000000 steps, including 52677 resets, run finished after 2437 ms. (steps per millisecond=410 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 10200 resets, run finished after 967 ms. (steps per millisecond=1034 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 4559083 steps, run timeout after 9001 ms. (steps per millisecond=506 ) properties seen :{}
Probabilistic random walk after 4559083 steps, saw 646027 distinct states, run finished after 9002 ms. (steps per millisecond=506 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 67 rows 116 cols
[2022-06-02 15:18:29] [INFO ] Computed 57 place invariants in 6 ms
[2022-06-02 15:18:29] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-06-02 15:18:29] [INFO ] [Real]Absence check using 36 positive and 21 generalized place invariants in 11 ms returned sat
[2022-06-02 15:18:29] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 15:18:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2022-06-02 15:18:29] [INFO ] [Nat]Absence check using 36 positive and 21 generalized place invariants in 10 ms returned sat
[2022-06-02 15:18:29] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 15:18:29] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-06-02 15:18:29] [INFO ] After 13ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 15:18:29] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2022-06-02 15:18:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-06-02 15:18:29] [INFO ] After 74ms 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 15:18:29] [INFO ] After 240ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 116/116 places, 67/67 transitions.
Applied a total of 0 rules in 5 ms. Remains 116 /116 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 116/116 places, 67/67 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 116/116 places, 67/67 transitions.
Applied a total of 0 rules in 5 ms. Remains 116 /116 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 116 cols
[2022-06-02 15:18:29] [INFO ] Computed 57 place invariants in 4 ms
[2022-06-02 15:18:29] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 67 rows 116 cols
[2022-06-02 15:18:29] [INFO ] Computed 57 place invariants in 4 ms
[2022-06-02 15:18:30] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-06-02 15:18:30] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2022-06-02 15:18:30] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 67 rows 116 cols
[2022-06-02 15:18:30] [INFO ] Computed 57 place invariants in 16 ms
[2022-06-02 15:18:30] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 116/116 places, 67/67 transitions.
Finished random walk after 38 steps, including 1 resets, run visited all 3 properties in 3 ms. (steps per millisecond=12 )
Incomplete random walk after 1000000 steps, including 52563 resets, run finished after 2662 ms. (steps per millisecond=375 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 10130 resets, run finished after 1147 ms. (steps per millisecond=871 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5192808 steps, run timeout after 9001 ms. (steps per millisecond=576 ) properties seen :{}
Probabilistic random walk after 5192808 steps, saw 734844 distinct states, run finished after 9001 ms. (steps per millisecond=576 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 67 rows 116 cols
[2022-06-02 15:18:43] [INFO ] Computed 57 place invariants in 1 ms
[2022-06-02 15:18:43] [INFO ] [Real]Absence check using 36 positive place invariants in 18 ms returned sat
[2022-06-02 15:18:43] [INFO ] [Real]Absence check using 36 positive and 21 generalized place invariants in 14 ms returned sat
[2022-06-02 15:18:43] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 15:18:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2022-06-02 15:18:43] [INFO ] [Nat]Absence check using 36 positive and 21 generalized place invariants in 13 ms returned sat
[2022-06-02 15:18:43] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 15:18:43] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-06-02 15:18:43] [INFO ] After 9ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 15:18:43] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2022-06-02 15:18:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2022-06-02 15:18:43] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2022-06-02 15:18:43] [INFO ] After 247ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 3 out of 116 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 116/116 places, 67/67 transitions.
Applied a total of 0 rules in 10 ms. Remains 116 /116 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 116/116 places, 67/67 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 116/116 places, 67/67 transitions.
Applied a total of 0 rules in 9 ms. Remains 116 /116 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 116 cols
[2022-06-02 15:18:43] [INFO ] Computed 57 place invariants in 2 ms
[2022-06-02 15:18:43] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 67 rows 116 cols
[2022-06-02 15:18:43] [INFO ] Computed 57 place invariants in 16 ms
[2022-06-02 15:18:44] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-06-02 15:18:44] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2022-06-02 15:18:44] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 67 rows 116 cols
[2022-06-02 15:18:44] [INFO ] Computed 57 place invariants in 2 ms
[2022-06-02 15:18:44] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 116/116 places, 67/67 transitions.
Finished random walk after 39 steps, including 2 resets, run visited all 3 properties in 2 ms. (steps per millisecond=19 )
Applied a total of 0 rules in 9 ms. Remains 116 /116 variables (removed 0) and now considering 67/67 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 67 rows 116 cols
[2022-06-02 15:18:44] [INFO ] Computed 57 place invariants in 2 ms
[2022-06-02 15:18:44] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-06-02 15:18:44] [INFO ] [Real]Absence check using 36 positive and 21 generalized place invariants in 11 ms returned sat
[2022-06-02 15:18:44] [INFO ] After 184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 15:18:44] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2022-06-02 15:18:44] [INFO ] [Nat]Absence check using 36 positive and 21 generalized place invariants in 12 ms returned sat
[2022-06-02 15:18:44] [INFO ] After 67ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 15:18:44] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-02 15:18:44] [INFO ] After 195ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-02 15:18:45] [INFO ] Flatten gal took : 113 ms
[2022-06-02 15:18:45] [INFO ] Flatten gal took : 34 ms
[2022-06-02 15:18:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality665160584069064901.gal : 16 ms
[2022-06-02 15:18:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7302811413155941508.prop : 1 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/ReachabilityCardinality665160584069064901.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7302811413155941508.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...318
Loading property file /tmp/ReachabilityCardinality7302811413155941508.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 20
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :20 after 55
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :55 after 430
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :430 after 2272
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :2272 after 3086
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3086 after 6084
Reachability property DES-PT-00b-ReachabilityCardinality-04 is true.
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,12872,0.118095,5360,2,3018,13,7779,6,0,532,4614,0
Total reachable state count : 12872

Verifying 1 reachability properties.
Reachability property DES-PT-00b-ReachabilityCardinality-04 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-00b-ReachabilityCardinality-04,1,0.120492,5360,2,117,13,7779,7,0,540,4614,0
[2022-06-02 15:18:45] [INFO ] Flatten gal took : 25 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11040741366069780241
[2022-06-02 15:18:45] [INFO ] Applying decomposition
[2022-06-02 15:18:45] [INFO ] Flatten gal took : 25 ms
[2022-06-02 15:18:45] [INFO ] Computing symmetric may disable matrix : 67 transitions.
[2022-06-02 15:18:45] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 15:18:45] [INFO ] Computing symmetric may enable matrix : 67 transitions.
[2022-06-02 15:18:45] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 15:18:45] [INFO ] Computing Do-Not-Accords matrix : 67 transitions.
[2022-06-02 15:18:45] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-02 15:18:45] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11040741366069780241
[2022-06-02 15:18:45] [INFO ] Flatten gal took : 49 ms
Running compilation step : cd /tmp/ltsmin11040741366069780241;'/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'
[2022-06-02 15:18:45] [INFO ] Input system was already deterministic with 67 transitions.
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/graph1597759631433504673.txt' '-o' '/tmp/graph1597759631433504673.bin' '-w' '/tmp/graph1597759631433504673.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1597759631433504673.bin' '-l' '-1' '-v' '-w' '/tmp/graph1597759631433504673.weights' '-q' '0' '-e' '0.001'
[2022-06-02 15:18:46] [INFO ] Decomposing Gal with order
[2022-06-02 15:18:46] [INFO ] Ran tautology test, simplified 0 / 1 in 325 ms.
[2022-06-02 15:18:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 15:18:46] [INFO ] BMC solution for property DES-PT-00b-ReachabilityCardinality-04(UNSAT) depth K=0 took 59 ms
[2022-06-02 15:18:46] [INFO ] BMC solution for property DES-PT-00b-ReachabilityCardinality-04(UNSAT) depth K=1 took 10 ms
[2022-06-02 15:18:46] [INFO ] Removed a total of 45 redundant transitions.
[2022-06-02 15:18:46] [INFO ] BMC solution for property DES-PT-00b-ReachabilityCardinality-04(UNSAT) depth K=2 took 78 ms
[2022-06-02 15:18:46] [INFO ] BMC solution for property DES-PT-00b-ReachabilityCardinality-04(UNSAT) depth K=3 took 152 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 67 rows 116 cols
[2022-06-02 15:18:46] [INFO ] Computed 57 place invariants in 2 ms
[2022-06-02 15:18:46] [INFO ] Computed 57 place invariants in 3 ms
[2022-06-02 15:18:46] [INFO ] Flatten gal took : 350 ms
[2022-06-02 15:18:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 28 ms.
[2022-06-02 15:18:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7673784555514767738.gal : 10 ms
[2022-06-02 15:18:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17263355459866362677.prop : 1 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/ReachabilityCardinality7673784555514767738.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17263355459866362677.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...299
Loading property file /tmp/ReachabilityCardinality17263355459866362677.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 243
[2022-06-02 15:18:46] [INFO ] Proved 116 variables to be positive in 448 ms
[2022-06-02 15:18:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-00b-ReachabilityCardinality-04
[2022-06-02 15:18:46] [INFO ] KInduction solution for property DES-PT-00b-ReachabilityCardinality-04(SAT) depth K=0 took 25 ms
Compilation finished in 1223 ms.
Running link step : cd /tmp/ltsmin11040741366069780241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
[2022-06-02 15:18:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-00b-ReachabilityCardinality-04
[2022-06-02 15:18:46] [INFO ] KInduction solution for property DES-PT-00b-ReachabilityCardinality-04(SAT) depth K=1 took 55 ms
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin11040741366069780241;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DESPT00bReachabilityCardinality04==true'
[2022-06-02 15:18:47] [INFO ] BMC solution for property DES-PT-00b-ReachabilityCardinality-04(UNSAT) depth K=4 took 1106 ms
[2022-06-02 15:18:47] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-00b-ReachabilityCardinality-04
[2022-06-02 15:18:47] [INFO ] KInduction solution for property DES-PT-00b-ReachabilityCardinality-04(SAT) depth K=2 took 837 ms
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.20731e+10,0.828382,18764,755,98,29638,308,289,28853,73,774,0
Total reachable state count : 12073058169

Verifying 1 reachability properties.
Reachability property DES-PT-00b-ReachabilityCardinality-04 does not hold.
FORMULA DES-PT-00b-ReachabilityCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
No reachable states exhibit your property : DES-PT-00b-ReachabilityCardinality-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
DES-PT-00b-ReachabilityCardinality-04,0,0.830131,19028,1,0,29638,308,298,28853,77,774,13
[2022-06-02 15:18:48] [WARNING] Interrupting SMT solver.
[2022-06-02 15:18:48] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
[2022-06-02 15:18:48] [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.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
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 15:18:48] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-00b-ReachabilityCardinality-04 K-induction depth 3
Exception in thread "Thread-7" 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.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
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.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 2 more
[2022-06-02 15:18:48] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-00b-ReachabilityCardinality-04 SMT depth 5
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 15:18:48] [INFO ] During BMC, SMT solver timed out at depth 5
[2022-06-02 15:18:48] [INFO ] BMC solving timed out (3600000 secs) at depth 5
[2022-06-02 15:18:48] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 41995 ms.

BK_STOP 1654183128294

--------------------
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="DES-PT-00b"
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 DES-PT-00b, 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 r042-smll-165252095700398"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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