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.r222-tall-165286025200462.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 ShieldPPPs-PT-020B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025200462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 6.1K Apr 30 03:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 30 03:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 30 03:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 30 03:34 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 3.9K May 9 08:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 03:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 30 03:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 03:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 03:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 349K 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 ShieldPPPs-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldPPPs-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654272546661

Running Version 202205111006
[2022-06-03 16:09:07] [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-03 16:09:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 16:09:08] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2022-06-03 16:09:08] [INFO ] Transformed 1363 places.
[2022-06-03 16:09:08] [INFO ] Transformed 1263 transitions.
[2022-06-03 16:09:08] [INFO ] Found NUPN structural information;
[2022-06-03 16:09:08] [INFO ] Parsed PT model containing 1363 places and 1263 transitions in 316 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 673 ms. (steps per millisecond=14 ) properties (out of 16) seen :6
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-00 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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
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 :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 1263 rows 1363 cols
[2022-06-03 16:09:09] [INFO ] Computed 221 place invariants in 25 ms
[2022-06-03 16:09:10] [INFO ] After 690ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2022-06-03 16:09:10] [INFO ] [Nat]Absence check using 221 positive place invariants in 76 ms returned sat
[2022-06-03 16:09:11] [INFO ] After 880ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :2
[2022-06-03 16:09:12] [INFO ] Deduced a trap composed of 14 places in 355 ms of which 7 ms to minimize.
[2022-06-03 16:09:12] [INFO ] Deduced a trap composed of 11 places in 376 ms of which 2 ms to minimize.
[2022-06-03 16:09:13] [INFO ] Deduced a trap composed of 16 places in 327 ms of which 2 ms to minimize.
[2022-06-03 16:09:13] [INFO ] Deduced a trap composed of 37 places in 492 ms of which 2 ms to minimize.
[2022-06-03 16:09:14] [INFO ] Deduced a trap composed of 21 places in 343 ms of which 1 ms to minimize.
[2022-06-03 16:09:14] [INFO ] Deduced a trap composed of 24 places in 412 ms of which 1 ms to minimize.
[2022-06-03 16:09:14] [INFO ] Deduced a trap composed of 25 places in 300 ms of which 1 ms to minimize.
[2022-06-03 16:09:15] [INFO ] Deduced a trap composed of 27 places in 272 ms of which 1 ms to minimize.
[2022-06-03 16:09:15] [INFO ] Deduced a trap composed of 16 places in 273 ms of which 1 ms to minimize.
[2022-06-03 16:09:15] [INFO ] Deduced a trap composed of 37 places in 261 ms of which 1 ms to minimize.
[2022-06-03 16:09:16] [INFO ] Deduced a trap composed of 26 places in 280 ms of which 1 ms to minimize.
[2022-06-03 16:09:16] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 5 ms to minimize.
[2022-06-03 16:09:16] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 1 ms to minimize.
[2022-06-03 16:09:17] [INFO ] Deduced a trap composed of 20 places in 268 ms of which 0 ms to minimize.
[2022-06-03 16:09:17] [INFO ] Deduced a trap composed of 20 places in 268 ms of which 1 ms to minimize.
[2022-06-03 16:09:17] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 1 ms to minimize.
[2022-06-03 16:09:18] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 1 ms to minimize.
[2022-06-03 16:09:18] [INFO ] Deduced a trap composed of 35 places in 248 ms of which 1 ms to minimize.
[2022-06-03 16:09:18] [INFO ] Deduced a trap composed of 41 places in 242 ms of which 0 ms to minimize.
[2022-06-03 16:09:19] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 0 ms to minimize.
[2022-06-03 16:09:19] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 1 ms to minimize.
[2022-06-03 16:09:19] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 1 ms to minimize.
[2022-06-03 16:09:20] [INFO ] Deduced a trap composed of 29 places in 235 ms of which 1 ms to minimize.
[2022-06-03 16:09:20] [INFO ] Deduced a trap composed of 18 places in 214 ms of which 1 ms to minimize.
[2022-06-03 16:09:20] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 0 ms to minimize.
[2022-06-03 16:09:20] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 1 ms to minimize.
[2022-06-03 16:09:21] [INFO ] Deduced a trap composed of 20 places in 218 ms of which 1 ms to minimize.
[2022-06-03 16:09:21] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 0 ms to minimize.
[2022-06-03 16:09:21] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 0 ms to minimize.
[2022-06-03 16:09:22] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 1 ms to minimize.
[2022-06-03 16:09:22] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 1 ms to minimize.
[2022-06-03 16:09:22] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 1 ms to minimize.
[2022-06-03 16:09:22] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 1 ms to minimize.
[2022-06-03 16:09:23] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 0 ms to minimize.
[2022-06-03 16:09:23] [INFO ] Deduced a trap composed of 20 places in 195 ms of which 0 ms to minimize.
[2022-06-03 16:09:23] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 1 ms to minimize.
[2022-06-03 16:09:23] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 1 ms to minimize.
[2022-06-03 16:09:24] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 1 ms to minimize.
[2022-06-03 16:09:24] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 0 ms to minimize.
[2022-06-03 16:09:24] [INFO ] Deduced a trap composed of 29 places in 166 ms of which 2 ms to minimize.
[2022-06-03 16:09:24] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 1 ms to minimize.
[2022-06-03 16:09:25] [INFO ] Deduced a trap composed of 36 places in 158 ms of which 1 ms to minimize.
[2022-06-03 16:09:25] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 1 ms to minimize.
[2022-06-03 16:09:25] [INFO ] Deduced a trap composed of 37 places in 164 ms of which 1 ms to minimize.
[2022-06-03 16:09:25] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 0 ms to minimize.
[2022-06-03 16:09:26] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 0 ms to minimize.
[2022-06-03 16:09:26] [INFO ] Deduced a trap composed of 46 places in 155 ms of which 0 ms to minimize.
[2022-06-03 16:09:26] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 1 ms to minimize.
[2022-06-03 16:09:26] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 1 ms to minimize.
[2022-06-03 16:09:26] [INFO ] Deduced a trap composed of 49 places in 147 ms of which 0 ms to minimize.
[2022-06-03 16:09:27] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 1 ms to minimize.
[2022-06-03 16:09:27] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 1 ms to minimize.
[2022-06-03 16:09:27] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 1 ms to minimize.
[2022-06-03 16:09:27] [INFO ] Deduced a trap composed of 51 places in 146 ms of which 0 ms to minimize.
[2022-06-03 16:09:27] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 1 ms to minimize.
[2022-06-03 16:09:28] [INFO ] Deduced a trap composed of 50 places in 141 ms of which 0 ms to minimize.
[2022-06-03 16:09:28] [INFO ] Deduced a trap composed of 31 places in 140 ms of which 0 ms to minimize.
[2022-06-03 16:09:28] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 1 ms to minimize.
[2022-06-03 16:09:28] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 0 ms to minimize.
[2022-06-03 16:09:28] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 1 ms to minimize.
[2022-06-03 16:09:29] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 1 ms to minimize.
[2022-06-03 16:09:29] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 0 ms to minimize.
[2022-06-03 16:09:29] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 0 ms to minimize.
[2022-06-03 16:09:29] [INFO ] Deduced a trap composed of 49 places in 142 ms of which 2 ms to minimize.
[2022-06-03 16:09:29] [INFO ] Deduced a trap composed of 38 places in 135 ms of which 1 ms to minimize.
[2022-06-03 16:09:30] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 0 ms to minimize.
[2022-06-03 16:09:30] [INFO ] Deduced a trap composed of 50 places in 140 ms of which 0 ms to minimize.
[2022-06-03 16:09:30] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 5 ms to minimize.
[2022-06-03 16:09:30] [INFO ] Trap strengthening (SAT) tested/added 69/68 trap constraints in 18679 ms
[2022-06-03 16:09:31] [INFO ] Deduced a trap composed of 25 places in 248 ms of which 0 ms to minimize.
[2022-06-03 16:09:31] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 1 ms to minimize.
[2022-06-03 16:09:31] [INFO ] Deduced a trap composed of 28 places in 196 ms of which 0 ms to minimize.
[2022-06-03 16:09:31] [INFO ] Deduced a trap composed of 21 places in 201 ms of which 0 ms to minimize.
[2022-06-03 16:09:32] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 0 ms to minimize.
[2022-06-03 16:09:32] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 0 ms to minimize.
[2022-06-03 16:09:32] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 1 ms to minimize.
[2022-06-03 16:09:33] [INFO ] Deduced a trap composed of 21 places in 189 ms of which 0 ms to minimize.
[2022-06-03 16:09:33] [INFO ] Deduced a trap composed of 10 places in 188 ms of which 0 ms to minimize.
[2022-06-03 16:09:33] [INFO ] Deduced a trap composed of 26 places in 186 ms of which 1 ms to minimize.
[2022-06-03 16:09:33] [INFO ] Deduced a trap composed of 17 places in 185 ms of which 0 ms to minimize.
[2022-06-03 16:09:34] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 0 ms to minimize.
[2022-06-03 16:09:34] [INFO ] Deduced a trap composed of 21 places in 178 ms of which 1 ms to minimize.
[2022-06-03 16:09:34] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 0 ms to minimize.
[2022-06-03 16:09:34] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 1 ms to minimize.
[2022-06-03 16:09:35] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 0 ms to minimize.
[2022-06-03 16:09:35] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 0 ms to minimize.
[2022-06-03 16:09:35] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 1 ms to minimize.
[2022-06-03 16:09:35] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 16:09:35] [INFO ] After 25130ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:10
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1636 ms.
Support contains 58 out of 1363 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1363/1363 places, 1263/1263 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 1363 transition count 1137
Reduce places removed 126 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 130 rules applied. Total rules applied 256 place count 1237 transition count 1133
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 260 place count 1233 transition count 1133
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 95 Pre rules applied. Total rules applied 260 place count 1233 transition count 1038
Deduced a syphon composed of 95 places in 5 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 190 rules applied. Total rules applied 450 place count 1138 transition count 1038
Discarding 127 places :
Symmetric choice reduction at 3 with 127 rule applications. Total rules 577 place count 1011 transition count 911
Iterating global reduction 3 with 127 rules applied. Total rules applied 704 place count 1011 transition count 911
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 704 place count 1011 transition count 863
Deduced a syphon composed of 48 places in 4 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 800 place count 963 transition count 863
Performed 281 Post agglomeration using F-continuation condition.Transition count delta: 281
Deduced a syphon composed of 281 places in 2 ms
Reduce places removed 281 places and 0 transitions.
Iterating global reduction 3 with 562 rules applied. Total rules applied 1362 place count 682 transition count 582
Partial Free-agglomeration rule applied 158 times.
Drop transitions removed 158 transitions
Iterating global reduction 3 with 158 rules applied. Total rules applied 1520 place count 682 transition count 582
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1521 place count 681 transition count 581
Applied a total of 1521 rules in 472 ms. Remains 681 /1363 variables (removed 682) and now considering 581/1263 (removed 682) transitions.
Finished structural reductions, in 1 iterations. Remains : 681/1363 places, 581/1263 transitions.
Finished random walk after 15272 steps, including 5 resets, run visited all 2 properties in 118 ms. (steps per millisecond=129 )
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-020B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 29815 ms.

BK_STOP 1654272577864

--------------------
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="ShieldPPPs-PT-020B"
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 ShieldPPPs-PT-020B, 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 r222-tall-165286025200462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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