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.r114-smll-165264477300165.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 HealthRecord-PT-12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477300165
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 6.2K Apr 30 11:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 30 11:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 11:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 30 11:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 71K 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 positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME HealthRecord-PT-12-UpperBounds-00
FORMULA_NAME HealthRecord-PT-12-UpperBounds-01
FORMULA_NAME HealthRecord-PT-12-UpperBounds-02
FORMULA_NAME HealthRecord-PT-12-UpperBounds-03
FORMULA_NAME HealthRecord-PT-12-UpperBounds-04
FORMULA_NAME HealthRecord-PT-12-UpperBounds-05
FORMULA_NAME HealthRecord-PT-12-UpperBounds-06
FORMULA_NAME HealthRecord-PT-12-UpperBounds-07
FORMULA_NAME HealthRecord-PT-12-UpperBounds-08
FORMULA_NAME HealthRecord-PT-12-UpperBounds-09
FORMULA_NAME HealthRecord-PT-12-UpperBounds-10
FORMULA_NAME HealthRecord-PT-12-UpperBounds-11
FORMULA_NAME HealthRecord-PT-12-UpperBounds-12
FORMULA_NAME HealthRecord-PT-12-UpperBounds-13
FORMULA_NAME HealthRecord-PT-12-UpperBounds-14
FORMULA_NAME HealthRecord-PT-12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652694798141

