fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r069-smll-174854075800009
Last Updated
June 24, 2025

About the Execution of 2024-gold for DBSingleClientW-PT-d1m05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15684.380 81420.00 134814.00 486.60 0 2 0 0 0 1 1 1 0 3 0 0 0 1 0 0 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r069-smll-174854075800009.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is DBSingleClientW-PT-d1m05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075800009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 872K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 432K May 29 14:32 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

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

=== Now, execution of the tool begins

BK_START 1748601701311

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 10:41:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 10:41:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:41:44] [INFO ] Load time of PNML (sax parser for PT used): 242 ms
[2025-05-30 10:41:44] [INFO ] Transformed 1440 places.
[2025-05-30 10:41:44] [INFO ] Transformed 672 transitions.
[2025-05-30 10:41:44] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 592 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Deduced a syphon composed of 1093 places in 8 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 672 rows 347 cols
[2025-05-30 10:41:44] [INFO ] Computed 6 invariants in 53 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 5, 1042, 5, 5]
RANDOM walk for 10000 steps (2314 resets) in 210 ms. (47 steps per ms)
BEST_FIRST walk for 60002 steps (5739 resets) in 363 ms. (164 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0, 2, 0] Max Struct:[5, 5, 5, 1042, 5, 5]
[2025-05-30 10:41:45] [INFO ] Invariant cache hit.
[2025-05-30 10:41:45] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2025-05-30 10:41:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2025-05-30 10:41:45] [INFO ] [Real]Absence check using state equation in 316 ms returned sat
[2025-05-30 10:41:46] [INFO ] State equation strengthened by 418 read => feed constraints.
[2025-05-30 10:41:46] [INFO ] [Real]Added 418 Read/Feed constraints in 131 ms returned sat
[2025-05-30 10:41:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2025-05-30 10:41:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2025-05-30 10:41:46] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2025-05-30 10:41:46] [INFO ] [Nat]Added 418 Read/Feed constraints in 116 ms returned sat
[2025-05-30 10:41:47] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 195 ms.
[2025-05-30 10:41:47] [INFO ] Added : 6 causal constraints over 2 iterations in 453 ms. Result :sat
Minimization took 732 ms.
[2025-05-30 10:41:48] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2025-05-30 10:41:48] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned unsat
[2025-05-30 10:41:48] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2025-05-30 10:41:48] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2025-05-30 10:41:48] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2025-05-30 10:41:48] [INFO ] [Real]Added 418 Read/Feed constraints in 232 ms returned sat
[2025-05-30 10:41:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2025-05-30 10:41:49] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2025-05-30 10:41:49] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2025-05-30 10:41:49] [INFO ] [Nat]Added 418 Read/Feed constraints in 210 ms returned sat
[2025-05-30 10:41:49] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 141 ms.
[2025-05-30 10:41:50] [INFO ] Added : 2 causal constraints over 1 iterations in 311 ms. Result :sat
Minimization took 563 ms.
[2025-05-30 10:41:50] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2025-05-30 10:41:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2025-05-30 10:41:51] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2025-05-30 10:41:51] [INFO ] [Real]Added 418 Read/Feed constraints in 150 ms returned sat
[2025-05-30 10:41:51] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2025-05-30 10:41:51] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2025-05-30 10:41:51] [INFO ] [Nat]Absence check using state equation in 263 ms returned sat
[2025-05-30 10:41:51] [INFO ] [Nat]Added 418 Read/Feed constraints in 120 ms returned sat
[2025-05-30 10:41:52] [INFO ] Deduced a trap composed of 101 places in 324 ms of which 43 ms to minimize.
[2025-05-30 10:41:52] [INFO ] Deduced a trap composed of 103 places in 546 ms of which 7 ms to minimize.
[2025-05-30 10:41:52] [INFO ] Deduced a trap composed of 99 places in 238 ms of which 3 ms to minimize.
[2025-05-30 10:41:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1246 ms
[2025-05-30 10:41:53] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 75 ms.
[2025-05-30 10:41:53] [INFO ] Deduced a trap composed of 33 places in 218 ms of which 4 ms to minimize.
[2025-05-30 10:41:53] [INFO ] Deduced a trap composed of 27 places in 385 ms of which 6 ms to minimize.
[2025-05-30 10:41:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 806 ms
[2025-05-30 10:41:54] [INFO ] Added : 12 causal constraints over 4 iterations in 1253 ms. Result :sat
Minimization took 559 ms.
[2025-05-30 10:41:54] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2025-05-30 10:41:54] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2025-05-30 10:41:55] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2025-05-30 10:41:55] [INFO ] [Real]Added 418 Read/Feed constraints in 215 ms returned sat
[2025-05-30 10:41:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2025-05-30 10:41:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2025-05-30 10:41:55] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2025-05-30 10:41:56] [INFO ] [Nat]Added 418 Read/Feed constraints in 183 ms returned sat
[2025-05-30 10:41:56] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 118 ms.
[2025-05-30 10:41:56] [INFO ] Added : 1 causal constraints over 1 iterations in 286 ms. Result :sat
Minimization took 608 ms.
[2025-05-30 10:41:57] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2025-05-30 10:41:57] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2025-05-30 10:41:57] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2025-05-30 10:41:57] [INFO ] [Real]Added 418 Read/Feed constraints in 156 ms returned sat
[2025-05-30 10:41:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:41:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2025-05-30 10:41:57] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2025-05-30 10:41:58] [INFO ] [Nat]Absence check using state equation in 313 ms returned sat
[2025-05-30 10:41:58] [INFO ] [Nat]Added 418 Read/Feed constraints in 170 ms returned sat
[2025-05-30 10:41:58] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 81 ms.
[2025-05-30 10:41:58] [INFO ] Added : 2 causal constraints over 1 iterations in 215 ms. Result :sat
Minimization took 557 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0, 2, 0] Max Struct:[5, 1, 5, 1042, 5, 5]
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 2, 0] Max Struct:[5, 5, 1042, 5, 5]
Support contains 5 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 184 place count 230 transition count 328
Iterating global reduction 1 with 95 rules applied. Total rules applied 279 place count 230 transition count 328
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 283 place count 230 transition count 324
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 354 place count 159 transition count 253
Iterating global reduction 2 with 71 rules applied. Total rules applied 425 place count 159 transition count 253
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 431 place count 159 transition count 247
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 472 place count 118 transition count 184
Iterating global reduction 3 with 41 rules applied. Total rules applied 513 place count 118 transition count 184
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 536 place count 118 transition count 161
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 546 place count 108 transition count 145
Iterating global reduction 4 with 10 rules applied. Total rules applied 556 place count 108 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 558 place count 108 transition count 143
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 564 place count 102 transition count 137
Iterating global reduction 5 with 6 rules applied. Total rules applied 570 place count 102 transition count 137
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 572 place count 102 transition count 135
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 576 place count 98 transition count 131
Iterating global reduction 6 with 4 rules applied. Total rules applied 580 place count 98 transition count 131
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 581 place count 98 transition count 130
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 582 place count 97 transition count 128
Iterating global reduction 7 with 1 rules applied. Total rules applied 583 place count 97 transition count 128
Applied a total of 583 rules in 144 ms. Remains 97 /347 variables (removed 250) and now considering 128/672 (removed 544) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 97/347 places, 128/672 transitions.
// Phase 1: matrix 128 rows 97 cols
[2025-05-30 10:41:59] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 2, 0] Max Struct:[5, 5, 1042, 5, 5]
RANDOM walk for 1000000 steps (229900 resets) in 1311 ms. (762 steps per ms)
BEST_FIRST walk for 5000002 steps (491325 resets) in 3623 ms. (1379 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 3, 1] Max Struct:[5, 5, 1042, 5, 5]
[2025-05-30 10:42:04] [INFO ] Invariant cache hit.
[2025-05-30 10:42:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:42:04] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2025-05-30 10:42:04] [INFO ] State equation strengthened by 40 read => feed constraints.
[2025-05-30 10:42:04] [INFO ] [Real]Added 40 Read/Feed constraints in 9 ms returned sat
[2025-05-30 10:42:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:42:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:42:04] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2025-05-30 10:42:04] [INFO ] [Nat]Added 40 Read/Feed constraints in 10 ms returned sat
[2025-05-30 10:42:04] [INFO ] Computed and/alt/rep : 35/85/35 causal constraints (skipped 92 transitions) in 10 ms.
[2025-05-30 10:42:04] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2025-05-30 10:42:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2025-05-30 10:42:04] [INFO ] Added : 14 causal constraints over 3 iterations in 158 ms. Result :sat
Minimization took 114 ms.
[2025-05-30 10:42:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:42:04] [INFO ] [Real]Absence check using state equation in 30 ms returned unsat
[2025-05-30 10:42:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:42:04] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-05-30 10:42:04] [INFO ] [Real]Added 40 Read/Feed constraints in 9 ms returned sat
[2025-05-30 10:42:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:42:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:42:05] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2025-05-30 10:42:05] [INFO ] [Nat]Added 40 Read/Feed constraints in 13 ms returned sat
[2025-05-30 10:42:05] [INFO ] Computed and/alt/rep : 35/85/35 causal constraints (skipped 92 transitions) in 11 ms.
[2025-05-30 10:42:05] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2025-05-30 10:42:05] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
[2025-05-30 10:42:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 217 ms
[2025-05-30 10:42:05] [INFO ] Added : 15 causal constraints over 5 iterations in 312 ms. Result :sat
Minimization took 82 ms.
[2025-05-30 10:42:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:42:05] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-05-30 10:42:05] [INFO ] [Real]Added 40 Read/Feed constraints in 15 ms returned sat
[2025-05-30 10:42:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:42:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:42:05] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2025-05-30 10:42:05] [INFO ] [Nat]Added 40 Read/Feed constraints in 11 ms returned sat
[2025-05-30 10:42:05] [INFO ] Computed and/alt/rep : 35/85/35 causal constraints (skipped 92 transitions) in 18 ms.
[2025-05-30 10:42:05] [INFO ] Added : 1 causal constraints over 1 iterations in 48 ms. Result :sat
Minimization took 60 ms.
[2025-05-30 10:42:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:42:05] [INFO ] [Real]Absence check using state equation in 48 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 3, 1] Max Struct:[5, 1, 1042, 5, 1]
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 3] Max Struct:[5, 1042, 5]
Support contains 3 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 128/128 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 95 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 95 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 93 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 93 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 91 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 91 transition count 118
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 89 transition count 116
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 89 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 89 transition count 115
Applied a total of 17 rules in 36 ms. Remains 89 /97 variables (removed 8) and now considering 115/128 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 89/97 places, 115/128 transitions.
// Phase 1: matrix 115 rows 89 cols
[2025-05-30 10:42:06] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 3] Max Struct:[5, 1042, 5]
RANDOM walk for 1000000 steps (229355 resets) in 1589 ms. (628 steps per ms)
BEST_FIRST walk for 3000001 steps (296642 resets) in 1851 ms. (1619 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 3] Max Struct:[5, 1042, 5]
[2025-05-30 10:42:09] [INFO ] Invariant cache hit.
[2025-05-30 10:42:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:42:09] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2025-05-30 10:42:09] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 10:42:09] [INFO ] [Real]Added 38 Read/Feed constraints in 11 ms returned sat
[2025-05-30 10:42:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:42:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:42:09] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2025-05-30 10:42:09] [INFO ] [Nat]Added 38 Read/Feed constraints in 7 ms returned sat
[2025-05-30 10:42:09] [INFO ] Computed and/alt/rep : 31/72/31 causal constraints (skipped 83 transitions) in 12 ms.
[2025-05-30 10:42:09] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2025-05-30 10:42:10] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2025-05-30 10:42:10] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2025-05-30 10:42:10] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2025-05-30 10:42:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 395 ms
[2025-05-30 10:42:10] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2025-05-30 10:42:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2025-05-30 10:42:10] [INFO ] Added : 8 causal constraints over 3 iterations in 605 ms. Result :sat
Minimization took 141 ms.
[2025-05-30 10:42:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:42:10] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2025-05-30 10:42:10] [INFO ] [Real]Added 38 Read/Feed constraints in 14 ms returned sat
[2025-05-30 10:42:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:42:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:42:10] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2025-05-30 10:42:10] [INFO ] [Nat]Added 38 Read/Feed constraints in 15 ms returned sat
[2025-05-30 10:42:10] [INFO ] Computed and/alt/rep : 31/72/31 causal constraints (skipped 83 transitions) in 16 ms.
[2025-05-30 10:42:10] [INFO ] Added : 10 causal constraints over 2 iterations in 76 ms. Result :sat
Minimization took 92 ms.
[2025-05-30 10:42:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:42:11] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2025-05-30 10:42:11] [INFO ] [Real]Added 38 Read/Feed constraints in 8 ms returned sat
[2025-05-30 10:42:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:42:11] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:42:11] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2025-05-30 10:42:11] [INFO ] [Nat]Added 38 Read/Feed constraints in 11 ms returned sat
[2025-05-30 10:42:11] [INFO ] Computed and/alt/rep : 31/72/31 causal constraints (skipped 83 transitions) in 14 ms.
[2025-05-30 10:42:11] [INFO ] Added : 1 causal constraints over 1 iterations in 45 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 3] Max Struct:[5, 1042, 5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 3] Max Struct:[5, 1042, 5]
Support contains 3 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 115/115 transitions.
Applied a total of 0 rules in 13 ms. Remains 89 /89 variables (removed 0) and now considering 115/115 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 89/89 places, 115/115 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 115/115 transitions.
Applied a total of 0 rules in 13 ms. Remains 89 /89 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2025-05-30 10:42:11] [INFO ] Invariant cache hit.
[2025-05-30 10:42:11] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-05-30 10:42:11] [INFO ] Invariant cache hit.
[2025-05-30 10:42:11] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 10:42:12] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2025-05-30 10:42:12] [INFO ] Redundant transitions in 4 ms returned []
Running 114 sub problems to find dead transitions.
[2025-05-30 10:42:12] [INFO ] Invariant cache hit.
[2025-05-30 10:42:12] [INFO ] State equation strengthened by 38 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/204 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 38/129 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (OVERLAPS) 0/204 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 129 constraints, problems are : Problem set: 0 solved, 114 unsolved in 4646 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 114 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 2 (OVERLAPS) 1/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 4 (OVERLAPS) 115/204 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 38/129 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 114/243 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/204 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 114 unsolved
At refinement iteration 8 (OVERLAPS) 0/204 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 114 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 243 constraints, problems are : Problem set: 0 solved, 114 unsolved in 7747 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 89/89 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 114/114 constraints, Known Traps: 0/0 constraints]
After SMT, in 12820ms problems are : Problem set: 0 solved, 114 unsolved
Search for dead transitions found 0 dead transitions in 12848ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13435 ms. Remains : 89/89 places, 115/115 transitions.
RANDOM walk for 40000 steps (9156 resets) in 1941 ms. (20 steps per ms) remains 6/6 properties
[2025-05-30 10:42:25] [INFO ] Flatten gal took : 143 ms
[2025-05-30 10:42:25] [INFO ] Flatten gal took : 62 ms
[2025-05-30 10:42:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7753362850279216002.gal : 23 ms
[2025-05-30 10:42:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1242074226210838816.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7753362850279216002.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1242074226210838816.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality1242074226210838816.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 7
BEST_FIRST walk for 40004 steps (3865 resets) in 933 ms. (42 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :58 after 90
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :90 after 154
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :154 after 264
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :264 after 996
BEST_FIRST walk for 40002 steps (3976 resets) in 269 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (3954 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :996 after 2791
BEST_FIRST walk for 40003 steps (3929 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :2791 after 6469
BEST_FIRST walk for 40004 steps (4016 resets) in 204 ms. (195 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (4033 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :6469 after 20505
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :20505 after 39335
Invariant property MIN1 does not hold.
Invariant property MIN0 does not hold.
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :39335 after 82973
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,96758,1.43238,33900,2,7015,19,94626,10,0,477,103722,0
Total reachable state count : 96758

Verifying 6 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,1.43391,34160,1,0,19,94626,10,0,478,103722,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,426,1.43468,34160,2,424,19,94626,11,0,480,103722,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,0,1.43553,34160,1,0,19,94626,11,0,480,103722,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,201,1.43595,34160,2,374,19,94626,12,0,482,103722,0
Reachability property MAX2 does not hold.
No reachable states exhibit your property : MAX2

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,0,1.43628,34160,1,0,19,94626,12,0,482,103722,0
Invariant property MIN2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,0,1.43661,34160,1,0,19,94626,12,0,482,103722,0
Probably explored full state space saw : 96490 states, properties seen :2
Probabilistic random walk after 243506 steps, saw 96490 distinct states, run finished after 1502 ms. (steps per millisecond=162 ) properties seen :2
Explored full state space saw : 96758 states, properties seen :0
Exhaustive walk after 244154 steps, saw 96758 distinct states, run finished after 1330 ms. (steps per millisecond=183 ) properties seen :0
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-09 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0, 0] Max Struct:[5, 1042]
Starting property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5]
[2025-05-30 10:42:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 10000 steps (2264 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (967 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2025-05-30 10:42:29] [INFO ] Invariant cache hit.
[2025-05-30 10:42:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:42:29] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-05-30 10:42:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 10:42:29] [INFO ] [Real]Added 38 Read/Feed constraints in 23 ms returned sat
[2025-05-30 10:42:29] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:42:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:42:29] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-05-30 10:42:29] [INFO ] [Nat]Added 38 Read/Feed constraints in 7 ms returned sat
[2025-05-30 10:42:29] [INFO ] Computed and/alt/rep : 31/72/31 causal constraints (skipped 83 transitions) in 10 ms.
[2025-05-30 10:42:29] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2025-05-30 10:42:29] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2025-05-30 10:42:29] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2025-05-30 10:42:29] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2025-05-30 10:42:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 327 ms
[2025-05-30 10:42:29] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2025-05-30 10:42:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2025-05-30 10:42:29] [INFO ] Added : 8 causal constraints over 3 iterations in 490 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 115/115 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 87 transition count 108
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 87 transition count 108
Applied a total of 4 rules in 18 ms. Remains 87 /89 variables (removed 2) and now considering 108/115 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 87/89 places, 108/115 transitions.
// Phase 1: matrix 108 rows 87 cols
[2025-05-30 10:42:30] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 1000000 steps (229673 resets) in 1304 ms. (766 steps per ms)
BEST_FIRST walk for 1000000 steps (97887 resets) in 517 ms. (1930 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[5]
[2025-05-30 10:42:31] [INFO ] Invariant cache hit.
[2025-05-30 10:42:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:42:32] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2025-05-30 10:42:32] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-30 10:42:32] [INFO ] [Real]Added 32 Read/Feed constraints in 6 ms returned sat
[2025-05-30 10:42:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:42:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:42:32] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2025-05-30 10:42:32] [INFO ] [Nat]Added 32 Read/Feed constraints in 10 ms returned sat
[2025-05-30 10:42:32] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 76 transitions) in 14 ms.
[2025-05-30 10:42:32] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2025-05-30 10:42:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2025-05-30 10:42:32] [INFO ] Added : 12 causal constraints over 4 iterations in 224 ms. Result :sat
Minimization took 120 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[5]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 11 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 87/87 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 8 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2025-05-30 10:42:32] [INFO ] Invariant cache hit.
[2025-05-30 10:42:32] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-05-30 10:42:32] [INFO ] Invariant cache hit.
[2025-05-30 10:42:32] [INFO ] State equation strengthened by 32 read => feed constraints.
[2025-05-30 10:42:33] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2025-05-30 10:42:33] [INFO ] Redundant transitions in 4 ms returned []
Running 107 sub problems to find dead transitions.
[2025-05-30 10:42:33] [INFO ] Invariant cache hit.
[2025-05-30 10:42:33] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/195 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 121 constraints, problems are : Problem set: 0 solved, 107 unsolved in 3463 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/195 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 107/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 228 constraints, problems are : Problem set: 0 solved, 107 unsolved in 8251 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 12041ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 12045ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12579 ms. Remains : 87/87 places, 108/108 transitions.
[2025-05-30 10:42:45] [INFO ] Flatten gal took : 31 ms
[2025-05-30 10:42:45] [INFO ] Flatten gal took : 34 ms
[2025-05-30 10:42:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14215544165117629047.gal : 5 ms
[2025-05-30 10:42:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15404132765975900548.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14215544165117629047.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15404132765975900548.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (9227 resets) in 160 ms. (248 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality15404132765975900548.prop.
BEST_FIRST walk for 40003 steps (3982 resets) in 49 ms. (800 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 120
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :120 after 218
BEST_FIRST walk for 40002 steps (3923 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :218 after 394
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :394 after 1350
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1350 after 2890
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2890 after 6655
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6655 after 20815
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :20815 after 38771
Probably explored full state space saw : 89176 states, properties seen :1
Probabilistic random walk after 220938 steps, saw 89176 distinct states, run finished after 517 ms. (steps per millisecond=427 ) properties seen :1
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :84643 after 87645
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,89629,0.851652,27748,2,6240,19,76796,7,0,459,82123,0
Total reachable state count : 89629

Verifying 2 reachability properties.
Explored full state space saw : 89629 states, properties seen :0
Exhaustive walk after 222033 steps, saw 89629 distinct states, run finished after 310 ms. (steps per millisecond=716 ) properties seen :0
ITS runner timed out or was interrupted.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.853443,28012,1,0,19,76796,7,0,460,82123,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,339,0.854143,28012,2,360,19,76796,8,0,462,82123,0
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[5]
Ending property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-01 in 17003 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1042]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1042]
// Phase 1: matrix 115 rows 89 cols
[2025-05-30 10:42:46] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1042]
RANDOM walk for 10000 steps (2302 resets) in 18 ms. (526 steps per ms)
BEST_FIRST walk for 10001 steps (961 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1042]
[2025-05-30 10:42:46] [INFO ] Invariant cache hit.
[2025-05-30 10:42:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 10:42:46] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-05-30 10:42:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2025-05-30 10:42:46] [INFO ] [Real]Added 38 Read/Feed constraints in 9 ms returned sat
[2025-05-30 10:42:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:42:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:42:46] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2025-05-30 10:42:46] [INFO ] [Nat]Added 38 Read/Feed constraints in 9 ms returned sat
[2025-05-30 10:42:46] [INFO ] Computed and/alt/rep : 31/72/31 causal constraints (skipped 83 transitions) in 14 ms.
[2025-05-30 10:42:46] [INFO ] Added : 10 causal constraints over 2 iterations in 52 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1042]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1042]
Support contains 1 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 115/115 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 88 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 88 transition count 114
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 87 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 87 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 86 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 86 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 86 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 85 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 85 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 84 transition count 108
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 84 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 84 transition count 106
Applied a total of 13 rules in 27 ms. Remains 84 /89 variables (removed 5) and now considering 106/115 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 84/89 places, 106/115 transitions.
// Phase 1: matrix 106 rows 84 cols
[2025-05-30 10:42:46] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1042]
RANDOM walk for 1000000 steps (229790 resets) in 1460 ms. (684 steps per ms)
BEST_FIRST walk for 1000000 steps (98594 resets) in 812 ms. (1230 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1042]
[2025-05-30 10:42:48] [INFO ] Invariant cache hit.
[2025-05-30 10:42:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 10:42:48] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-05-30 10:42:48] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-30 10:42:48] [INFO ] [Real]Added 35 Read/Feed constraints in 12 ms returned sat
[2025-05-30 10:42:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 10:42:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-30 10:42:49] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2025-05-30 10:42:49] [INFO ] [Nat]Added 35 Read/Feed constraints in 11 ms returned sat
[2025-05-30 10:42:49] [INFO ] Computed and/alt/rep : 29/63/29 causal constraints (skipped 76 transitions) in 14 ms.
[2025-05-30 10:42:49] [INFO ] Added : 11 causal constraints over 3 iterations in 58 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1042]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1042]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 106/106 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 84/84 places, 106/106 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 106/106 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2025-05-30 10:42:49] [INFO ] Invariant cache hit.
[2025-05-30 10:42:49] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-05-30 10:42:49] [INFO ] Invariant cache hit.
[2025-05-30 10:42:49] [INFO ] State equation strengthened by 35 read => feed constraints.
[2025-05-30 10:42:49] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2025-05-30 10:42:49] [INFO ] Redundant transitions in 4 ms returned []
Running 105 sub problems to find dead transitions.
[2025-05-30 10:42:49] [INFO ] Invariant cache hit.
[2025-05-30 10:42:49] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/190 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 35/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 121 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4560 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (OVERLAPS) 1/84 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 106/190 variables, 84/86 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 35/121 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 105/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 0/190 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 190/190 variables, and 226 constraints, problems are : Problem set: 0 solved, 105 unsolved in 6682 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 0/0 constraints]
After SMT, in 11441ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 11445ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11799 ms. Remains : 84/84 places, 106/106 transitions.
RANDOM walk for 40000 steps (9210 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3886 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
[2025-05-30 10:43:01] [INFO ] Flatten gal took : 21 ms
[2025-05-30 10:43:01] [INFO ] Flatten gal took : 18 ms
[2025-05-30 10:43:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4832126696579537213.gal : 15 ms
[2025-05-30 10:43:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4186861423150200180.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4832126696579537213.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4186861423150200180.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (3883 resets) in 96 ms. (412 steps per ms) remains 2/2 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4186861423150200180.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :26 after 58
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :58 after 120
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :120 after 218
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :218 after 436
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :436 after 1110
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1110 after 2397
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2397 after 6669
Probably explored full state space saw : 63621 states, properties seen :1
Probabilistic random walk after 157499 steps, saw 63621 distinct states, run finished after 309 ms. (steps per millisecond=509 ) properties seen :1
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :6669 after 22372
Explored full state space saw : 63933 states, properties seen :0
Exhaustive walk after 158189 steps, saw 63933 distinct states, run finished after 202 ms. (steps per millisecond=783 ) properties seen :0
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1042]
Ending property specific reduction for DBSingleClientW-PT-d1m05-UpperBounds-07 in 15516 ms.
[2025-05-30 10:43:01] [INFO ] Flatten gal took : 18 ms
[2025-05-30 10:43:01] [INFO ] Applying decomposition
[2025-05-30 10:43:01] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18037091377981833781.txt' '-o' '/tmp/graph18037091377981833781.bin' '-w' '/tmp/graph18037091377981833781.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18037091377981833781.bin' '-l' '-1' '-v' '-w' '/tmp/graph18037091377981833781.weights' '-q' '0' '-e' '0.001'
[2025-05-30 10:43:01] [INFO ] Decomposing Gal with order
[2025-05-30 10:43:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 10:43:01] [INFO ] Removed a total of 127 redundant transitions.
[2025-05-30 10:43:01] [INFO ] Flatten gal took : 67 ms
[2025-05-30 10:43:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 18 ms.
[2025-05-30 10:43:02] [INFO ] Time to serialize gal into /tmp/UpperBounds913793843984477965.gal : 8 ms
[2025-05-30 10:43:02] [INFO ] Time to serialize properties into /tmp/UpperBounds9799221020481706396.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds913793843984477965.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9799221020481706396.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...282
Loading property file /tmp/UpperBounds9799221020481706396.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,96758,0.548538,14996,996,309,17135,1443,374,42675,83,9568,0
Total reachable state count : 96758

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property DBSingleClientW-PT-d1m05-UpperBounds-01 :0 <= i1.u5.l1290 <= 2
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-01 2 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m05-UpperBounds-01,0,0.590211,14996,1,0,17135,1443,479,42675,98,9568,748
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m05-UpperBounds-07 :0 <= i5.u10.l456 <= 1
FORMULA DBSingleClientW-PT-d1m05-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m05-UpperBounds-07,0,0.592995,14996,1,0,17135,1443,510,42675,103,9568,991
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 78839 ms.

BK_STOP 1748601782731

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="DBSingleClientW-PT-d1m05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is DBSingleClientW-PT-d1m05, 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 r069-smll-174854075800009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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