Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r069-smll-174854075800020.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is DBSingleClientW-PT-d2m09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075800020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 38K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.6M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748603017765

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 11:03:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 11:03:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:03:41] [INFO ] Load time of PNML (sax parser for PT used): 722 ms
[2025-05-30 11:03:41] [INFO ] Transformed 4763 places.
[2025-05-30 11:03:41] [INFO ] Transformed 2478 transitions.
[2025-05-30 11:03:41] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 962 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 16 ms.
Deduced a syphon composed of 3580 places in 39 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 2478 rows 1183 cols
[2025-05-30 11:03:41] [INFO ] Computed 6 invariants in 254 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 10000 steps (2326 resets) in 708 ms. (14 steps per ms)
BEST_FIRST walk for 10001 steps (972 resets) in 126 ms. (78 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[4]
[2025-05-30 11:03:42] [INFO ] Invariant cache hit.
[2025-05-30 11:03:43] [INFO ] [Real]Absence check using 2 positive place invariants in 44 ms returned sat
[2025-05-30 11:03:43] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 25 ms returned sat
[2025-05-30 11:03:44] [INFO ] [Real]Absence check using state equation in 1385 ms returned sat
[2025-05-30 11:03:45] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2025-05-30 11:03:47] [INFO ] SMT solver returned unknown. Retrying;
[2025-05-30 11:03:47] [INFO ] [Real]Added 1588 Read/Feed constraints in 1464 ms returned sat
[2025-05-30 11:03:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:03:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 17 ms returned sat
[2025-05-30 11:03:47] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2025-05-30 11:03:48] [INFO ] [Nat]Absence check using state equation in 1375 ms returned sat
[2025-05-30 11:03:50] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1135 ms returned sat
[2025-05-30 11:03:51] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 1173 ms.
[2025-05-30 11:03:51] [INFO ] Added : 2 causal constraints over 1 iterations in 1737 ms. Result :sat
Minimization took 213 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[4]
Support contains 1 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.18 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 316 places :
Symmetric choice reduction at 2 with 316 rule applications. Total rules 1325 place count 429 transition count 875
Iterating global reduction 2 with 316 rules applied. Total rules applied 1641 place count 429 transition count 875
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1653 place count 429 transition count 863
Discarding 241 places :
Symmetric choice reduction at 3 with 241 rule applications. Total rules 1894 place count 188 transition count 521
Iterating global reduction 3 with 241 rules applied. Total rules applied 2135 place count 188 transition count 521
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 212 transitions.
Iterating post reduction 3 with 212 rules applied. Total rules applied 2347 place count 188 transition count 309
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2372 place count 163 transition count 269
Iterating global reduction 4 with 25 rules applied. Total rules applied 2397 place count 163 transition count 269
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2403 place count 163 transition count 263
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2419 place count 147 transition count 247
Iterating global reduction 5 with 16 rules applied. Total rules applied 2435 place count 147 transition count 247
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2439 place count 147 transition count 243
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2452 place count 134 transition count 230
Iterating global reduction 6 with 13 rules applied. Total rules applied 2465 place count 134 transition count 230
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2477 place count 134 transition count 218
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 2485 place count 126 transition count 174
Iterating global reduction 7 with 8 rules applied. Total rules applied 2493 place count 126 transition count 174
Applied a total of 2493 rules in 555 ms. Remains 126 /1183 variables (removed 1057) and now considering 174/2478 (removed 2304) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 578 ms. Remains : 126/1183 places, 174/2478 transitions.
// Phase 1: matrix 174 rows 126 cols
[2025-05-30 11:03:52] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[4]
RANDOM walk for 1000000 steps (230199 resets) in 1793 ms. (557 steps per ms)
BEST_FIRST walk for 1000001 steps (95475 resets) in 732 ms. (1364 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2025-05-30 11:03:55] [INFO ] Invariant cache hit.
[2025-05-30 11:03:55] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2025-05-30 11:03:55] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2025-05-30 11:03:55] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-05-30 11:03:55] [INFO ] [Real]Added 51 Read/Feed constraints in 19 ms returned sat
[2025-05-30 11:03:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:03:55] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 11:03:55] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2025-05-30 11:03:55] [INFO ] [Nat]Added 51 Read/Feed constraints in 10 ms returned sat
[2025-05-30 11:03:55] [INFO ] Computed and/alt/rep : 50/121/50 causal constraints (skipped 123 transitions) in 36 ms.
[2025-05-30 11:03:55] [INFO ] Added : 2 causal constraints over 1 iterations in 90 ms. Result :sat
Minimization took 126 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 174/174 transitions.
Applied a total of 0 rules in 24 ms. Remains 126 /126 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 126/126 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 174/174 transitions.
Applied a total of 0 rules in 17 ms. Remains 126 /126 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2025-05-30 11:03:55] [INFO ] Invariant cache hit.
[2025-05-30 11:03:56] [INFO ] Implicit Places using invariants in 126 ms returned []
[2025-05-30 11:03:56] [INFO ] Invariant cache hit.
[2025-05-30 11:03:56] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-05-30 11:03:56] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2025-05-30 11:03:56] [INFO ] Redundant transitions in 6 ms returned []
Running 173 sub problems to find dead transitions.
[2025-05-30 11:03:56] [INFO ] Invariant cache hit.
[2025-05-30 11:03:56] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/300 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 51/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 179 constraints, problems are : Problem set: 0 solved, 173 unsolved in 8087 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/300 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 51/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 173/352 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 352 constraints, problems are : Problem set: 0 solved, 173 unsolved in 18164 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
After SMT, in 26767ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 26782ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27310 ms. Remains : 126/126 places, 174/174 transitions.
[2025-05-30 11:04:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[4]
RANDOM walk for 1000000 steps (230221 resets) in 2098 ms. (476 steps per ms)
BEST_FIRST walk for 1000000 steps (94979 resets) in 681 ms. (1466 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[4]
[2025-05-30 11:04:26] [INFO ] Invariant cache hit.
[2025-05-30 11:04:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 11:04:26] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2025-05-30 11:04:26] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-05-30 11:04:26] [INFO ] [Real]Added 51 Read/Feed constraints in 20 ms returned sat
[2025-05-30 11:04:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:04:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2025-05-30 11:04:26] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2025-05-30 11:04:26] [INFO ] [Nat]Added 51 Read/Feed constraints in 15 ms returned sat
[2025-05-30 11:04:26] [INFO ] Computed and/alt/rep : 50/121/50 causal constraints (skipped 123 transitions) in 22 ms.
[2025-05-30 11:04:26] [INFO ] Added : 2 causal constraints over 1 iterations in 76 ms. Result :sat
Minimization took 152 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[4]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 174/174 transitions.
Applied a total of 0 rules in 13 ms. Remains 126 /126 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 126/126 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 174/174 transitions.
Applied a total of 0 rules in 12 ms. Remains 126 /126 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2025-05-30 11:04:26] [INFO ] Invariant cache hit.
[2025-05-30 11:04:26] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-05-30 11:04:26] [INFO ] Invariant cache hit.
[2025-05-30 11:04:27] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-05-30 11:04:27] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
[2025-05-30 11:04:27] [INFO ] Redundant transitions in 7 ms returned []
Running 173 sub problems to find dead transitions.
[2025-05-30 11:04:27] [INFO ] Invariant cache hit.
[2025-05-30 11:04:27] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/300 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 51/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 179 constraints, problems are : Problem set: 0 solved, 173 unsolved in 9752 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/300 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 51/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 173/352 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 352 constraints, problems are : Problem set: 0 solved, 173 unsolved in 18130 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
After SMT, in 28206ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 28209ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29072 ms. Remains : 126/126 places, 174/174 transitions.
RANDOM walk for 40000 steps (9139 resets) in 1076 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3829 resets) in 301 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (3875 resets) in 252 ms. (158 steps per ms) remains 2/2 properties
[2025-05-30 11:04:56] [INFO ] Flatten gal took : 130 ms
[2025-05-30 11:04:56] [INFO ] Flatten gal took : 43 ms
[2025-05-30 11:04:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8442767446531118873.gal : 16 ms
[2025-05-30 11:04:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3904286985231146165.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8442767446531118873.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3904286985231146165.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality3904286985231146165.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 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 142
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :142 after 218
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :218 after 378
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :378 after 650
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :650 after 1176
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1176 after 10709
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :10709 after 87040
Interrupted probabilistic random walk after 601961 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 2
Probabilistic random walk after 601961 steps, saw 247019 distinct states, run finished after 3007 ms. (steps per millisecond=200 ) properties seen :0
[2025-05-30 11:04:59] [INFO ] Invariant cache hit.
[2025-05-30 11:04:59] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 76/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 134/226 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 65/291 variables, 29/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 47/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/300 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 305 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 76/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 134/226 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 65/291 variables, 29/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 47/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/300 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/300 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/300 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 225 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 541ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 181 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 174/174 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 126/126 places, 174/174 transitions.
RANDOM walk for 40000 steps (9110 resets) in 387 ms. (103 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3716 resets) in 151 ms. (263 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3862 resets) in 207 ms. (192 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :87040 after 338281
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :338281 after 2.42938e+06
Interrupted probabilistic random walk after 631647 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :0 out of 2
Probabilistic random walk after 631647 steps, saw 260913 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
[2025-05-30 11:05:03] [INFO ] Invariant cache hit.
[2025-05-30 11:05:03] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 76/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 134/226 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 65/291 variables, 29/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 47/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/300 variables, 5/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/300 variables, 4/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 212 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 76/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 134/226 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 65/291 variables, 29/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 47/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 2/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/300 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/300 variables, 4/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/300 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/300 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 181 constraints, problems are : Problem set: 0 solved, 2 unsolved in 227 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 465ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 170 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 174/174 transitions.
Applied a total of 0 rules in 13 ms. Remains 126 /126 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 126/126 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 174/174 transitions.
Applied a total of 0 rules in 12 ms. Remains 126 /126 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2025-05-30 11:05:04] [INFO ] Invariant cache hit.
[2025-05-30 11:05:04] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-05-30 11:05:04] [INFO ] Invariant cache hit.
[2025-05-30 11:05:04] [INFO ] State equation strengthened by 51 read => feed constraints.
[2025-05-30 11:05:04] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
[2025-05-30 11:05:04] [INFO ] Redundant transitions in 2 ms returned []
Running 173 sub problems to find dead transitions.
[2025-05-30 11:05:04] [INFO ] Invariant cache hit.
[2025-05-30 11:05:04] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :2.42938e+06 after 1.54583e+07
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/300 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 51/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/300 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 179 constraints, problems are : Problem set: 0 solved, 173 unsolved in 6789 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/300 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 51/179 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 173/352 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 32769 fixpoint passes
After SMT solving in domain Int declared 300/300 variables, and 352 constraints, problems are : Problem set: 0 solved, 173 unsolved in 17869 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 0/0 constraints]
After SMT, in 25095ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 25100ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25605 ms. Remains : 126/126 places, 174/174 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-12 4 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 109272 ms.

BK_STOP 1748603129714

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d2m09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is DBSingleClientW-PT-d2m09, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-smll-174854075800020"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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