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

About the Execution of ITS-Tools for DBSingleClientW-PT-d0m07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 67651.00 0.00 0.00 0 0 4 0 0 0 0 0 0 1 1 0 4 0 0 1 normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r058-smll-174854063400029.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 itstools
Input is DBSingleClientW-PT-d0m07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-174854063400029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K 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 119K 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-d0m07-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748553100751

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2025-05-29 21:11: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-29 21:11:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 21:11:43] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2025-05-29 21:11:43] [INFO ] Transformed 553 places.
[2025-05-29 21:11:43] [INFO ] Transformed 150 transitions.
[2025-05-29 21:11:43] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 391 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Deduced a syphon composed of 444 places in 3 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 150 rows 109 cols
[2025-05-29 21:11:43] [INFO ] Computed 6 invariants in 33 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[7, 1, 368, 7, 7]
RANDOM walk for 10000 steps (2311 resets) in 115 ms. (86 steps per ms)
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (3943 resets) in 134 ms. (296 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0] Max Struct:[7, 368, 7, 7]
[2025-05-29 21:11:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 21:11:44] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2025-05-29 21:11:44] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2025-05-29 21:11:44] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2025-05-29 21:11:44] [INFO ] State equation strengthened by 74 read => feed constraints.
[2025-05-29 21:11:44] [INFO ] [Real]Added 74 Read/Feed constraints in 54 ms returned sat
[2025-05-29 21:11:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 21:11:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-05-29 21:11:44] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2025-05-29 21:11:45] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2025-05-29 21:11:45] [INFO ] [Nat]Added 74 Read/Feed constraints in 34 ms returned sat
[2025-05-29 21:11:45] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 55 ms.
[2025-05-29 21:11:45] [INFO ] Added : 10 causal constraints over 2 iterations in 158 ms. Result :sat
Minimization took 299 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 21:11:45] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-05-29 21:11:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned unsat
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 21:11:45] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-05-29 21:11:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2025-05-29 21:11:45] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2025-05-29 21:11:45] [INFO ] [Real]Added 74 Read/Feed constraints in 20 ms returned sat
[2025-05-29 21:11:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 21:11:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2025-05-29 21:11:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2025-05-29 21:11:46] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2025-05-29 21:11:46] [INFO ] [Nat]Added 74 Read/Feed constraints in 18 ms returned sat
[2025-05-29 21:11:46] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 61 ms.
[2025-05-29 21:11:46] [INFO ] Added : 9 causal constraints over 3 iterations in 156 ms. Result :sat
Minimization took 186 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 21:11:46] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2025-05-29 21:11:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2025-05-29 21:11:46] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2025-05-29 21:11:46] [INFO ] [Real]Added 74 Read/Feed constraints in 16 ms returned sat
[2025-05-29 21:11:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 21:11:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2025-05-29 21:11:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2025-05-29 21:11:46] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2025-05-29 21:11:46] [INFO ] [Nat]Added 74 Read/Feed constraints in 14 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:47] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 25 ms to minimize.
[2025-05-29 21:11:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2025-05-29 21:11:47] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 29 ms.
[2025-05-29 21:11:47] [INFO ] Added : 6 causal constraints over 2 iterations in 75 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0] Max Struct:[7, 1, 7, 7]
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[7, 7, 7]
Support contains 3 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 102 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 102 transition count 139
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 33 place count 81 transition count 102
Iterating global reduction 1 with 21 rules applied. Total rules applied 54 place count 81 transition count 102
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 64 place count 71 transition count 92
Iterating global reduction 1 with 10 rules applied. Total rules applied 74 place count 71 transition count 92
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 69 transition count 88
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 69 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 67 transition count 85
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 67 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 66 transition count 84
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 66 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 86 place count 66 transition count 82
Applied a total of 86 rules in 108 ms. Remains 66 /109 variables (removed 43) and now considering 82/150 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 66/109 places, 82/150 transitions.
// Phase 1: matrix 82 rows 66 cols
[2025-05-29 21:11:47] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[7, 7, 7]
RANDOM walk for 1000000 steps (229160 resets) in 1611 ms. (620 steps per ms)
BEST_FIRST walk for 3000002 steps (304436 resets) in 1872 ms. (1601 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 1] Max Struct:[7, 7, 7]
[2025-05-29 21:11:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 21:11:50] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-29 21:11:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 21:11:51] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2025-05-29 21:11:51] [INFO ] State equation strengthened by 29 read => feed constraints.
[2025-05-29 21:11:51] [INFO ] [Real]Added 29 Read/Feed constraints in 6 ms returned sat
[2025-05-29 21:11:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 21:11:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-29 21:11:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 21:11:51] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-05-29 21:11:51] [INFO ] [Nat]Added 29 Read/Feed constraints in 7 ms returned sat
[2025-05-29 21:11:51] [INFO ] Computed and/alt/rep : 23/50/23 causal constraints (skipped 58 transitions) in 11 ms.
[2025-05-29 21:11:51] [INFO ] Added : 13 causal constraints over 4 iterations in 58 ms. Result :sat
Minimization took 71 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 21:11:51] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-29 21:11:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 21:11:51] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-05-29 21:11:51] [INFO ] [Real]Added 29 Read/Feed constraints in 6 ms returned sat
[2025-05-29 21:11:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 21:11:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-29 21:11:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 21:11:51] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-05-29 21:11:51] [INFO ] [Nat]Added 29 Read/Feed constraints in 6 ms returned sat
[2025-05-29 21:11:51] [INFO ] Computed and/alt/rep : 23/50/23 causal constraints (skipped 58 transitions) in 11 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:51] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:51] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 4 ms to minimize.
[2025-05-29 21:11:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
[2025-05-29 21:11:51] [INFO ] Added : 12 causal constraints over 4 iterations in 208 ms. Result :sat
Minimization took 82 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 21:11:51] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-29 21:11:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2025-05-29 21:11:51] [INFO ] [Real]Absence check using state equation in 38 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 1] Max Struct:[7, 7, 1]
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1] Max Struct:[7, 7]
Support contains 2 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 82/82 transitions.
Graph (complete) has 196 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 80
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 64 transition count 79
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 64 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 64 transition count 78
Applied a total of 6 rules in 21 ms. Remains 64 /66 variables (removed 2) and now considering 78/82 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 64/66 places, 78/82 transitions.
// Phase 1: matrix 78 rows 64 cols
[2025-05-29 21:11:51] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1] Max Struct:[7, 7]
RANDOM walk for 1000000 steps (229162 resets) in 1202 ms. (831 steps per ms)
BEST_FIRST walk for 2000002 steps (203522 resets) in 984 ms. (2030 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1] Max Struct:[7, 7]
[2025-05-29 21:11:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 21:11:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 21:11:54] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-05-29 21:11:54] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 21:11:54] [INFO ] [Real]Added 25 Read/Feed constraints in 6 ms returned sat
[2025-05-29 21:11:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 21:11:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 21:11:54] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2025-05-29 21:11:54] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2025-05-29 21:11:54] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 56 transitions) in 11 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:54] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 6 ms to minimize.
[2025-05-29 21:11:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2025-05-29 21:11:54] [INFO ] Added : 13 causal constraints over 4 iterations in 150 ms. Result :sat
Minimization took 61 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 21:11:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 21:11:54] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-05-29 21:11:54] [INFO ] [Real]Added 25 Read/Feed constraints in 6 ms returned sat
[2025-05-29 21:11:54] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 21:11:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 21:11:54] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-05-29 21:11:54] [INFO ] [Nat]Added 25 Read/Feed constraints in 10 ms returned sat
[2025-05-29 21:11:54] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 56 transitions) in 16 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:54] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 9 ms to minimize.
[2025-05-29 21:11:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2025-05-29 21:11:54] [INFO ] Added : 14 causal constraints over 4 iterations in 221 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1] Max Struct:[7, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1] Max Struct:[7, 7]
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 78/78 transitions.
Applied a total of 0 rules in 11 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 64/64 places, 78/78 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 78/78 transitions.
Applied a total of 0 rules in 11 ms. Remains 64 /64 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2025-05-29 21:11:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:11:55] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-05-29 21:11:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:11:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 21:11:55] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:11:55] [INFO ] Redundant transitions in 2 ms returned []
Running 77 sub problems to find dead transitions.
[2025-05-29 21:11:55] [INFO ] Invariant cache hit.
[2025-05-29 21:11:55] [INFO ] State equation strengthened by 25 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 1/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (OVERLAPS) 78/142 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 25/91 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:57] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:11:58] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 7 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/142 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 93 constraints, problems are : Problem set: 0 solved, 77 unsolved in 4162 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 1/64 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 78/142 variables, 64/68 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 25/93 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 77/170 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 170 constraints, problems are : Problem set: 0 solved, 77 unsolved in 9552 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13944ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 13959ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14340 ms. Remains : 64/64 places, 78/78 transitions.
RANDOM walk for 40000 steps (9179 resets) in 1475 ms. (27 steps per ms) remains 4/4 properties
[2025-05-29 21:12:10] [INFO ] Flatten gal took : 95 ms
[2025-05-29 21:12:10] [INFO ] Flatten gal took : 49 ms
[2025-05-29 21:12:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12153187419914792063.gal : 10 ms
[2025-05-29 21:12:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8726604491623494291.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12153187419914792063.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8726604491623494291.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40001 steps (4059 resets) in 675 ms. (59 steps per ms) remains 4/4 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8726604491623494291.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 26
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :26 after 126
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :126 after 340
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :340 after 508
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :508 after 3528
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :3528 after 8666
BEST_FIRST walk for 40001 steps (4045 resets) in 633 ms. (63 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :8666 after 21540
BEST_FIRST walk for 40003 steps (4142 resets) in 331 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (4024 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :21540 after 84925
Invariant property MIN1 does not hold.
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :84925 after 209004
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :209004 after 276434
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :276434 after 789368
Invariant property MIN0 does not hold.
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1.1919e+06 after 1.61598e+06
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,1.70597e+06,1.15116,28344,2,5973,21,101258,8,0,338,94856,0
Total reachable state count : 1705974

Verifying 4 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.15198,28472,1,0,21,101258,8,0,339,94856,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,208656,1.15378,28600,2,3615,21,101258,9,0,341,94856,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.15494,28600,1,0,21,101258,9,0,341,94856,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,1460,1.1556,28600,2,633,21,101258,10,0,343,94856,0
Interrupted probabilistic random walk after 824096 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :2 out of 4
Probabilistic random walk after 824096 steps, saw 311317 distinct states, run finished after 3006 ms. (steps per millisecond=274 ) properties seen :2
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 1] Max Struct:[7, 7]
Starting property specific reduction for DBSingleClientW-PT-d0m07-UpperBounds-02
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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
[2025-05-29 21:12:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2335 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10001 steps (964 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-29 21:12:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 21:12:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 21:12:13] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2025-05-29 21:12:13] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 21:12:13] [INFO ] [Real]Added 25 Read/Feed constraints in 9 ms returned sat
[2025-05-29 21:12:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 21:12:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-29 21:12:13] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2025-05-29 21:12:13] [INFO ] [Nat]Added 25 Read/Feed constraints in 10 ms returned sat
[2025-05-29 21:12:13] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 56 transitions) in 18 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:12:13] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 11 ms to minimize.
[2025-05-29 21:12:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2025-05-29 21:12:13] [INFO ] Added : 13 causal constraints over 4 iterations in 234 ms. Result :sat
Minimization took 92 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 62 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 62 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 61 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 61 transition count 74
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 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 60 transition count 72
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 59 transition count 71
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 59 transition count 71
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 59 transition count 69
Applied a total of 13 rules in 38 ms. Remains 59 /64 variables (removed 5) and now considering 69/78 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 59/64 places, 69/78 transitions.
// Phase 1: matrix 69 rows 59 cols
[2025-05-29 21:12:14] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229202 resets) in 1091 ms. (915 steps per ms)
BEST_FIRST walk for 1000001 steps (102152 resets) in 454 ms. (2197 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-29 21:12:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 21:12:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 21:12:15] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-05-29 21:12:15] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 21:12:15] [INFO ] [Real]Added 22 Read/Feed constraints in 6 ms returned sat
[2025-05-29 21:12:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 21:12:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 21:12:15] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2025-05-29 21:12:15] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2025-05-29 21:12:15] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 49 transitions) in 8 ms.
[2025-05-29 21:12:15] [INFO ] Added : 10 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 69/69 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 59/59 places, 69/69 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 69/69 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2025-05-29 21:12:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:12:15] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-05-29 21:12:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:12:16] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 21:12:16] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:12:16] [INFO ] Redundant transitions in 2 ms returned []
Running 68 sub problems to find dead transitions.
[2025-05-29 21:12:16] [INFO ] Invariant cache hit.
[2025-05-29 21:12:16] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 22/83 constraints. Problems are: Problem set: 0 solved, 68 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 83 constraints, problems are : Problem set: 0 solved, 68 unsolved in 2840 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (OVERLAPS) 1/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/128 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 22/83 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 68/151 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 151 constraints, problems are : Problem set: 0 solved, 68 unsolved in 6159 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 59/59 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9086ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 9087ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9376 ms. Remains : 59/59 places, 69/69 transitions.
[2025-05-29 21:12:25] [INFO ] Flatten gal took : 16 ms
[2025-05-29 21:12:25] [INFO ] Flatten gal took : 16 ms
[2025-05-29 21:12:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5494417443174585620.gal : 4 ms
[2025-05-29 21:12:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality108464154071887066.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5494417443174585620.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality108464154071887066.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
Loading property file /tmp/ReachabilityCardinality108464154071887066.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 22
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :22 after 48
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :48 after 126
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :126 after 262
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :262 after 486
RANDOM walk for 40000 steps (9119 resets) in 172 ms. (231 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :486 after 3771
BEST_FIRST walk for 40001 steps (3973 resets) in 112 ms. (353 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3771 after 7658
BEST_FIRST walk for 40004 steps (4091 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :7658 after 34202
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :34202 after 147732
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :147732 after 289668
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,746572,0.947166,25720,2,6498,16,84945,8,0,309,81934,0
Total reachable state count : 746572

Verifying 2 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,0.948009,25720,1,0,16,84945,8,0,310,81934,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,93600,0.949909,25720,2,3767,16,84945,8,0,311,81934,0
Probably explored full state space saw : 746294 states, properties seen :1
Probabilistic random walk after 1981624 steps, saw 746294 distinct states, run finished after 2313 ms. (steps per millisecond=856 ) properties seen :1
Explored full state space saw : 746572 states, properties seen :0
Exhaustive walk after 1982410 steps, saw 746572 distinct states, run finished after 2289 ms. (steps per millisecond=866 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d0m07-UpperBounds-02 in 16624 ms.
Starting property specific reduction for DBSingleClientW-PT-d0m07-UpperBounds-12
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:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 78 rows 64 cols
[2025-05-29 21:12:30] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2292 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (956 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-29 21:12:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 21:12:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 21:12:30] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-05-29 21:12:30] [INFO ] State equation strengthened by 25 read => feed constraints.
[2025-05-29 21:12:30] [INFO ] [Real]Added 25 Read/Feed constraints in 6 ms returned sat
[2025-05-29 21:12:30] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-05-29 21:12:30] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 21:12:30] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-05-29 21:12:30] [INFO ] [Nat]Added 25 Read/Feed constraints in 5 ms returned sat
[2025-05-29 21:12:30] [INFO ] Computed and/alt/rep : 21/46/21 causal constraints (skipped 56 transitions) in 8 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 21:12:30] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 4 ms to minimize.
[2025-05-29 21:12:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2025-05-29 21:12:30] [INFO ] Added : 7 causal constraints over 2 iterations in 112 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 62 transition count 74
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 62 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 62 transition count 72
Applied a total of 6 rules in 12 ms. Remains 62 /64 variables (removed 2) and now considering 72/78 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 62/64 places, 72/78 transitions.
// Phase 1: matrix 72 rows 62 cols
[2025-05-29 21:12:30] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (228571 resets) in 1028 ms. (971 steps per ms)
BEST_FIRST walk for 1000001 steps (101518 resets) in 568 ms. (1757 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2025-05-29 21:12:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 21:12:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 21:12:32] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-05-29 21:12:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 21:12:32] [INFO ] [Real]Added 22 Read/Feed constraints in 5 ms returned sat
[2025-05-29 21:12:32] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2025-05-29 21:12:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2025-05-29 21:12:32] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-05-29 21:12:32] [INFO ] [Nat]Added 22 Read/Feed constraints in 5 ms returned sat
[2025-05-29 21:12:32] [INFO ] Computed and/alt/rep : 20/42/20 causal constraints (skipped 51 transitions) in 9 ms.
[2025-05-29 21:12:32] [INFO ] Added : 8 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 6 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 62/62 places, 72/72 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2025-05-29 21:12:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:12:32] [INFO ] Implicit Places using invariants in 94 ms returned []
[2025-05-29 21:12:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 21:12:32] [INFO ] State equation strengthened by 22 read => feed constraints.
[2025-05-29 21:12:32] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 21:12:32] [INFO ] Redundant transitions in 2 ms returned []
Running 71 sub problems to find dead transitions.
[2025-05-29 21:12:32] [INFO ] Invariant cache hit.
[2025-05-29 21:12:32] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 86 constraints, problems are : Problem set: 0 solved, 71 unsolved in 2715 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 22/86 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 71/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 157 constraints, problems are : Problem set: 0 solved, 71 unsolved in 7992 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10788ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 10790ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11136 ms. Remains : 62/62 places, 72/72 transitions.
[2025-05-29 21:12:43] [INFO ] Flatten gal took : 34 ms
RANDOM walk for 40000 steps (9184 resets) in 145 ms. (273 steps per ms) remains 2/2 properties
[2025-05-29 21:12:43] [INFO ] Flatten gal took : 19 ms
[2025-05-29 21:12:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17816942154206494312.gal : 12 ms
[2025-05-29 21:12:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17310002715936723639.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17816942154206494312.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17310002715936723639.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (4141 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality17310002715936723639.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 22
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :22 after 56
BEST_FIRST walk for 40003 steps (4090 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :56 after 126
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :126 after 280
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :280 after 508
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :508 after 3366
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :3366 after 7898
Invariant property MIN0 does not hold.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :7898 after 20178
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :20178 after 60506
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :60506 after 92544
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :92544 after 231511
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :231511 after 809450
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,1.36144e+06,1.00707,24316,2,5966,19,79473,7,0,323,85608,0
Total reachable state count : 1361436

Verifying 2 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.00902,24444,1,0,19,79473,7,0,324,85608,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,6300,1.01001,24444,2,1113,19,79473,8,0,326,85608,0
Interrupted probabilistic random walk after 2243749 steps, run timeout after 3001 ms. (steps per millisecond=747 ) properties seen :1 out of 2
Probabilistic random walk after 2243749 steps, saw 878640 distinct states, run finished after 3001 ms. (steps per millisecond=747 ) properties seen :1
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d0m07-UpperBounds-12 in 16575 ms.
[2025-05-29 21:12:46] [INFO ] Flatten gal took : 12 ms
[2025-05-29 21:12:46] [INFO ] Applying decomposition
[2025-05-29 21:12:46] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1106677485354558722.txt' '-o' '/tmp/graph1106677485354558722.bin' '-w' '/tmp/graph1106677485354558722.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1106677485354558722.bin' '-l' '-1' '-v' '-w' '/tmp/graph1106677485354558722.weights' '-q' '0' '-e' '0.001'
[2025-05-29 21:12:46] [INFO ] Decomposing Gal with order
[2025-05-29 21:12:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 21:12:46] [INFO ] Removed a total of 78 redundant transitions.
[2025-05-29 21:12:46] [INFO ] Flatten gal took : 66 ms
[2025-05-29 21:12:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 13 ms.
[2025-05-29 21:12:46] [INFO ] Time to serialize gal into /tmp/UpperBounds713192218511340710.gal : 6 ms
[2025-05-29 21:12:46] [INFO ] Time to serialize properties into /tmp/UpperBounds9231883243914053567.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds713192218511340710.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9231883243914053567.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...282
Loading property file /tmp/UpperBounds9231883243914053567.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,1.70597e+06,1.25924,28128,1087,476,36784,5243,240,92539,70,35343,0
Total reachable state count : 1705974

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DBSingleClientW-PT-d0m07-UpperBounds-02 :0 <= i0.u12.l353 <= 4
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-02 4 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-d0m07-UpperBounds-02,0,1.33659,28128,1,0,36784,5243,325,92539,88,35343,714
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DBSingleClientW-PT-d0m07-UpperBounds-12 :0 <= i0.u4.l503 <= 4
FORMULA DBSingleClientW-PT-d0m07-UpperBounds-12 4 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-d0m07-UpperBounds-12,0,1.33746,28128,1,0,36784,5243,338,92539,88,35343,746
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 65057 ms.

BK_STOP 1748553168402

--------------------
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
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-d0m07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d0m07, 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 r058-smll-174854063400029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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