fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r222-tall-165286026101006
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for ShieldRVt-PT-030B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
842.388 43914.00 64864.00 125.20 TTTFTTTTTFFTFTTF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 892K
-rw-r--r-- 1 mcc users 8.1K Apr 30 01:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 30 01:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 01:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 30 01:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 09:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 30 01:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 30 01:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 30 01:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 30 01:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 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 364K 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 ShieldRVt-PT-030B-ReachabilityCardinality-00
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-01
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-02
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-03
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-04
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-05
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-06
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-07
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-08
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-09
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-10
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-11
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-12
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-13
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-14
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654283042784

Running Version 202205111006
[2022-06-03 19:04:04] [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 19:04:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 19:04:04] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2022-06-03 19:04:04] [INFO ] Transformed 1503 places.
[2022-06-03 19:04:04] [INFO ] Transformed 1503 transitions.
[2022-06-03 19:04:04] [INFO ] Found NUPN structural information;
[2022-06-03 19:04:04] [INFO ] Parsed PT model containing 1503 places and 1503 transitions in 299 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 582 ms. (steps per millisecond=17 ) properties (out of 16) seen :9
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1503 rows 1503 cols
[2022-06-03 19:04:05] [INFO ] Computed 121 place invariants in 22 ms
[2022-06-03 19:04:06] [INFO ] After 605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-03 19:04:06] [INFO ] [Nat]Absence check using 121 positive place invariants in 49 ms returned sat
[2022-06-03 19:04:08] [INFO ] After 1388ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :2
[2022-06-03 19:04:08] [INFO ] Deduced a trap composed of 36 places in 334 ms of which 21 ms to minimize.
[2022-06-03 19:04:08] [INFO ] Deduced a trap composed of 21 places in 317 ms of which 2 ms to minimize.
[2022-06-03 19:04:09] [INFO ] Deduced a trap composed of 40 places in 327 ms of which 1 ms to minimize.
[2022-06-03 19:04:09] [INFO ] Deduced a trap composed of 40 places in 246 ms of which 2 ms to minimize.
[2022-06-03 19:04:09] [INFO ] Deduced a trap composed of 43 places in 262 ms of which 1 ms to minimize.
[2022-06-03 19:04:10] [INFO ] Deduced a trap composed of 36 places in 295 ms of which 1 ms to minimize.
[2022-06-03 19:04:10] [INFO ] Deduced a trap composed of 47 places in 246 ms of which 1 ms to minimize.
[2022-06-03 19:04:10] [INFO ] Deduced a trap composed of 46 places in 230 ms of which 1 ms to minimize.
[2022-06-03 19:04:11] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 1 ms to minimize.
[2022-06-03 19:04:11] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 0 ms to minimize.
[2022-06-03 19:04:11] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 0 ms to minimize.
[2022-06-03 19:04:12] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 0 ms to minimize.
[2022-06-03 19:04:12] [INFO ] Deduced a trap composed of 54 places in 186 ms of which 1 ms to minimize.
[2022-06-03 19:04:12] [INFO ] Deduced a trap composed of 37 places in 178 ms of which 1 ms to minimize.
[2022-06-03 19:04:12] [INFO ] Deduced a trap composed of 57 places in 173 ms of which 0 ms to minimize.
[2022-06-03 19:04:12] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 1 ms to minimize.
[2022-06-03 19:04:13] [INFO ] Deduced a trap composed of 63 places in 172 ms of which 0 ms to minimize.
[2022-06-03 19:04:13] [INFO ] Deduced a trap composed of 36 places in 164 ms of which 1 ms to minimize.
[2022-06-03 19:04:13] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 0 ms to minimize.
[2022-06-03 19:04:13] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 1 ms to minimize.
[2022-06-03 19:04:14] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 0 ms to minimize.
[2022-06-03 19:04:14] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 1 ms to minimize.
[2022-06-03 19:04:14] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 1 ms to minimize.
[2022-06-03 19:04:14] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6380 ms
[2022-06-03 19:04:15] [INFO ] Deduced a trap composed of 64 places in 311 ms of which 1 ms to minimize.
[2022-06-03 19:04:15] [INFO ] Deduced a trap composed of 28 places in 307 ms of which 0 ms to minimize.
[2022-06-03 19:04:16] [INFO ] Deduced a trap composed of 50 places in 293 ms of which 1 ms to minimize.
[2022-06-03 19:04:16] [INFO ] Deduced a trap composed of 41 places in 301 ms of which 1 ms to minimize.
[2022-06-03 19:04:16] [INFO ] Deduced a trap composed of 31 places in 295 ms of which 1 ms to minimize.
[2022-06-03 19:04:17] [INFO ] Deduced a trap composed of 44 places in 287 ms of which 1 ms to minimize.
[2022-06-03 19:04:17] [INFO ] Deduced a trap composed of 27 places in 309 ms of which 1 ms to minimize.
[2022-06-03 19:04:18] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 0 ms to minimize.
[2022-06-03 19:04:18] [INFO ] Deduced a trap composed of 31 places in 252 ms of which 1 ms to minimize.
[2022-06-03 19:04:18] [INFO ] Deduced a trap composed of 43 places in 239 ms of which 1 ms to minimize.
[2022-06-03 19:04:18] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 1 ms to minimize.
[2022-06-03 19:04:19] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 5 ms to minimize.
[2022-06-03 19:04:19] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 1 ms to minimize.
[2022-06-03 19:04:19] [INFO ] Deduced a trap composed of 36 places in 227 ms of which 1 ms to minimize.
[2022-06-03 19:04:20] [INFO ] Deduced a trap composed of 44 places in 223 ms of which 1 ms to minimize.
[2022-06-03 19:04:20] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 1 ms to minimize.
[2022-06-03 19:04:20] [INFO ] Deduced a trap composed of 46 places in 201 ms of which 1 ms to minimize.
[2022-06-03 19:04:20] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5748 ms
[2022-06-03 19:04:20] [INFO ] After 14117ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :2
Attempting to minimize the solution found.
Minimization took 1217 ms.
[2022-06-03 19:04:21] [INFO ] After 15857ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :2
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1539 ms.
Support contains 64 out of 1503 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions removed 422 transitions
Trivial Post-agglo rules discarded 422 transitions
Performed 422 trivial Post agglomeration. Transition count delta: 422
Iterating post reduction 0 with 422 rules applied. Total rules applied 422 place count 1503 transition count 1081
Reduce places removed 422 places and 0 transitions.
Ensure Unique test 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 1 with 424 rules applied. Total rules applied 846 place count 1081 transition count 1079
Reduce places removed 1 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 2 with 23 rules applied. Total rules applied 869 place count 1080 transition count 1057
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 891 place count 1058 transition count 1057
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 121 Pre rules applied. Total rules applied 891 place count 1058 transition count 936
Deduced a syphon composed of 121 places in 4 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 4 with 242 rules applied. Total rules applied 1133 place count 937 transition count 936
Discarding 189 places :
Symmetric choice reduction at 4 with 189 rule applications. Total rules 1322 place count 748 transition count 747
Iterating global reduction 4 with 189 rules applied. Total rules applied 1511 place count 748 transition count 747
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 76 Pre rules applied. Total rules applied 1511 place count 748 transition count 671
Deduced a syphon composed of 76 places in 11 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 1663 place count 672 transition count 671
Performed 251 Post agglomeration using F-continuation condition.Transition count delta: 251
Deduced a syphon composed of 251 places in 2 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 4 with 502 rules applied. Total rules applied 2165 place count 421 transition count 420
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -62
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 2319 place count 344 transition count 482
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 2320 place count 344 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2321 place count 343 transition count 481
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2322 place count 343 transition count 481
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2323 place count 343 transition count 481
Applied a total of 2323 rules in 441 ms. Remains 343 /1503 variables (removed 1160) and now considering 481/1503 (removed 1022) transitions.
Finished structural reductions, in 1 iterations. Remains : 343/1503 places, 481/1503 transitions.
Incomplete random walk after 1000000 steps, including 44 resets, run finished after 5733 ms. (steps per millisecond=174 ) properties (out of 2) seen :1
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 9 resets, run finished after 2838 ms. (steps per millisecond=352 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 481 rows 343 cols
[2022-06-03 19:04:32] [INFO ] Computed 121 place invariants in 6 ms
[2022-06-03 19:04:32] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-03 19:04:32] [INFO ] [Nat]Absence check using 121 positive place invariants in 16 ms returned sat
[2022-06-03 19:04:32] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-03 19:04:32] [INFO ] State equation strengthened by 234 read => feed constraints.
[2022-06-03 19:04:33] [INFO ] After 215ms SMT Verify possible using 234 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-03 19:04:33] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2022-06-03 19:04:33] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2022-06-03 19:04:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 176 ms
[2022-06-03 19:04:33] [INFO ] After 517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 140 ms.
[2022-06-03 19:04:33] [INFO ] After 907ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 150 ms.
Support contains 32 out of 343 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 343/343 places, 481/481 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 343 transition count 472
Reduce places removed 9 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 19 place count 334 transition count 471
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 333 transition count 471
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 20 place count 333 transition count 462
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 38 place count 324 transition count 462
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 323 transition count 461
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 323 transition count 461
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 84 place count 301 transition count 439
Renaming transitions due to excessive name length > 1024 char.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 100 place count 293 transition count 447
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 101 place count 293 transition count 446
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 293 transition count 445
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 293 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 104 place count 292 transition count 444
Applied a total of 104 rules in 66 ms. Remains 292 /343 variables (removed 51) and now considering 444/481 (removed 37) transitions.
Finished structural reductions, in 1 iterations. Remains : 292/343 places, 444/481 transitions.
Incomplete random walk after 1000000 steps, including 217 resets, run finished after 4026 ms. (steps per millisecond=248 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 17 resets, run finished after 2850 ms. (steps per millisecond=350 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1167241 steps, run visited all 1 properties in 5971 ms. (steps per millisecond=195 )
Probabilistic random walk after 1167241 steps, saw 391993 distinct states, run finished after 5971 ms. (steps per millisecond=195 ) properties seen :1
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 42613 ms.

BK_STOP 1654283086698

--------------------
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="ShieldRVt-PT-030B"
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 ShieldRVt-PT-030B, 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-165286026101006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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