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.r197-tall-171640625500369.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 gold2023
Input is GPUForwardProgress-PT-32b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625500369
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 9.9K Apr 11 22:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 11 22:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 11 22:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 11 22:23 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 160K 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716555216001

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-32b
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-24 12:53:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 12:53:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:53:37] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2024-05-24 12:53:37] [INFO ] Transformed 644 places.
[2024-05-24 12:53:37] [INFO ] Transformed 677 transitions.
[2024-05-24 12:53:37] [INFO ] Found NUPN structural information;
[2024-05-24 12:53:37] [INFO ] Parsed PT model containing 644 places and 677 transitions and 1677 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 37 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 13) seen :6
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :2
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 677 rows 644 cols
[2024-05-24 12:53:38] [INFO ] Computed 34 invariants in 20 ms
[2024-05-24 12:53:38] [INFO ] [Real]Absence check using 0 positive and 34 generalized place invariants in 25 ms returned sat
[2024-05-24 12:53:38] [INFO ] After 364ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 12:53:38] [INFO ] [Nat]Absence check using 0 positive and 34 generalized place invariants in 24 ms returned sat
[2024-05-24 12:53:39] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-24 12:53:39] [INFO ] After 760ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 259 ms.
[2024-05-24 12:53:40] [INFO ] After 1295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 86 ms.
Support contains 74 out of 644 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 644/644 places, 677/677 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 254 transitions
Trivial Post-agglo rules discarded 254 transitions
Performed 254 trivial Post agglomeration. Transition count delta: 254
Iterating post reduction 0 with 255 rules applied. Total rules applied 255 place count 643 transition count 423
Reduce places removed 254 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 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 270 rules applied. Total rules applied 525 place count 389 transition count 407
Reduce places removed 1 places and 0 transitions.
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Iterating post reduction 2 with 35 rules applied. Total rules applied 560 place count 388 transition count 373
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 597 place count 354 transition count 370
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 47 Pre rules applied. Total rules applied 597 place count 354 transition count 323
Deduced a syphon composed of 47 places in 2 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 4 with 94 rules applied. Total rules applied 691 place count 307 transition count 323
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 700 place count 298 transition count 314
Iterating global reduction 4 with 9 rules applied. Total rules applied 709 place count 298 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 711 place count 298 transition count 312
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 711 place count 298 transition count 310
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 715 place count 296 transition count 310
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 849 place count 229 transition count 243
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 869 place count 219 transition count 244
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 874 place count 219 transition count 239
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 879 place count 219 transition count 234
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 884 place count 214 transition count 234
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 887 place count 214 transition count 234
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 888 place count 213 transition count 233
Applied a total of 888 rules in 251 ms. Remains 213 /644 variables (removed 431) and now considering 233/677 (removed 444) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 213/644 places, 233/677 transitions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 239 ms. (steps per millisecond=41 ) properties (out of 5) seen :2
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-24 12:53:40] [INFO ] Flow matrix only has 225 transitions (discarded 8 similar events)
// Phase 1: matrix 225 rows 213 cols
[2024-05-24 12:53:40] [INFO ] Computed 33 invariants in 6 ms
[2024-05-24 12:53:40] [INFO ] After 165ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 12:53:40] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 11 ms returned sat
[2024-05-24 12:53:41] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 12:53:41] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-24 12:53:41] [INFO ] After 78ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 12:53:41] [INFO ] After 178ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 83 ms.
[2024-05-24 12:53:41] [INFO ] After 533ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 70 out of 213 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 213/213 places, 233/233 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 213 transition count 230
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 210 transition count 230
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 14 place count 206 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 206 transition count 224
Applied a total of 16 rules in 14 ms. Remains 206 /213 variables (removed 7) and now considering 224/233 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 206/213 places, 224/233 transitions.
Incomplete random walk after 10000 steps, including 55 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :1
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 12:53:41] [INFO ] Flow matrix only has 215 transitions (discarded 9 similar events)
// Phase 1: matrix 215 rows 206 cols
[2024-05-24 12:53:41] [INFO ] Computed 33 invariants in 2 ms
[2024-05-24 12:53:41] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 12:53:41] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 10 ms returned sat
[2024-05-24 12:53:41] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 12:53:41] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-24 12:53:41] [INFO ] After 30ms SMT Verify possible using 44 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 12:53:42] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-24 12:53:42] [INFO ] After 238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 21 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 224/224 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 206 transition count 199
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 28 rules applied. Total rules applied 53 place count 181 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 180 transition count 196
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 54 place count 180 transition count 176
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 94 place count 160 transition count 176
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 95 place count 159 transition count 174
Iterating global reduction 3 with 1 rules applied. Total rules applied 96 place count 159 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 159 transition count 173
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 97 place count 159 transition count 172
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 99 place count 158 transition count 172
Performed 23 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 145 place count 135 transition count 147
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 151 place count 135 transition count 141
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 153 place count 135 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 155 place count 133 transition count 139
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 159 place count 133 transition count 139
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 160 place count 133 transition count 138
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 161 place count 132 transition count 137
Iterating global reduction 6 with 1 rules applied. Total rules applied 162 place count 132 transition count 137
Applied a total of 162 rules in 53 ms. Remains 132 /206 variables (removed 74) and now considering 137/224 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 132/206 places, 137/224 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:53:42] [INFO ] Flow matrix only has 114 transitions (discarded 23 similar events)
// Phase 1: matrix 114 rows 132 cols
[2024-05-24 12:53:42] [INFO ] Computed 33 invariants in 2 ms
[2024-05-24 12:53:42] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:53:42] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 5 ms returned sat
[2024-05-24 12:53:42] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 12:53:42] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-24 12:53:42] [INFO ] After 10ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 12:53:42] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-24 12:53:42] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 137/137 transitions.
Graph (trivial) has 39 edges and 132 vertex of which 2 / 132 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 131 transition count 125
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 121 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 120 transition count 124
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 23 place count 120 transition count 117
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 37 place count 113 transition count 117
Performed 8 Post agglomeration using F-continuation condition with reduction of 5 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 53 place count 105 transition count 104
Drop transitions removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 82 place count 105 transition count 75
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 82 place count 105 transition count 72
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 88 place count 102 transition count 72
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 91 place count 102 transition count 72
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 94 place count 102 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 95 place count 101 transition count 68
Applied a total of 95 rules in 23 ms. Remains 101 /132 variables (removed 31) and now considering 68/137 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 101/132 places, 68/137 transitions.
Incomplete random walk after 10000 steps, including 101 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2315996 steps, run timeout after 3001 ms. (steps per millisecond=771 ) properties seen :{}
Probabilistic random walk after 2315996 steps, saw 400112 distinct states, run finished after 3003 ms. (steps per millisecond=771 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 68 rows 101 cols
[2024-05-24 12:53:45] [INFO ] Computed 33 invariants in 1 ms
[2024-05-24 12:53:45] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:53:45] [INFO ] [Nat]Absence check using 0 positive and 33 generalized place invariants in 5 ms returned sat
[2024-05-24 12:53:45] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 12:53:45] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-24 12:53:45] [INFO ] After 22ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 12:53:45] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-24 12:53:45] [INFO ] After 114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 68/68 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 101/101 places, 68/68 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 68/68 transitions.
Applied a total of 0 rules in 4 ms. Remains 101 /101 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-24 12:53:45] [INFO ] Invariant cache hit.
[2024-05-24 12:53:45] [INFO ] Implicit Places using invariants in 92 ms returned [96]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 117 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 100/101 places, 68/68 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 124 ms. Remains : 100/101 places, 68/68 transitions.
Incomplete random walk after 10000 steps, including 101 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2464778 steps, run timeout after 3001 ms. (steps per millisecond=821 ) properties seen :{}
Probabilistic random walk after 2464778 steps, saw 426949 distinct states, run finished after 3001 ms. (steps per millisecond=821 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 68 rows 100 cols
[2024-05-24 12:53:48] [INFO ] Computed 32 invariants in 2 ms
[2024-05-24 12:53:48] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:53:48] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 4 ms returned sat
[2024-05-24 12:53:48] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 12:53:48] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-24 12:53:48] [INFO ] After 5ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 12:53:48] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-24 12:53:48] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 68/68 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 100/100 places, 68/68 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 68/68 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-24 12:53:48] [INFO ] Invariant cache hit.
[2024-05-24 12:53:48] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-24 12:53:48] [INFO ] Invariant cache hit.
[2024-05-24 12:53:49] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-24 12:53:49] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-24 12:53:49] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 12:53:49] [INFO ] Invariant cache hit.
[2024-05-24 12:53:49] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 292 ms. Remains : 100/100 places, 68/68 transitions.
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 32 Pre rules applied. Total rules applied 0 place count 100 transition count 36
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 64 rules applied. Total rules applied 64 place count 68 transition count 36
Applied a total of 64 rules in 3 ms. Remains 68 /100 variables (removed 32) and now considering 36/68 (removed 32) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 36 rows 68 cols
[2024-05-24 12:53:49] [INFO ] Computed 32 invariants in 2 ms
[2024-05-24 12:53:49] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:53:49] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 4 ms returned sat
[2024-05-24 12:53:49] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 12:53:49] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-24 12:53:49] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-24 12:53:49] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 2 ms.
[2024-05-24 12:53:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 100 places, 68 transitions and 295 arcs took 2 ms.
[2024-05-24 12:53:49] [INFO ] Flatten gal took : 74 ms
Total runtime 12127 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT GPUForwardProgress-PT-32b
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
ReachabilityCardinality

FORMULA GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716555230737

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 5 (type SKEL/FNDP) for 0 GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 6 (type SKEL/EQUN) for 0 GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 8 (type SKEL/SRCH) for 0 GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 9 (type SKEL/SRCH) for 0 GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 8 (type SKEL/SRCH) for GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-10
lola: result : false
lola: markings : 3
lola: fired transitions : 2
lola: time used : 0.000000
lola: memory pages used : 1
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: CANCELED task # 5 (type FNDP) for GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-10 (obsolete)
lola: CANCELED task # 6 (type EQUN) for GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-10 (obsolete)
lola: CANCELED task # 9 (type SRCH) for GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-10 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
GPUForwardProgress-PT-32b-ReachabilityCardinality-2024-10: AG true skeleton: tandem / insertion


Time elapsed: 0 secs. Pages in use: 2

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-32b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is GPUForwardProgress-PT-32b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-tall-171640625500369"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-32b.tgz
mv GPUForwardProgress-PT-32b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;