Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r095-smll-177946996300031.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool gold2025
Input is DBSingleClientW-PT-d2m10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-smll-177946996300031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.9K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 08:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 08:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Mar 6 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 6 18:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 6 18:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 3 18:30 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-d2m10-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779526870652

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 09:01:13] [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]
[2026-05-23 09:01:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:01:14] [INFO ] Load time of PNML (sax parser for PT used): 555 ms
[2026-05-23 09:01:14] [INFO ] Transformed 4763 places.
[2026-05-23 09:01:14] [INFO ] Transformed 2478 transitions.
[2026-05-23 09:01:14] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 854 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Deduced a syphon composed of 3580 places in 23 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0] Max Struct:[+inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2026-05-23 09:01:14] [INFO ] Computed 6 invariants in 204 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[7, 3255, 7]
RANDOM walk for 10000 steps (2335 resets) in 716 ms. (13 steps per ms)
BEST_FIRST walk for 30002 steps (2888 resets) in 370 ms. (80 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[7, 3255, 7]
[2026-05-23 09:01:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:01:16] [INFO ] [Real]Absence check using 2 positive place invariants in 35 ms returned sat
[2026-05-23 09:01:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 25 ms returned sat
[2026-05-23 09:01:18] [INFO ] [Real]Absence check using state equation in 1557 ms returned sat
[2026-05-23 09:01:18] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2026-05-23 09:01:20] [INFO ] [Real]Added 1588 Read/Feed constraints in 1415 ms returned sat
[2026-05-23 09:01:20] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:01:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 27 ms returned sat
[2026-05-23 09:01:20] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2026-05-23 09:01:22] [INFO ] [Nat]Absence check using state equation in 1535 ms returned sat
[2026-05-23 09:01:24] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-23 09:01:24] [INFO ] [Nat]Added 1588 Read/Feed constraints in 2244 ms returned sat
[2026-05-23 09:01:25] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 1187 ms.
[2026-05-23 09:01:25] [INFO ] Added : 0 causal constraints over 0 iterations in 1204 ms. Result :unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:01:26] [INFO ] [Real]Absence check using 2 positive place invariants in 26 ms returned sat
[2026-05-23 09:01:26] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2026-05-23 09:01:27] [INFO ] [Real]Absence check using state equation in 1373 ms returned sat
[2026-05-23 09:01:29] [INFO ] [Real]Added 1588 Read/Feed constraints in 1475 ms returned sat
[2026-05-23 09:01:29] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:01:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 28 ms returned sat
[2026-05-23 09:01:29] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2026-05-23 09:01:31] [INFO ] [Nat]Absence check using state equation in 1547 ms returned sat
[2026-05-23 09:01:33] [INFO ] SMT solver returned unknown. Retrying;
[2026-05-23 09:01:33] [INFO ] [Nat]Added 1588 Read/Feed constraints in 2521 ms returned unknown
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:01:34] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2026-05-23 09:01:34] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2026-05-23 09:01:35] [INFO ] [Real]Absence check using state equation in 1293 ms returned sat
[2026-05-23 09:01:37] [INFO ] [Real]Added 1588 Read/Feed constraints in 1773 ms returned sat
[2026-05-23 09:01:37] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:01:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 27 ms returned sat
[2026-05-23 09:01:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2026-05-23 09:01:39] [INFO ] [Nat]Absence check using state equation in 1616 ms returned sat
[2026-05-23 09:01:41] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1700 ms returned sat
[2026-05-23 09:01:42] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 1531 ms.
[2026-05-23 09:01:42] [INFO ] Added : 0 causal constraints over 0 iterations in 1533 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[7, 3255, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[7, 3255, 7]
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.12 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 391 places :
Symmetric choice reduction at 1 with 391 rule applications. Total rules 609 place count 745 transition count 1200
Iterating global reduction 1 with 391 rules applied. Total rules applied 1000 place count 745 transition count 1200
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1009 place count 745 transition count 1191
Discarding 314 places :
Symmetric choice reduction at 2 with 314 rule applications. Total rules 1323 place count 431 transition count 877
Iterating global reduction 2 with 314 rules applied. Total rules applied 1637 place count 431 transition count 877
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1649 place count 431 transition count 865
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 1888 place count 192 transition count 525
Iterating global reduction 3 with 239 rules applied. Total rules applied 2127 place count 192 transition count 525
Ensure Unique test removed 208 transitions
Reduce isomorphic transitions removed 208 transitions.
Iterating post reduction 3 with 208 rules applied. Total rules applied 2335 place count 192 transition count 317
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2360 place count 167 transition count 277
Iterating global reduction 4 with 25 rules applied. Total rules applied 2385 place count 167 transition count 277
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2391 place count 167 transition count 271
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2408 place count 150 transition count 254
Iterating global reduction 5 with 17 rules applied. Total rules applied 2425 place count 150 transition count 254
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2429 place count 150 transition count 250
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2443 place count 136 transition count 236
Iterating global reduction 6 with 14 rules applied. Total rules applied 2457 place count 136 transition count 236
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2470 place count 136 transition count 223
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2474 place count 132 transition count 206
Iterating global reduction 7 with 4 rules applied. Total rules applied 2478 place count 132 transition count 206
Applied a total of 2478 rules in 491 ms. Remains 132 /1183 variables (removed 1051) and now considering 206/2478 (removed 2272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 506 ms. Remains : 132/1183 places, 206/2478 transitions.
// Phase 1: matrix 206 rows 132 cols
[2026-05-23 09:01:43] [INFO ] Computed 2 invariants in 10 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[7, 3255, 7]
RANDOM walk for 1000000 steps (229590 resets) in 2441 ms. (409 steps per ms)
BEST_FIRST walk for 3000001 steps (286869 resets) in 3105 ms. (965 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[7, 3255, 7]
[2026-05-23 09:01:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:01:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 09:01:49] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2026-05-23 09:01:49] [INFO ] State equation strengthened by 81 read => feed constraints.
[2026-05-23 09:01:49] [INFO ] [Real]Added 81 Read/Feed constraints in 110 ms returned sat
[2026-05-23 09:01:49] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:01:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 09:01:49] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2026-05-23 09:01:49] [INFO ] [Nat]Added 81 Read/Feed constraints in 33 ms returned sat
[2026-05-23 09:01:49] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 154 transitions) in 22 ms.
[2026-05-23 09:01:49] [INFO ] Added : 10 causal constraints over 2 iterations in 135 ms. Result :sat
Minimization took 209 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:01:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 09:01:50] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2026-05-23 09:01:50] [INFO ] [Real]Added 81 Read/Feed constraints in 34 ms returned sat
[2026-05-23 09:01:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:01:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 09:01:50] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2026-05-23 09:01:50] [INFO ] [Nat]Added 81 Read/Feed constraints in 42 ms returned sat
[2026-05-23 09:01:50] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 154 transitions) in 29 ms.
[2026-05-23 09:01:50] [INFO ] Added : 10 causal constraints over 3 iterations in 164 ms. Result :sat
Minimization took 179 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:01:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 09:01:51] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2026-05-23 09:01:51] [INFO ] [Real]Added 81 Read/Feed constraints in 60 ms returned sat
[2026-05-23 09:01:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:01:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 09:01:51] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2026-05-23 09:01:51] [INFO ] [Nat]Added 81 Read/Feed constraints in 40 ms returned sat
[2026-05-23 09:01:51] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 154 transitions) in 27 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:01:51] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 12 ms to minimize.
[2026-05-23 09:01:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2026-05-23 09:01:52] [INFO ] Added : 25 causal constraints over 5 iterations in 589 ms. Result :sat
Minimization took 127 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[7, 3255, 7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[7, 3255, 7]
Support contains 3 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 206/206 transitions.
Applied a total of 0 rules in 17 ms. Remains 132 /132 variables (removed 0) and now considering 206/206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 132/132 places, 206/206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 206/206 transitions.
Applied a total of 0 rules in 10 ms. Remains 132 /132 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2026-05-23 09:01:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:01:52] [INFO ] Implicit Places using invariants in 136 ms returned []
[2026-05-23 09:01:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:01:52] [INFO ] State equation strengthened by 81 read => feed constraints.
[2026-05-23 09:01:53] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 1566 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:01:53] [INFO ] Redundant transitions in 10 ms returned []
Running 205 sub problems to find dead transitions.
[2026-05-23 09:01:53] [INFO ] Invariant cache hit.
[2026-05-23 09:01:53] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/338 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 81/215 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 0/338 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 215 constraints, problems are : Problem set: 0 solved, 205 unsolved in 19277 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 132/132 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/338 variables, 132/134 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 81/215 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 205/420 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 338/338 variables, and 420 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 132/132 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49740ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 49752ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51358 ms. Remains : 132/132 places, 206/206 transitions.
RANDOM walk for 40000 steps (9229 resets) in 1493 ms. (26 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3800 resets) in 297 ms. (134 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3854 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3742 resets) in 272 ms. (146 steps per ms) remains 6/6 properties
[2026-05-23 09:02:44] [INFO ] Flatten gal took : 183 ms
BEST_FIRST walk for 40002 steps (3843 resets) in 382 ms. (104 steps per ms) remains 6/6 properties
[2026-05-23 09:02:44] [INFO ] Flatten gal took : 73 ms
BEST_FIRST walk for 40002 steps (3751 resets) in 235 ms. (169 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3764 resets) in 166 ms. (239 steps per ms) remains 6/6 properties
[2026-05-23 09:02:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9357283926602378528.gal : 38 ms
[2026-05-23 09:02:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4348652113362315137.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/ReachabilityCardinality9357283926602378528.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4348652113362315137.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 ...328
Loading property file /tmp/ReachabilityCardinality4348652113362315137.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :182 after 330
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :330 after 594
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :594 after 1138
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :1138 after 5294
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :5294 after 25861
Interrupted probabilistic random walk after 707217 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :3 out of 6
Probabilistic random walk after 707217 steps, saw 292703 distinct states, run finished after 3007 ms. (steps per millisecond=235 ) properties seen :3
[2026-05-23 09:02:47] [INFO ] Invariant cache hit.
[2026-05-23 09:02:47] [INFO ] State equation strengthened by 81 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 74/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 135/227 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
After SMT solving in domain Real declared 329/338 variables, and 129 constraints, problems are : Problem set: 3 solved, 0 unsolved in 329 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 127/132 constraints, ReadFeed: 0/81 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 338ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0] Max Struct:[7, 3255, 7]
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-06
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]
[2026-05-23 09:02:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2306 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10000 steps (961 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2026-05-23 09:02:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:02:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 09:02:48] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2026-05-23 09:02:48] [INFO ] State equation strengthened by 81 read => feed constraints.
[2026-05-23 09:02:48] [INFO ] [Real]Added 81 Read/Feed constraints in 122 ms returned sat
[2026-05-23 09:02:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:02:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 09:02:48] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2026-05-23 09:02:48] [INFO ] [Nat]Added 81 Read/Feed constraints in 31 ms returned sat
[2026-05-23 09:02:48] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 154 transitions) in 37 ms.
[2026-05-23 09:02:48] [INFO ] Added : 10 causal constraints over 2 iterations in 121 ms. Result :sat
Minimization took 125 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 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 206/206 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 130 transition count 203
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 130 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 130 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 129 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 129 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 129 transition count 200
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 128 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 128 transition count 193
Applied a total of 10 rules in 29 ms. Remains 128 /132 variables (removed 4) and now considering 193/206 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 128/132 places, 193/206 transitions.
// Phase 1: matrix 193 rows 128 cols
[2026-05-23 09:02:49] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (229629 resets) in 2648 ms. (377 steps per ms)
BEST_FIRST walk for 1000001 steps (95363 resets) in 922 ms. (1083 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2026-05-23 09:02:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:02:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 09:02:52] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2026-05-23 09:02:52] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-23 09:02:52] [INFO ] [Real]Added 72 Read/Feed constraints in 21 ms returned sat
[2026-05-23 09:02:52] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:02:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 09:02:53] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2026-05-23 09:02:53] [INFO ] [Nat]Added 72 Read/Feed constraints in 30 ms returned sat
[2026-05-23 09:02:53] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 142 transitions) in 16 ms.
[2026-05-23 09:02:53] [INFO ] Added : 18 causal constraints over 4 iterations in 200 ms. Result :sat
Minimization took 197 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 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 193/193 transitions.
Applied a total of 0 rules in 12 ms. Remains 128 /128 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 128/128 places, 193/193 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 193/193 transitions.
Applied a total of 0 rules in 11 ms. Remains 128 /128 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2026-05-23 09:02:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:02:53] [INFO ] Implicit Places using invariants in 176 ms returned []
[2026-05-23 09:02:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:02:53] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-23 09:02:54] [INFO ] Implicit Places using invariants and state equation in 1044 ms returned []
Implicit Place search using SMT with State Equation took 1222 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:02:54] [INFO ] Redundant transitions in 12 ms returned []
Running 192 sub problems to find dead transitions.
[2026-05-23 09:02:54] [INFO ] Invariant cache hit.
[2026-05-23 09:02:54] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/321 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 72/202 constraints. Problems are: Problem set: 0 solved, 192 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 202 constraints, problems are : Problem set: 0 solved, 192 unsolved in 16141 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/321 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 72/202 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 192/394 constraints. Problems are: Problem set: 0 solved, 192 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 321/321 variables, and 394 constraints, problems are : Problem set: 0 solved, 192 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46428ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 46431ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47686 ms. Remains : 128/128 places, 193/193 transitions.
[2026-05-23 09:03:41] [INFO ] Flatten gal took : 66 ms
[2026-05-23 09:03:41] [INFO ] Flatten gal took : 29 ms
[2026-05-23 09:03:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16277490738619449949.gal : 12 ms
[2026-05-23 09:03:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11092816212354977229.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/ReachabilityCardinality16277490738619449949.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11092816212354977229.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
RANDOM walk for 40000 steps (9211 resets) in 321 ms. (124 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality11092816212354977229.prop.
BEST_FIRST walk for 40003 steps (3775 resets) in 87 ms. (454 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
BEST_FIRST walk for 40003 steps (3803 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 528
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :528 after 928
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :928 after 2304
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2304 after 23924
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :23924 after 128290
Interrupted probabilistic random walk after 1514076 steps, run timeout after 3001 ms. (steps per millisecond=504 ) properties seen :1 out of 2
Probabilistic random walk after 1514076 steps, saw 631556 distinct states, run finished after 3001 ms. (steps per millisecond=504 ) properties seen :1
[2026-05-23 09:03:44] [INFO ] Invariant cache hit.
[2026-05-23 09:03:44] [INFO ] State equation strengthened by 72 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 130/220 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 312/321 variables, and 125 constraints, problems are : Problem set: 1 solved, 0 unsolved in 218 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 123/128 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 227ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-06 in 56621 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[3255]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[3255]
// Phase 1: matrix 206 rows 132 cols
[2026-05-23 09:03:44] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3255]
RANDOM walk for 10000 steps (2282 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10000 steps (988 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3255]
[2026-05-23 09:03:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:03:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 09:03:44] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2026-05-23 09:03:44] [INFO ] State equation strengthened by 81 read => feed constraints.
[2026-05-23 09:03:44] [INFO ] [Real]Added 81 Read/Feed constraints in 19 ms returned sat
[2026-05-23 09:03:44] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:03:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 09:03:45] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2026-05-23 09:03:45] [INFO ] [Nat]Added 81 Read/Feed constraints in 27 ms returned sat
[2026-05-23 09:03:45] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 154 transitions) in 17 ms.
[2026-05-23 09:03:45] [INFO ] Added : 10 causal constraints over 3 iterations in 99 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3255]
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 206/206 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 130 transition count 204
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 130 transition count 204
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 128 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 128 transition count 202
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 128 transition count 198
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 125 transition count 178
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 125 transition count 178
Applied a total of 18 rules in 19 ms. Remains 125 /132 variables (removed 7) and now considering 178/206 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 125/132 places, 178/206 transitions.
// Phase 1: matrix 178 rows 125 cols
[2026-05-23 09:03:45] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[3255]
RANDOM walk for 1000000 steps (229807 resets) in 1933 ms. (517 steps per ms)
BEST_FIRST walk for 1000001 steps (95754 resets) in 887 ms. (1126 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[3255]
[2026-05-23 09:03:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:03:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 09:03:48] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2026-05-23 09:03:48] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-23 09:03:48] [INFO ] [Real]Added 57 Read/Feed constraints in 26 ms returned sat
[2026-05-23 09:03:48] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:03:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 09:03:48] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2026-05-23 09:03:48] [INFO ] [Nat]Added 57 Read/Feed constraints in 20 ms returned sat
[2026-05-23 09:03:48] [INFO ] Computed and/alt/rep : 49/119/49 causal constraints (skipped 128 transitions) in 21 ms.
[2026-05-23 09:03:48] [INFO ] Added : 12 causal constraints over 3 iterations in 95 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[3255]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[3255]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 11 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 125/125 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 10 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2026-05-23 09:03:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:03:49] [INFO ] Implicit Places using invariants in 170 ms returned []
[2026-05-23 09:03:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:03:49] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-23 09:03:50] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1181 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:03:50] [INFO ] Redundant transitions in 3 ms returned []
Running 177 sub problems to find dead transitions.
[2026-05-23 09:03:50] [INFO ] Invariant cache hit.
[2026-05-23 09:03:50] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/303 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 184 constraints, problems are : Problem set: 0 solved, 177 unsolved in 12334 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 57/184 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 177/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 303/303 variables, and 361 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 42554ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 42556ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43761 ms. Remains : 125/125 places, 178/178 transitions.
[2026-05-23 09:04:32] [INFO ] Flatten gal took : 44 ms
[2026-05-23 09:04:32] [INFO ] Flatten gal took : 28 ms
[2026-05-23 09:04:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality996584974634405204.gal : 10 ms
[2026-05-23 09:04:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6752783300212859667.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/ReachabilityCardinality996584974634405204.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6752783300212859667.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/ReachabilityCardinality6752783300212859667.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
RANDOM walk for 40000 steps (9237 resets) in 424 ms. (94 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
BEST_FIRST walk for 40002 steps (3779 resets) in 96 ms. (412 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
BEST_FIRST walk for 40004 steps (3763 resets) in 152 ms. (261 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 528
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :528 after 928
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :928 after 2100
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :2100 after 14818
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :14818 after 66419
Interrupted probabilistic random walk after 1598884 steps, run timeout after 3001 ms. (steps per millisecond=532 ) properties seen :1 out of 2
Probabilistic random walk after 1598884 steps, saw 670018 distinct states, run finished after 3001 ms. (steps per millisecond=532 ) properties seen :1
[2026-05-23 09:04:35] [INFO ] Invariant cache hit.
[2026-05-23 09:04:35] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 131/135 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 71/206 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 52/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 15/221 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/221 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 303/303 variables, and 135 constraints, problems are : Problem set: 1 solved, 0 unsolved in 407 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 8/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 417ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[3255]
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-07 in 51641 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-10
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 206 rows 132 cols
[2026-05-23 09:04:36] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2333 resets) in 38 ms. (256 steps per ms)
BEST_FIRST walk for 10000 steps (945 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2026-05-23 09:04:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:04:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2026-05-23 09:04:36] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2026-05-23 09:04:36] [INFO ] State equation strengthened by 81 read => feed constraints.
[2026-05-23 09:04:36] [INFO ] [Real]Added 81 Read/Feed constraints in 39 ms returned sat
[2026-05-23 09:04:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:04:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 09:04:36] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2026-05-23 09:04:36] [INFO ] [Nat]Added 81 Read/Feed constraints in 39 ms returned sat
[2026-05-23 09:04:36] [INFO ] Computed and/alt/rep : 51/123/51 causal constraints (skipped 154 transitions) in 27 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:04:37] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 15 ms to minimize.
[2026-05-23 09:04:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 337 ms
[2026-05-23 09:04:37] [INFO ] Added : 25 causal constraints over 5 iterations in 730 ms. Result :sat
Minimization took 195 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 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 206/206 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 130 transition count 203
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 130 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 130 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 129 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 129 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 10 place count 129 transition count 198
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 126 transition count 178
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 126 transition count 178
Applied a total of 16 rules in 29 ms. Remains 126 /132 variables (removed 6) and now considering 178/206 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 126/132 places, 178/206 transitions.
// Phase 1: matrix 178 rows 126 cols
[2026-05-23 09:04:38] [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 (229976 resets) in 2145 ms. (465 steps per ms)
BEST_FIRST walk for 1000001 steps (94829 resets) in 839 ms. (1190 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2026-05-23 09:04:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:04:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2026-05-23 09:04:41] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-23 09:04:41] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-23 09:04:41] [INFO ] [Real]Added 57 Read/Feed constraints in 28 ms returned sat
[2026-05-23 09:04:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:04:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2026-05-23 09:04:41] [INFO ] [Nat]Absence check using state equation in 109 ms returned sat
[2026-05-23 09:04:41] [INFO ] [Nat]Added 57 Read/Feed constraints in 28 ms returned sat
[2026-05-23 09:04:41] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 127 transitions) in 23 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:04:41] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:04:41] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 13 ms to minimize.
[2026-05-23 09:04:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 454 ms
[2026-05-23 09:04:42] [INFO ] Added : 19 causal constraints over 4 iterations in 691 ms. Result :sat
Minimization took 169 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 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 178/178 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 126/126 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 178/178 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2026-05-23 09:04:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:04:42] [INFO ] Implicit Places using invariants in 215 ms returned []
[2026-05-23 09:04:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:04:42] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-23 09:04:43] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned []
Implicit Place search using SMT with State Equation took 1254 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:04:43] [INFO ] Redundant transitions in 3 ms returned []
Running 177 sub problems to find dead transitions.
[2026-05-23 09:04:43] [INFO ] Invariant cache hit.
[2026-05-23 09:04:43] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/304 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 57/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:04:52] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/304 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 186 constraints, problems are : Problem set: 0 solved, 177 unsolved in 21619 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/304 variables, 126/129 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 57/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 177/363 constraints. Problems are: Problem set: 0 solved, 177 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 304/304 variables, and 363 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51796ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 51798ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53074 ms. Remains : 126/126 places, 178/178 transitions.
[2026-05-23 09:05:35] [INFO ] Flatten gal took : 131 ms
RANDOM walk for 40000 steps (9142 resets) in 426 ms. (93 steps per ms) remains 2/2 properties
[2026-05-23 09:05:35] [INFO ] Flatten gal took : 38 ms
[2026-05-23 09:05:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15823776827225652063.gal : 6 ms
[2026-05-23 09:05:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3941482455444464313.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/ReachabilityCardinality15823776827225652063.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3941482455444464313.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 ...329
BEST_FIRST walk for 40003 steps (3887 resets) in 158 ms. (251 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality3941482455444464313.prop.
BEST_FIRST walk for 40001 steps (3788 resets) in 142 ms. (279 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 30
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :30 after 68
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :68 after 106
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :106 after 182
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :182 after 294
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :294 after 498
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :498 after 868
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :868 after 1558
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1558 after 10241
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :10241 after 47159
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :47159 after 638331
Interrupted probabilistic random walk after 1664818 steps, run timeout after 3001 ms. (steps per millisecond=554 ) properties seen :1 out of 2
Probabilistic random walk after 1664818 steps, saw 696785 distinct states, run finished after 3001 ms. (steps per millisecond=554 ) properties seen :1
[2026-05-23 09:05:38] [INFO ] Invariant cache hit.
[2026-05-23 09:05:38] [INFO ] State equation strengthened by 57 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 74/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 130/220 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 295/304 variables, and 123 constraints, problems are : Problem set: 1 solved, 0 unsolved in 132 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 121/126 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 138ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m10-UpperBounds-10 in 62508 ms.
[2026-05-23 09:05:38] [INFO ] Flatten gal took : 14 ms
[2026-05-23 09:05:38] [INFO ] Applying decomposition
[2026-05-23 09:05:38] [INFO ] Flatten gal took : 15 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/graph17973590858556522766.txt' '-o' '/tmp/graph17973590858556522766.bin' '-w' '/tmp/graph17973590858556522766.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17973590858556522766.bin' '-l' '-1' '-v' '-w' '/tmp/graph17973590858556522766.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:05:39] [INFO ] Decomposing Gal with order
[2026-05-23 09:05:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:05:39] [INFO ] Removed a total of 189 redundant transitions.
[2026-05-23 09:05:39] [INFO ] Flatten gal took : 140 ms
[2026-05-23 09:05:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 135 labels/synchronizations in 27 ms.
[2026-05-23 09:05:39] [INFO ] Time to serialize gal into /tmp/UpperBounds18249748906664345237.gal : 12 ms
[2026-05-23 09:05:39] [INFO ] Time to serialize properties into /tmp/UpperBounds7478988466262295404.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/UpperBounds18249748906664345237.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7478988466262295404.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 ...284
Loading property file /tmp/UpperBounds7478988466262295404.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.02825e+09,65.0636,969080,5363,6152,507234,276245,532,4.89806e+06,240,7.37325e+06,0
Total reachable state count : 1028249609

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m10-UpperBounds-06 :0 <= i3.u8.p172 <= 1
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m10-UpperBounds-06,0,68.0881,969080,1,0,507234,276245,664,4.89806e+06,280,7.37325e+06,1576
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m10-UpperBounds-07 :0 <= i0.u0.l1768 <= 1
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m10-UpperBounds-07,0,69.6614,969080,1,0,507234,276245,691,4.89806e+06,309,7.37325e+06,2173
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m10-UpperBounds-10 :0 <= i0.u15.p93 <= 1
FORMULA DBSingleClientW-PT-d2m10-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m10-UpperBounds-10,0,69.6661,969080,1,0,507234,276245,711,4.89806e+06,309,7.37325e+06,2557
Total runtime 336097 ms.

BK_STOP 1779527209488

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ 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-d2m10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
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-5973"
echo " Executing tool gold2025"
echo " Input is DBSingleClientW-PT-d2m10, 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 r095-smll-177946996300031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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