Running Version 202205111006
[2022-05-16 09:53:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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-05-16 09:53:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 09:53:20] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2022-05-16 09:53:20] [INFO ] Transformed 160 places.
[2022-05-16 09:53:20] [INFO ] Transformed 340 transitions.
[2022-05-16 09:53:20] [INFO ] Found NUPN structural information;
[2022-05-16 09:53:20] [INFO ] Parsed PT model containing 160 places and 340 transitions in 413 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
Normalized transition count is 300 out of 312 initially.
// Phase 1: matrix 300 rows 160 cols
[2022-05-16 09:53:20] [INFO ] Computed 18 place invariants in 33 ms
Incomplete random walk after 10000 steps, including 714 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 16) seen :9
FORMULA HealthRecord-PT-12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
[2022-05-16 09:53:20] [INFO ] Flow matrix only has 300 transitions (discarded 12 similar events)
// Phase 1: matrix 300 rows 160 cols
[2022-05-16 09:53:20] [INFO ] Computed 18 place invariants in 18 ms
[2022-05-16 09:53:21] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2022-05-16 09:53:21] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2022-05-16 09:53:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:53:21] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2022-05-16 09:53:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:53:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 13 ms returned sat
[2022-05-16 09:53:21] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-16 09:53:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:53:21] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2022-05-16 09:53:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 09:53:21] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-16 09:53:21] [INFO ] Deduced a trap composed of 30 places in 177 ms of which 81 ms to minimize.
[2022-05-16 09:53:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2022-05-16 09:53:22] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 74 ms.
[2022-05-16 09:53:22] [INFO ] Added : 11 causal constraints over 3 iterations in 254 ms. Result :sat
Minimization took 54 ms.
[2022-05-16 09:53:22] [INFO ] [Real]Absence check using 10 positive place invariants in 13 ms returned sat
[2022-05-16 09:53:22] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:53:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:53:22] [INFO ] [Real]Absence check using state equation in 183 ms returned sat
[2022-05-16 09:53:22] [INFO ] [Real]Added 1 Read/Feed constraints in 7 ms returned sat
[2022-05-16 09:53:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:53:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 17 ms returned sat
[2022-05-16 09:53:22] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-16 09:53:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:53:22] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2022-05-16 09:53:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-16 09:53:22] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 53 ms.
[2022-05-16 09:53:23] [INFO ] Added : 13 causal constraints over 3 iterations in 145 ms. Result :sat
Minimization took 30 ms.
[2022-05-16 09:53:23] [INFO ] [Real]Absence check using 10 positive place invariants in 9 ms returned sat
[2022-05-16 09:53:23] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 5 ms returned sat
[2022-05-16 09:53:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:53:23] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2022-05-16 09:53:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:53:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 32 ms returned sat
[2022-05-16 09:53:23] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-16 09:53:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:53:23] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2022-05-16 09:53:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2022-05-16 09:53:23] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 47 ms.
[2022-05-16 09:53:23] [INFO ] Added : 30 causal constraints over 6 iterations in 263 ms. Result :sat
Minimization took 54 ms.
[2022-05-16 09:53:24] [INFO ] [Real]Absence check using 10 positive place invariants in 16 ms returned sat
[2022-05-16 09:53:24] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 16 ms returned sat
[2022-05-16 09:53:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:53:24] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2022-05-16 09:53:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:53:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2022-05-16 09:53:24] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-16 09:53:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:53:24] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2022-05-16 09:53:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2022-05-16 09:53:24] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 3 ms to minimize.
[2022-05-16 09:53:24] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2022-05-16 09:53:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 272 ms
[2022-05-16 09:53:24] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 50 ms.
[2022-05-16 09:53:25] [INFO ] Added : 27 causal constraints over 6 iterations in 262 ms. Result :sat
Minimization took 55 ms.
[2022-05-16 09:53:25] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2022-05-16 09:53:25] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 13 ms returned sat
[2022-05-16 09:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:53:25] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2022-05-16 09:53:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:53:25] [INFO ] [Nat]Absence check using 10 positive place invariants in 10 ms returned sat
[2022-05-16 09:53:25] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-16 09:53:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:53:25] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2022-05-16 09:53:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-16 09:53:25] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 30 ms.
[2022-05-16 09:53:25] [INFO ] Added : 28 causal constraints over 6 iterations in 162 ms. Result :sat
Minimization took 32 ms.
[2022-05-16 09:53:25] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-16 09:53:25] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-16 09:53:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:53:25] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2022-05-16 09:53:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:53:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2022-05-16 09:53:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 8 ms returned sat
[2022-05-16 09:53:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:53:26] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2022-05-16 09:53:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-05-16 09:53:26] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 44 ms.
[2022-05-16 09:53:26] [INFO ] Added : 15 causal constraints over 3 iterations in 186 ms. Result :sat
Minimization took 48 ms.
[2022-05-16 09:53:26] [INFO ] [Real]Absence check using 10 positive place invariants in 14 ms returned sat
[2022-05-16 09:53:26] [INFO ] [Real]Absence check using 10 positive and 8 generalized place invariants in 9 ms returned sat
[2022-05-16 09:53:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 09:53:26] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2022-05-16 09:53:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 09:53:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2022-05-16 09:53:26] [INFO ] [Nat]Absence check using 10 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-16 09:53:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 09:53:26] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2022-05-16 09:53:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-16 09:53:27] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
[2022-05-16 09:53:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2022-05-16 09:53:27] [INFO ] Computed and/alt/rep : 233/269/233 causal constraints (skipped 66 transitions) in 42 ms.
[2022-05-16 09:53:27] [INFO ] Added : 12 causal constraints over 3 iterations in 178 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA HealthRecord-PT-12-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA HealthRecord-PT-12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 160/160 places, 312/312 transitions.
Graph (trivial) has 240 edges and 160 vertex of which 8 / 160 are part of one of the 4 SCC in 7 ms
Free SCC test removed 4 places
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 678 edges and 156 vertex of which 128 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.5 ms
Discarding 28 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Drop transitions removed 116 transitions
Reduce isomorphic transitions removed 116 transitions.
Iterating post reduction 0 with 116 rules applied. Total rules applied 118 place count 128 transition count 163
Discarding 81 places :
Symmetric choice reduction at 1 with 81 rule applications. Total rules 199 place count 47 transition count 82
Iterating global reduction 1 with 81 rules applied. Total rules applied 280 place count 47 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 280 place count 47 transition count 76
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 292 place count 41 transition count 76
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 306 place count 27 transition count 56
Iterating global reduction 1 with 14 rules applied. Total rules applied 320 place count 27 transition count 56
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 329 place count 27 transition count 47
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 332 place count 24 transition count 42
Iterating global reduction 2 with 3 rules applied. Total rules applied 335 place count 24 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 336 place count 24 transition count 41
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 338 place count 22 transition count 39
Iterating global reduction 3 with 2 rules applied. Total rules applied 340 place count 22 transition count 39
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 346 place count 22 transition count 33
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 352 place count 19 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 353 place count 18 transition count 29
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 10 edges and 15 vertex of which 6 / 15 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 6 rules applied. Total rules applied 359 place count 10 transition count 27
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 375 place count 9 transition count 12
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 376 place count 9 transition count 11
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 379 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 381 place count 5 transition count 8
Applied a total of 381 rules in 81 ms. Remains 5 /160 variables (removed 155) and now considering 8/312 (removed 304) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/160 places, 8/312 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 09:53:27] [INFO ] Computed 0 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 200041 resets, run finished after 764 ms. (steps per millisecond=1308 ) properties (out of 3) seen :3
FORMULA HealthRecord-PT-12-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-12-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 8341 ms.

BK_STOP 1652694808428

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

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