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

About the Execution of ITS-Tools for ShieldIIPs-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
454.340 36059.00 53311.00 124.70 FTTTFTTFFTTTTTTT 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-165286024700110.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 ShieldIIPs-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-165286024700110
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.7K Apr 29 14:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 29 14:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 14:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 29 14:57 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.3K May 9 08:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 29 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 29 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 29 14:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 29 14:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:48 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 332K 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 ShieldIIPs-PT-020B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-020B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654264938730

Running Version 202205111006
[2022-06-03 14:02:19] [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 14:02:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 14:02:20] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2022-06-03 14:02:20] [INFO ] Transformed 1203 places.
[2022-06-03 14:02:20] [INFO ] Transformed 1183 transitions.
[2022-06-03 14:02:20] [INFO ] Found NUPN structural information;
[2022-06-03 14:02:20] [INFO ] Parsed PT model containing 1203 places and 1183 transitions in 300 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 645 ms. (steps per millisecond=15 ) properties (out of 15) seen :8
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 1183 rows 1203 cols
[2022-06-03 14:02:21] [INFO ] Computed 181 place invariants in 31 ms
[2022-06-03 14:02:21] [INFO ] After 486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2022-06-03 14:02:22] [INFO ] [Nat]Absence check using 181 positive place invariants in 54 ms returned sat
[2022-06-03 14:02:23] [INFO ] After 856ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :2
[2022-06-03 14:02:23] [INFO ] Deduced a trap composed of 18 places in 363 ms of which 6 ms to minimize.
[2022-06-03 14:02:23] [INFO ] Deduced a trap composed of 27 places in 302 ms of which 2 ms to minimize.
[2022-06-03 14:02:24] [INFO ] Deduced a trap composed of 22 places in 436 ms of which 1 ms to minimize.
[2022-06-03 14:02:25] [INFO ] Deduced a trap composed of 23 places in 890 ms of which 4 ms to minimize.
[2022-06-03 14:02:25] [INFO ] Deduced a trap composed of 20 places in 384 ms of which 2 ms to minimize.
[2022-06-03 14:02:26] [INFO ] Deduced a trap composed of 20 places in 258 ms of which 1 ms to minimize.
[2022-06-03 14:02:26] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 1 ms to minimize.
[2022-06-03 14:02:26] [INFO ] Deduced a trap composed of 20 places in 230 ms of which 0 ms to minimize.
[2022-06-03 14:02:26] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 1 ms to minimize.
[2022-06-03 14:02:27] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 1 ms to minimize.
[2022-06-03 14:02:27] [INFO ] Deduced a trap composed of 24 places in 256 ms of which 1 ms to minimize.
[2022-06-03 14:02:27] [INFO ] Deduced a trap composed of 15 places in 324 ms of which 1 ms to minimize.
[2022-06-03 14:02:28] [INFO ] Deduced a trap composed of 23 places in 259 ms of which 0 ms to minimize.
[2022-06-03 14:02:28] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 1 ms to minimize.
[2022-06-03 14:02:28] [INFO ] Deduced a trap composed of 20 places in 266 ms of which 0 ms to minimize.
[2022-06-03 14:02:29] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 1 ms to minimize.
[2022-06-03 14:02:29] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 1 ms to minimize.
[2022-06-03 14:02:29] [INFO ] Deduced a trap composed of 16 places in 272 ms of which 1 ms to minimize.
[2022-06-03 14:02:30] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 1 ms to minimize.
[2022-06-03 14:02:30] [INFO ] Deduced a trap composed of 21 places in 272 ms of which 1 ms to minimize.
[2022-06-03 14:02:30] [INFO ] Deduced a trap composed of 23 places in 281 ms of which 3 ms to minimize.
[2022-06-03 14:02:31] [INFO ] Deduced a trap composed of 40 places in 263 ms of which 1 ms to minimize.
[2022-06-03 14:02:31] [INFO ] Deduced a trap composed of 21 places in 262 ms of which 1 ms to minimize.
[2022-06-03 14:02:31] [INFO ] Deduced a trap composed of 27 places in 266 ms of which 0 ms to minimize.
[2022-06-03 14:02:32] [INFO ] Deduced a trap composed of 24 places in 245 ms of which 0 ms to minimize.
[2022-06-03 14:02:32] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 0 ms to minimize.
[2022-06-03 14:02:32] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 0 ms to minimize.
[2022-06-03 14:02:32] [INFO ] Deduced a trap composed of 28 places in 239 ms of which 0 ms to minimize.
[2022-06-03 14:02:33] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 1 ms to minimize.
[2022-06-03 14:02:33] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 0 ms to minimize.
[2022-06-03 14:02:33] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 1 ms to minimize.
[2022-06-03 14:02:33] [INFO ] Deduced a trap composed of 28 places in 216 ms of which 0 ms to minimize.
[2022-06-03 14:02:34] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 0 ms to minimize.
[2022-06-03 14:02:34] [INFO ] Deduced a trap composed of 23 places in 196 ms of which 1 ms to minimize.
[2022-06-03 14:02:34] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 1 ms to minimize.
[2022-06-03 14:02:34] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 0 ms to minimize.
[2022-06-03 14:02:35] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 1 ms to minimize.
[2022-06-03 14:02:35] [INFO ] Deduced a trap composed of 34 places in 180 ms of which 0 ms to minimize.
[2022-06-03 14:02:35] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 1 ms to minimize.
[2022-06-03 14:02:35] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 1 ms to minimize.
[2022-06-03 14:02:36] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 0 ms to minimize.
[2022-06-03 14:02:36] [INFO ] Deduced a trap composed of 34 places in 158 ms of which 1 ms to minimize.
[2022-06-03 14:02:36] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 1 ms to minimize.
[2022-06-03 14:02:37] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 1 ms to minimize.
[2022-06-03 14:02:37] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2022-06-03 14:02:37] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 1 ms to minimize.
[2022-06-03 14:02:37] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 1 ms to minimize.
[2022-06-03 14:02:38] [INFO ] Deduced a trap composed of 34 places in 237 ms of which 1 ms to minimize.
[2022-06-03 14:02:38] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 1 ms to minimize.
[2022-06-03 14:02:38] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 1 ms to minimize.
[2022-06-03 14:02:38] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 1 ms to minimize.
[2022-06-03 14:02:39] [INFO ] Deduced a trap composed of 31 places in 258 ms of which 1 ms to minimize.
[2022-06-03 14:02:39] [INFO ] Deduced a trap composed of 22 places in 254 ms of which 0 ms to minimize.
[2022-06-03 14:02:39] [INFO ] Deduced a trap composed of 33 places in 226 ms of which 1 ms to minimize.
[2022-06-03 14:02:40] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 0 ms to minimize.
[2022-06-03 14:02:40] [INFO ] Deduced a trap composed of 20 places in 247 ms of which 1 ms to minimize.
[2022-06-03 14:02:40] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 0 ms to minimize.
[2022-06-03 14:02:41] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 1 ms to minimize.
[2022-06-03 14:02:41] [INFO ] Deduced a trap composed of 26 places in 246 ms of which 1 ms to minimize.
[2022-06-03 14:02:41] [INFO ] Deduced a trap composed of 19 places in 230 ms of which 0 ms to minimize.
[2022-06-03 14:02:41] [INFO ] Deduced a trap composed of 15 places in 229 ms of which 1 ms to minimize.
[2022-06-03 14:02:42] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 0 ms to minimize.
[2022-06-03 14:02:42] [INFO ] Deduced a trap composed of 20 places in 229 ms of which 1 ms to minimize.
[2022-06-03 14:02:42] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 1 ms to minimize.
[2022-06-03 14:02:42] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 0 ms to minimize.
[2022-06-03 14:02:43] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 3 ms to minimize.
[2022-06-03 14:02:43] [INFO ] Deduced a trap composed of 25 places in 197 ms of which 2 ms to minimize.
[2022-06-03 14:02:43] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 1 ms to minimize.
[2022-06-03 14:02:44] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 1 ms to minimize.
[2022-06-03 14:02:44] [INFO ] Deduced a trap composed of 37 places in 201 ms of which 0 ms to minimize.
[2022-06-03 14:02:44] [INFO ] Deduced a trap composed of 20 places in 187 ms of which 1 ms to minimize.
[2022-06-03 14:02:44] [INFO ] Deduced a trap composed of 23 places in 195 ms of which 0 ms to minimize.
[2022-06-03 14:02:44] [INFO ] Deduced a trap composed of 28 places in 188 ms of which 0 ms to minimize.
[2022-06-03 14:02:45] [INFO ] Deduced a trap composed of 25 places in 206 ms of which 1 ms to minimize.
[2022-06-03 14:02:45] [INFO ] Deduced a trap composed of 38 places in 189 ms of which 1 ms to minimize.
[2022-06-03 14:02:45] [INFO ] Deduced a trap composed of 39 places in 190 ms of which 1 ms to minimize.
[2022-06-03 14:02:45] [INFO ] Deduced a trap composed of 34 places in 194 ms of which 0 ms to minimize.
[2022-06-03 14:02:46] [INFO ] Deduced a trap composed of 23 places in 177 ms of which 0 ms to minimize.
[2022-06-03 14:02:46] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 1 ms to minimize.
[2022-06-03 14:02:46] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 1 ms to minimize.
[2022-06-03 14:02:46] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 1 ms to minimize.
[2022-06-03 14:02:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-03 14:02:46] [INFO ] After 25073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1710 ms.
Support contains 33 out of 1203 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1203/1203 places, 1183/1183 transitions.
Drop transitions removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 1203 transition count 1096
Reduce places removed 87 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 94 rules applied. Total rules applied 181 place count 1116 transition count 1089
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 188 place count 1109 transition count 1089
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 188 place count 1109 transition count 990
Deduced a syphon composed of 99 places in 2 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 386 place count 1010 transition count 990
Discarding 127 places :
Symmetric choice reduction at 3 with 127 rule applications. Total rules 513 place count 883 transition count 863
Iterating global reduction 3 with 127 rules applied. Total rules applied 640 place count 883 transition count 863
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 46 Pre rules applied. Total rules applied 640 place count 883 transition count 817
Deduced a syphon composed of 46 places in 3 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 732 place count 837 transition count 817
Performed 287 Post agglomeration using F-continuation condition.Transition count delta: 287
Deduced a syphon composed of 287 places in 2 ms
Reduce places removed 287 places and 0 transitions.
Iterating global reduction 3 with 574 rules applied. Total rules applied 1306 place count 550 transition count 530
Partial Free-agglomeration rule applied 132 times.
Drop transitions removed 132 transitions
Iterating global reduction 3 with 132 rules applied. Total rules applied 1438 place count 550 transition count 530
Applied a total of 1438 rules in 298 ms. Remains 550 /1203 variables (removed 653) and now considering 530/1183 (removed 653) transitions.
Finished structural reductions, in 1 iterations. Remains : 550/1203 places, 530/1183 transitions.
Incomplete random walk after 1000000 steps, including 487 resets, run finished after 5658 ms. (steps per millisecond=176 ) properties (out of 2) seen :1
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 26675 steps, including 0 resets, run visited all 1 properties in 71 ms. (steps per millisecond=375 )
FORMULA ShieldIIPs-PT-020B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 34822 ms.

BK_STOP 1654264974789

--------------------
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="ShieldIIPs-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 ShieldIIPs-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-165286024700110"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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