Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r179-tall-171640601900621.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
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 r179-tall-171640601900621
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 22:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K Apr 11 22:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 11 22:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K Apr 11 22:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 199K May 18 16:42 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 1716484175150

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-40b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 17:09:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-23 17:09:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 17:09:36] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-23 17:09:36] [INFO ] Transformed 796 places.
[2024-05-23 17:09:36] [INFO ] Transformed 837 transitions.
[2024-05-23 17:09:36] [INFO ] Found NUPN structural information;
[2024-05-23 17:09:36] [INFO ] Parsed PT model containing 796 places and 837 transitions and 2077 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 837 rows 796 cols
[2024-05-23 17:09:36] [INFO ] Computed 42 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (29 resets) in 70 ms. (140 steps per ms)
FORMULA GPUForwardProgress-PT-40b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100010 steps (29 resets) in 99 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-23 17:09:36] [INFO ] Invariant cache hit.
[2024-05-23 17:09:37] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 28 ms returned sat
[2024-05-23 17:09:37] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2024-05-23 17:09:37] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 60 ms.
[2024-05-23 17:09:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 17:09:38] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 26 ms returned sat
[2024-05-23 17:09:38] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2024-05-23 17:09:38] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 51 ms.
[2024-05-23 17:09:42] [INFO ] Added : 460 causal constraints over 92 iterations in 4556 ms. Result :unknown
[2024-05-23 17:09:43] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 23 ms returned sat
[2024-05-23 17:09:43] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2024-05-23 17:09:43] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 55 ms.
[2024-05-23 17:09:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 17:09:43] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 25 ms returned sat
[2024-05-23 17:09:43] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2024-05-23 17:09:44] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 46 ms.
[2024-05-23 17:09:45] [INFO ] Added : 103 causal constraints over 21 iterations in 1422 ms. Result :sat
Minimization took 430 ms.
[2024-05-23 17:09:46] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 25 ms returned sat
[2024-05-23 17:09:46] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2024-05-23 17:09:46] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 38 ms.
[2024-05-23 17:09:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 17:09:46] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 26 ms returned sat
[2024-05-23 17:09:46] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2024-05-23 17:09:47] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 53 ms.
[2024-05-23 17:09:51] [INFO ] Added : 400 causal constraints over 80 iterations in 4043 ms. Result :sat
Minimization took 509 ms.
[2024-05-23 17:09:51] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 25 ms returned sat
[2024-05-23 17:09:51] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2024-05-23 17:09:52] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 55 ms.
[2024-05-23 17:09:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 17:09:52] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 27 ms returned sat
[2024-05-23 17:09:52] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2024-05-23 17:09:52] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 43 ms.
[2024-05-23 17:09:55] [INFO ] Added : 246 causal constraints over 50 iterations in 2437 ms. Result :sat
Minimization took 508 ms.
[2024-05-23 17:09:55] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 27 ms returned sat
[2024-05-23 17:09:56] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2024-05-23 17:09:56] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 44 ms.
[2024-05-23 17:09:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 17:09:56] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 28 ms returned sat
[2024-05-23 17:09:56] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2024-05-23 17:09:56] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 42 ms.
[2024-05-23 17:09:59] [INFO ] Added : 275 causal constraints over 55 iterations in 2968 ms. Result :sat
Minimization took 501 ms.
[2024-05-23 17:10:00] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 26 ms returned sat
[2024-05-23 17:10:00] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2024-05-23 17:10:00] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 46 ms.
[2024-05-23 17:10:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 17:10:01] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 26 ms returned sat
[2024-05-23 17:10:01] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2024-05-23 17:10:01] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 47 ms.
[2024-05-23 17:10:05] [INFO ] Added : 433 causal constraints over 87 iterations in 4393 ms. Result :sat
Minimization took 204 ms.
[2024-05-23 17:10:06] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 33 ms returned sat
[2024-05-23 17:10:06] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2024-05-23 17:10:06] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 58 ms.
[2024-05-23 17:10:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 17:10:06] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 27 ms returned sat
[2024-05-23 17:10:07] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2024-05-23 17:10:07] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 48 ms.
[2024-05-23 17:10:10] [INFO ] Added : 230 causal constraints over 46 iterations in 3128 ms. Result :unknown
[2024-05-23 17:10:10] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 27 ms returned sat
[2024-05-23 17:10:10] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2024-05-23 17:10:10] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 47 ms.
[2024-05-23 17:10:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 17:10:11] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 26 ms returned sat
[2024-05-23 17:10:11] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2024-05-23 17:10:11] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 43 ms.
[2024-05-23 17:10:15] [INFO ] Added : 388 causal constraints over 78 iterations in 3802 ms. Result :sat
Minimization took 427 ms.
[2024-05-23 17:10:15] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 26 ms returned sat
[2024-05-23 17:10:15] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2024-05-23 17:10:16] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 47 ms.
[2024-05-23 17:10:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 17:10:16] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 26 ms returned sat
[2024-05-23 17:10:16] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2024-05-23 17:10:16] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 45 ms.
[2024-05-23 17:10:21] [INFO ] Added : 415 causal constraints over 83 iterations in 4509 ms. Result :sat
Minimization took 73 ms.
[2024-05-23 17:10:21] [INFO ] [Real]Absence check using 0 positive and 42 generalized place invariants in 26 ms returned sat
[2024-05-23 17:10:21] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2024-05-23 17:10:21] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 50 ms.
[2024-05-23 17:10:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 17:10:22] [INFO ] [Nat]Absence check using 0 positive and 42 generalized place invariants in 27 ms returned sat
[2024-05-23 17:10:22] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2024-05-23 17:10:22] [INFO ] Computed and/alt/rep : 831/1517/831 causal constraints (skipped 5 transitions) in 46 ms.
Maximisation of solution failed !
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA GPUForwardProgress-PT-40b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
Support contains 6 out of 796 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 796/796 places, 837/837 transitions.
Graph (trivial) has 705 edges and 796 vertex of which 7 / 796 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 447 transitions
Trivial Post-agglo rules discarded 447 transitions
Performed 447 trivial Post agglomeration. Transition count delta: 447
Iterating post reduction 0 with 448 rules applied. Total rules applied 449 place count 789 transition count 382
Reduce places removed 447 places and 0 transitions.
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 486 rules applied. Total rules applied 935 place count 342 transition count 343
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 938 place count 341 transition count 341
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 940 place count 339 transition count 341
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 79 Pre rules applied. Total rules applied 940 place count 339 transition count 262
Deduced a syphon composed of 79 places in 1 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 4 with 158 rules applied. Total rules applied 1098 place count 260 transition count 262
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1101 place count 257 transition count 259
Iterating global reduction 4 with 3 rules applied. Total rules applied 1104 place count 257 transition count 259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1104 place count 257 transition count 258
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1106 place count 256 transition count 258
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 4 with 238 rules applied. Total rules applied 1344 place count 137 transition count 139
Drop transitions (Empty/Sink Transition effects.) removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 1381 place count 137 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1385 place count 135 transition count 102
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1386 place count 135 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1389 place count 135 transition count 98
Free-agglomeration rule applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 1392 place count 135 transition count 95
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1395 place count 132 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1396 place count 131 transition count 94
Applied a total of 1396 rules in 143 ms. Remains 131 /796 variables (removed 665) and now considering 94/837 (removed 743) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 131/796 places, 94/837 transitions.
// Phase 1: matrix 94 rows 131 cols
[2024-05-23 17:10:27] [INFO ] Computed 41 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (6824 resets) in 3478 ms. (287 steps per ms)
FORMULA GPUForwardProgress-PT-40b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-40b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (412 resets) in 802 ms. (1245 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 55763 ms.
ITS solved all properties within timeout

BK_STOP 1716484232172

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
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 r179-tall-171640601900621"
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 ;