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.r096-smll-165260576200389.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 GPUForwardProgress-PT-24b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260576200389
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 6.5K Apr 29 12:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 29 12:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 12:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 29 12:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 122K 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 GPUForwardProgress-PT-24b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-24b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652730360112

Running Version 202205111006
[2022-05-16 19:46:02] [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 19:46:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 19:46:02] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2022-05-16 19:46:02] [INFO ] Transformed 492 places.
[2022-05-16 19:46:02] [INFO ] Transformed 517 transitions.
[2022-05-16 19:46:02] [INFO ] Found NUPN structural information;
[2022-05-16 19:46:02] [INFO ] Parsed PT model containing 492 places and 517 transitions in 399 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 517 rows 492 cols
[2022-05-16 19:46:02] [INFO ] Computed 26 place invariants in 48 ms
Incomplete random walk after 10000 steps, including 49 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :5
FORMULA GPUForwardProgress-PT-24b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :1
FORMULA GPUForwardProgress-PT-24b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :0
// Phase 1: matrix 517 rows 492 cols
[2022-05-16 19:46:03] [INFO ] Computed 26 place invariants in 9 ms
[2022-05-16 19:46:03] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 42 ms returned sat
[2022-05-16 19:46:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:04] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2022-05-16 19:46:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:46:04] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 28 ms returned sat
[2022-05-16 19:46:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:04] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2022-05-16 19:46:04] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 83 ms.
[2022-05-16 19:46:06] [INFO ] Added : 143 causal constraints over 29 iterations in 1440 ms. Result :sat
Minimization took 101 ms.
[2022-05-16 19:46:06] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 37 ms returned sat
[2022-05-16 19:46:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:06] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2022-05-16 19:46:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:46:07] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 39 ms returned sat
[2022-05-16 19:46:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:07] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2022-05-16 19:46:07] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 58 ms.
[2022-05-16 19:46:08] [INFO ] Added : 99 causal constraints over 20 iterations in 1054 ms. Result :sat
Minimization took 119 ms.
[2022-05-16 19:46:08] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 35 ms returned sat
[2022-05-16 19:46:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:09] [INFO ] [Real]Absence check using state equation in 256 ms returned sat
[2022-05-16 19:46:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:46:09] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 33 ms returned sat
[2022-05-16 19:46:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:09] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2022-05-16 19:46:09] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 53 ms.
[2022-05-16 19:46:10] [INFO ] Added : 125 causal constraints over 26 iterations in 1198 ms. Result :sat
Minimization took 169 ms.
[2022-05-16 19:46:11] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 20 ms returned sat
[2022-05-16 19:46:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:11] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2022-05-16 19:46:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:46:11] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 26 ms returned sat
[2022-05-16 19:46:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:11] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2022-05-16 19:46:12] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 60 ms.
[2022-05-16 19:46:12] [INFO ] Added : 103 causal constraints over 21 iterations in 791 ms. Result :sat
Minimization took 71 ms.
[2022-05-16 19:46:13] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 32 ms returned sat
[2022-05-16 19:46:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:13] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2022-05-16 19:46:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:46:13] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 34 ms returned sat
[2022-05-16 19:46:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:13] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2022-05-16 19:46:13] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 48 ms.
[2022-05-16 19:46:14] [INFO ] Added : 118 causal constraints over 24 iterations in 895 ms. Result :sat
Minimization took 76 ms.
[2022-05-16 19:46:15] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 32 ms returned sat
[2022-05-16 19:46:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:15] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2022-05-16 19:46:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:46:15] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 32 ms returned sat
[2022-05-16 19:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:15] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2022-05-16 19:46:15] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 48 ms.
[2022-05-16 19:46:16] [INFO ] Added : 103 causal constraints over 21 iterations in 757 ms. Result :sat
Minimization took 71 ms.
[2022-05-16 19:46:16] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 32 ms returned sat
[2022-05-16 19:46:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:17] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2022-05-16 19:46:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:46:17] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 35 ms returned sat
[2022-05-16 19:46:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:17] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2022-05-16 19:46:17] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 45 ms.
[2022-05-16 19:46:19] [INFO ] Added : 132 causal constraints over 27 iterations in 1401 ms. Result :sat
Minimization took 173 ms.
[2022-05-16 19:46:19] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 22 ms returned sat
[2022-05-16 19:46:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:19] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2022-05-16 19:46:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:46:19] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 23 ms returned sat
[2022-05-16 19:46:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:20] [INFO ] [Nat]Absence check using state equation in 303 ms returned sat
[2022-05-16 19:46:20] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 55 ms.
[2022-05-16 19:46:21] [INFO ] Added : 146 causal constraints over 30 iterations in 1452 ms. Result :sat
Minimization took 100 ms.
[2022-05-16 19:46:22] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 24 ms returned sat
[2022-05-16 19:46:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:22] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2022-05-16 19:46:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:46:22] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 27 ms returned sat
[2022-05-16 19:46:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:22] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2022-05-16 19:46:22] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 36 ms.
[2022-05-16 19:46:23] [INFO ] Added : 119 causal constraints over 24 iterations in 922 ms. Result :sat
Minimization took 122 ms.
[2022-05-16 19:46:23] [INFO ] [Real]Absence check using 0 positive and 26 generalized place invariants in 22 ms returned sat
[2022-05-16 19:46:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:24] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2022-05-16 19:46:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 19:46:24] [INFO ] [Nat]Absence check using 0 positive and 26 generalized place invariants in 23 ms returned sat
[2022-05-16 19:46:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 19:46:24] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2022-05-16 19:46:24] [INFO ] Computed and/alt/rep : 511/925/511 causal constraints (skipped 5 transitions) in 37 ms.
[2022-05-16 19:46:25] [INFO ] Added : 129 causal constraints over 26 iterations in 923 ms. Result :sat
Minimization took 93 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA GPUForwardProgress-PT-24b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-24b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 492 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 492/492 places, 516/516 transitions.
Graph (trivial) has 440 edges and 492 vertex of which 7 / 492 are part of one of the 1 SCC in 9 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 735 edges and 486 vertex of which 457 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.4 ms
Discarding 29 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 279 rules applied. Total rules applied 281 place count 457 transition count 226
Reduce places removed 277 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 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 302 rules applied. Total rules applied 583 place count 180 transition count 201
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 584 place count 179 transition count 201
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 584 place count 179 transition count 154
Deduced a syphon composed of 47 places in 1 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 678 place count 132 transition count 154
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 705 place count 105 transition count 127
Iterating global reduction 3 with 27 rules applied. Total rules applied 732 place count 105 transition count 127
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 732 place count 105 transition count 125
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 736 place count 103 transition count 125
Graph (complete) has 197 edges and 103 vertex of which 32 are kept as prefixes of interest. Removing 71 places using SCC suffix rule.1 ms
Discarding 71 places :
Also discarding 70 output transitions
Drop transitions removed 70 transitions
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 3 with 23 rules applied. Total rules applied 759 place count 32 transition count 33
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 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 4 with 48 rules applied. Total rules applied 807 place count 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 808 place count 9 transition count 7
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 7 rules applied. Total rules applied 815 place count 5 transition count 4
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 816 place count 5 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 817 place count 4 transition count 2
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 818 place count 3 transition count 2
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 818 place count 3 transition count 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 820 place count 2 transition count 1
Applied a total of 820 rules in 103 ms. Remains 2 /492 variables (removed 490) and now considering 1/516 (removed 515) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/492 places, 1/516 transitions.
// Phase 1: matrix 1 rows 2 cols
[2022-05-16 19:46:25] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 500000 resets, run finished after 337 ms. (steps per millisecond=2967 ) properties (out of 1) seen :1
FORMULA GPUForwardProgress-PT-24b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 23854 ms.

BK_STOP 1652730386328

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="GPUForwardProgress-PT-24b"
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 GPUForwardProgress-PT-24b, 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 r096-smll-165260576200389"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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