fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r107-smll-165260580500169
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for GPUForwardProgress-PT-40b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
308.539 55320.00 79102.00 542.40 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 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.r107-smll-165260580500169.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 gold2021
Input is GPUForwardProgress-PT-40b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-smll-165260580500169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 6.6K Apr 29 12:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 29 12:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 29 12:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Apr 29 12:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 07:57 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 199K 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-40b-UpperBounds-00
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-01
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-02
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-03
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-04
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-05
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-06
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-07
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-08
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-09
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-10
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-11
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-12
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-13
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-14
FORMULA_NAME GPUForwardProgress-PT-40b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652647678347

Running Version 0
[2022-05-15 20:48:01] [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-15 20:48:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:48:02] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2022-05-15 20:48:02] [INFO ] Transformed 796 places.
[2022-05-15 20:48:02] [INFO ] Transformed 837 transitions.
[2022-05-15 20:48:02] [INFO ] Found NUPN structural information;
[2022-05-15 20:48:02] [INFO ] Parsed PT model containing 796 places and 837 transitions in 252 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
// Phase 1: matrix 837 rows 796 cols
[2022-05-15 20:48:02] [INFO ] Computed 42 place invariants in 46 ms
Incomplete random walk after 10000 steps, including 30 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 16) seen :7
FORMULA GPUForwardProgress-PT-40b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 9) seen :0
// Phase 1: matrix 837 rows 796 cols
[2022-05-15 20:48:02] [INFO ] Computed 42 place invariants in 22 ms
[2022-05-15 20:48:02] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 42 ms returned sat
[2022-05-15 20:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:03] [INFO ] [Real]Absence check using state equation in 618 ms returned sat
[2022-05-15 20:48:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:48:04] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 42 ms returned sat
[2022-05-15 20:48:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:04] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2022-05-15 20:48:04] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 87 ms.
[2022-05-15 20:48:07] [INFO ] Added : 158 causal constraints over 32 iterations in 2574 ms. Result :sat
Minimization took 195 ms.
[2022-05-15 20:48:07] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 55 ms returned sat
[2022-05-15 20:48:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:08] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2022-05-15 20:48:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:48:08] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 63 ms returned sat
[2022-05-15 20:48:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:09] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2022-05-15 20:48:09] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 105 ms.
[2022-05-15 20:48:13] [INFO ] Added : 220 causal constraints over 44 iterations in 4089 ms. Result :unknown
[2022-05-15 20:48:13] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 62 ms returned sat
[2022-05-15 20:48:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:14] [INFO ] [Real]Absence check using state equation in 639 ms returned sat
[2022-05-15 20:48:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:48:14] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 64 ms returned sat
[2022-05-15 20:48:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:15] [INFO ] [Nat]Absence check using state equation in 562 ms returned sat
[2022-05-15 20:48:15] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 104 ms.
[2022-05-15 20:48:18] [INFO ] Added : 186 causal constraints over 38 iterations in 3567 ms. Result :sat
Minimization took 282 ms.
[2022-05-15 20:48:19] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 39 ms returned sat
[2022-05-15 20:48:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:19] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2022-05-15 20:48:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:48:20] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 39 ms returned sat
[2022-05-15 20:48:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:20] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2022-05-15 20:48:20] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 93 ms.
[2022-05-15 20:48:22] [INFO ] Added : 158 causal constraints over 32 iterations in 2145 ms. Result :sat
Minimization took 198 ms.
[2022-05-15 20:48:23] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 57 ms returned sat
[2022-05-15 20:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:23] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2022-05-15 20:48:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:48:24] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 38 ms returned sat
[2022-05-15 20:48:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:24] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2022-05-15 20:48:24] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 75 ms.
[2022-05-15 20:48:28] [INFO ] Added : 186 causal constraints over 38 iterations in 3453 ms. Result :sat
Minimization took 257 ms.
[2022-05-15 20:48:28] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 60 ms returned sat
[2022-05-15 20:48:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:29] [INFO ] [Real]Absence check using state equation in 558 ms returned sat
[2022-05-15 20:48:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:48:29] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 63 ms returned sat
[2022-05-15 20:48:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:30] [INFO ] [Nat]Absence check using state equation in 553 ms returned sat
[2022-05-15 20:48:30] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 84 ms.
[2022-05-15 20:48:32] [INFO ] Added : 180 causal constraints over 36 iterations in 2678 ms. Result :sat
Minimization took 208 ms.
[2022-05-15 20:48:33] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 56 ms returned sat
[2022-05-15 20:48:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:34] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2022-05-15 20:48:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:48:34] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 62 ms returned sat
[2022-05-15 20:48:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:34] [INFO ] [Nat]Absence check using state equation in 539 ms returned sat
[2022-05-15 20:48:35] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 81 ms.
[2022-05-15 20:48:38] [INFO ] Added : 205 causal constraints over 41 iterations in 3723 ms. Result :sat
Minimization took 260 ms.
[2022-05-15 20:48:39] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 60 ms returned sat
[2022-05-15 20:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:39] [INFO ] [Real]Absence check using state equation in 546 ms returned sat
[2022-05-15 20:48:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:48:40] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 58 ms returned sat
[2022-05-15 20:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:40] [INFO ] [Nat]Absence check using state equation in 511 ms returned sat
[2022-05-15 20:48:40] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 79 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2022-05-15 20:48:45] [INFO ] Added : 250 causal constraints over 50 iterations in 4206 ms. Result :unknown
[2022-05-15 20:48:45] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 59 ms returned sat
[2022-05-15 20:48:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:45] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2022-05-15 20:48:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 20:48:46] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 61 ms returned sat
[2022-05-15 20:48:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 20:48:46] [INFO ] [Nat]Absence check using state equation in 540 ms returned sat
[2022-05-15 20:48:46] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 90 ms.
[2022-05-15 20:48:51] [INFO ] Added : 239 causal constraints over 48 iterations in 4131 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 14600 steps, including 115 resets, run finished after 86 ms. (steps per millisecond=169 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 14200 steps, including 115 resets, run finished after 79 ms. (steps per millisecond=179 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 21500 steps, including 166 resets, run finished after 80 ms. (steps per millisecond=268 ) properties (out of 9) seen :3 could not realise parikh vector
FORMULA GPUForwardProgress-PT-40b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 15300 steps, including 126 resets, run finished after 63 ms. (steps per millisecond=242 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 27700 steps, including 196 resets, run finished after 110 ms. (steps per millisecond=251 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 15700 steps, including 129 resets, run finished after 66 ms. (steps per millisecond=237 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 6 out of 796 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 796/796 places, 837/837 transitions.
Graph (trivial) has 700 edges and 796 vertex of which 7 / 796 are part of one of the 1 SCC in 19 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1200 edges and 790 vertex of which 745 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.8 ms
Discarding 45 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 442 transitions
Trivial Post-agglo rules discarded 442 transitions
Performed 442 trivial Post agglomeration. Transition count delta: 442
Iterating post reduction 0 with 444 rules applied. Total rules applied 446 place count 745 transition count 382
Reduce places removed 442 places and 0 transitions.
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 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 479 rules applied. Total rules applied 925 place count 303 transition count 345
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 931 place count 302 transition count 340
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 937 place count 297 transition count 339
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 937 place count 297 transition count 264
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 1087 place count 222 transition count 264
Discarding 44 places :
Symmetric choice reduction at 4 with 44 rule applications. Total rules 1131 place count 178 transition count 220
Iterating global reduction 4 with 44 rules applied. Total rules applied 1175 place count 178 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1176 place count 178 transition count 219
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 1176 place count 178 transition count 216
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1182 place count 175 transition count 216
Graph (complete) has 336 edges and 175 vertex of which 69 are kept as prefixes of interest. Removing 106 places using SCC suffix rule.0 ms
Discarding 106 places :
Also discarding 105 output transitions
Drop transitions removed 105 transitions
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 5 with 32 rules applied. Total rules applied 1214 place count 69 transition count 80
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 71 rules applied. Total rules applied 1285 place count 38 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1286 place count 37 transition count 40
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 1286 place count 37 transition count 37
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1292 place count 34 transition count 37
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 1295 place count 31 transition count 34
Iterating global reduction 8 with 3 rules applied. Total rules applied 1298 place count 31 transition count 34
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 23 rules applied. Total rules applied 1321 place count 19 transition count 23
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 1323 place count 19 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1324 place count 19 transition count 20
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1325 place count 19 transition count 20
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1326 place count 19 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 1327 place count 18 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1328 place count 17 transition count 18
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 5 Pre rules applied. Total rules applied 1328 place count 17 transition count 13
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 11 with 10 rules applied. Total rules applied 1338 place count 12 transition count 13
Applied a total of 1338 rules in 207 ms. Remains 12 /796 variables (removed 784) and now considering 13/837 (removed 824) transitions.
Finished structural reductions, in 1 iterations. Remains : 12/796 places, 13/837 transitions.
// Phase 1: matrix 13 rows 12 cols
[2022-05-15 20:48:51] [INFO ] Computed 4 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 782 ms. (steps per millisecond=1278 ) properties (out of 6) seen :6
FORMULA GPUForwardProgress-PT-40b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1652647733667

--------------------
content from stderr:

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-40b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is GPUForwardProgress-PT-40b, 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 r107-smll-165260580500169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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