Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 12 12:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716288638036

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:50:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 10:50:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:50:39] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-05-21 10:50:39] [INFO ] Transformed 553 places.
[2024-05-21 10:50:39] [INFO ] Transformed 150 transitions.
[2024-05-21 10:50:39] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m10-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 150 rows 109 cols
[2024-05-21 10:50:39] [INFO ] Computed 6 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 10000 steps (2272 resets) in 35 ms. (277 steps per ms)
BEST_FIRST walk for 10000 steps (960 resets) in 34 ms. (285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[5]
[2024-05-21 10:50:39] [INFO ] Invariant cache hit.
[2024-05-21 10:50:39] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-21 10:50:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2024-05-21 10:50:39] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-21 10:50:39] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 10:50:39] [INFO ] [Real]Added 74 Read/Feed constraints in 14 ms returned sat
[2024-05-21 10:50:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:50:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-21 10:50:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-21 10:50:40] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-05-21 10:50:40] [INFO ] [Nat]Added 74 Read/Feed constraints in 16 ms returned sat
[2024-05-21 10:50:40] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 27 ms.
[2024-05-21 10:50:40] [INFO ] Added : 2 causal constraints over 1 iterations in 54 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[5]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 101 transition count 137
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 38 place count 77 transition count 95
Iterating global reduction 1 with 24 rules applied. Total rules applied 62 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 77 transition count 94
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 75 place count 65 transition count 82
Iterating global reduction 2 with 12 rules applied. Total rules applied 87 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 65 transition count 80
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 91 place count 63 transition count 77
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 63 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 63 transition count 76
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 95 place count 62 transition count 74
Iterating global reduction 4 with 1 rules applied. Total rules applied 96 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 61 transition count 73
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 61 transition count 73
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 60 transition count 72
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 60 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 102 place count 60 transition count 70
Applied a total of 102 rules in 56 ms. Remains 60 /109 variables (removed 49) and now considering 70/150 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 60/109 places, 70/150 transitions.
// Phase 1: matrix 70 rows 60 cols
[2024-05-21 10:50:40] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[5]
RANDOM walk for 1000000 steps (228877 resets) in 929 ms. (1075 steps per ms)
BEST_FIRST walk for 1000001 steps (101000 resets) in 375 ms. (2659 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[5]
[2024-05-21 10:50:41] [INFO ] Invariant cache hit.
[2024-05-21 10:50:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 10:50:41] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-21 10:50:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:50:41] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-21 10:50:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:50:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:50:41] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-21 10:50:41] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-21 10:50:41] [INFO ] Computed and/alt/rep : 19/42/19 causal constraints (skipped 50 transitions) in 13 ms.
[2024-05-21 10:50:41] [INFO ] Added : 2 causal constraints over 1 iterations in 33 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[5]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 8 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 60/60 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-21 10:50:41] [INFO ] Invariant cache hit.
[2024-05-21 10:50:41] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 10:50:41] [INFO ] Invariant cache hit.
[2024-05-21 10:50:41] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:50:41] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-21 10:50:41] [INFO ] Redundant transitions in 0 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-21 10:50:41] [INFO ] Invariant cache hit.
[2024-05-21 10:50:41] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 82 constraints, problems are : Problem set: 0 solved, 69 unsolved in 978 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 69/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 151 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1994 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 3089ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 3097ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3263 ms. Remains : 60/60 places, 70/70 transitions.
[2024-05-21 10:50:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[5]
RANDOM walk for 1000000 steps (229009 resets) in 668 ms. (1494 steps per ms)
BEST_FIRST walk for 1000000 steps (101180 resets) in 352 ms. (2832 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[5]
[2024-05-21 10:50:46] [INFO ] Invariant cache hit.
[2024-05-21 10:50:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:50:46] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-21 10:50:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:50:46] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-21 10:50:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:50:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:50:46] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-21 10:50:46] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-21 10:50:46] [INFO ] Computed and/alt/rep : 19/42/19 causal constraints (skipped 50 transitions) in 6 ms.
[2024-05-21 10:50:46] [INFO ] Added : 2 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[5]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 60/60 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-21 10:50:46] [INFO ] Invariant cache hit.
[2024-05-21 10:50:46] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 10:50:46] [INFO ] Invariant cache hit.
[2024-05-21 10:50:46] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:50:46] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-21 10:50:46] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-21 10:50:46] [INFO ] Invariant cache hit.
[2024-05-21 10:50:46] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 82 constraints, problems are : Problem set: 0 solved, 69 unsolved in 914 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 69/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 151 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1947 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 2935ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2939ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3105 ms. Remains : 60/60 places, 70/70 transitions.
RANDOM walk for 40000 steps (9168 resets) in 822 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4042 resets) in 254 ms. (156 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4101 resets) in 140 ms. (283 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1763267 steps, run timeout after 3001 ms. (steps per millisecond=587 ) properties seen :1 out of 2
Probabilistic random walk after 1763267 steps, saw 682285 distinct states, run finished after 3004 ms. (steps per millisecond=586 ) properties seen :1
[2024-05-21 10:50:52] [INFO ] Invariant cache hit.
[2024-05-21 10:50:52] [INFO ] State equation strengthened by 20 read => feed constraints.
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) 36/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/96 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/121 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/130 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 82 constraints, problems are : Problem set: 0 solved, 1 unsolved in 60 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 36/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/96 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/121 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Int declared 130/130 variables, and 79 constraints, problems are : Problem set: 1 solved, 0 unsolved in 52 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 16/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 120ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[5]
Starting property specific reduction for DBSingleClientW-PT-d0m10-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[5]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[5]
[2024-05-21 10:50:52] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[5]
RANDOM walk for 10000 steps (2309 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10000 steps (1023 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[5]
[2024-05-21 10:50:52] [INFO ] Invariant cache hit.
[2024-05-21 10:50:52] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:50:52] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-21 10:50:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:50:52] [INFO ] [Real]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-21 10:50:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:50:52] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:50:52] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-21 10:50:52] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-21 10:50:52] [INFO ] Computed and/alt/rep : 19/42/19 causal constraints (skipped 50 transitions) in 4 ms.
[2024-05-21 10:50:53] [INFO ] Added : 2 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[5]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 60/60 places, 70/70 transitions.
[2024-05-21 10:50:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[5]
RANDOM walk for 1000000 steps (228812 resets) in 669 ms. (1492 steps per ms)
BEST_FIRST walk for 1000000 steps (101499 resets) in 338 ms. (2949 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[5]
[2024-05-21 10:50:54] [INFO ] Invariant cache hit.
[2024-05-21 10:50:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:50:54] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-21 10:50:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:50:54] [INFO ] [Real]Added 20 Read/Feed constraints in 4 ms returned sat
[2024-05-21 10:50:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:50:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:50:54] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-21 10:50:54] [INFO ] [Nat]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-21 10:50:54] [INFO ] Computed and/alt/rep : 19/42/19 causal constraints (skipped 50 transitions) in 5 ms.
[2024-05-21 10:50:54] [INFO ] Added : 2 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[5]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 60/60 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-21 10:50:54] [INFO ] Invariant cache hit.
[2024-05-21 10:50:54] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 10:50:54] [INFO ] Invariant cache hit.
[2024-05-21 10:50:54] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:50:54] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-21 10:50:54] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-21 10:50:54] [INFO ] Invariant cache hit.
[2024-05-21 10:50:54] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 82 constraints, problems are : Problem set: 0 solved, 69 unsolved in 930 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 69/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 151 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1847 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 2837ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2838ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2983 ms. Remains : 60/60 places, 70/70 transitions.
[2024-05-21 10:50:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[5]
RANDOM walk for 1000000 steps (228932 resets) in 656 ms. (1522 steps per ms)
BEST_FIRST walk for 1000001 steps (101769 resets) in 344 ms. (2898 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[5]
[2024-05-21 10:50:58] [INFO ] Invariant cache hit.
[2024-05-21 10:50:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:50:58] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-21 10:50:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:50:58] [INFO ] [Real]Added 20 Read/Feed constraints in 3 ms returned sat
[2024-05-21 10:50:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:50:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:50:58] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-21 10:50:58] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-05-21 10:50:58] [INFO ] Computed and/alt/rep : 19/42/19 causal constraints (skipped 50 transitions) in 6 ms.
[2024-05-21 10:50:58] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[5]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[5]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 60/60 places, 70/70 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 70/70 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-21 10:50:58] [INFO ] Invariant cache hit.
[2024-05-21 10:50:58] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-21 10:50:58] [INFO ] Invariant cache hit.
[2024-05-21 10:50:58] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-21 10:50:58] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-21 10:50:58] [INFO ] Redundant transitions in 1 ms returned []
Running 69 sub problems to find dead transitions.
[2024-05-21 10:50:58] [INFO ] Invariant cache hit.
[2024-05-21 10:50:58] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 82 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1021 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 2 (OVERLAPS) 1/60 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 4 (OVERLAPS) 70/130 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 69/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 151 constraints, problems are : Problem set: 0 solved, 69 unsolved in 1916 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 69/69 constraints, Known Traps: 0/0 constraints]
After SMT, in 2995ms problems are : Problem set: 0 solved, 69 unsolved
Search for dead transitions found 0 dead transitions in 2998ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3144 ms. Remains : 60/60 places, 70/70 transitions.
RANDOM walk for 40000 steps (9170 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4018 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (4040 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2096131 steps, run timeout after 3001 ms. (steps per millisecond=698 ) properties seen :1 out of 2
Probabilistic random walk after 2096131 steps, saw 797808 distinct states, run finished after 3003 ms. (steps per millisecond=698 ) properties seen :1
[2024-05-21 10:51:04] [INFO ] Invariant cache hit.
[2024-05-21 10:51:04] [INFO ] State equation strengthened by 20 read => feed constraints.
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) 36/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/96 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/121 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/130 variables, 5/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/130 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 82 constraints, problems are : Problem set: 0 solved, 1 unsolved in 72 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 36/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/43 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 53/96 variables, 43/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 25/121 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Int declared 130/130 variables, and 79 constraints, problems are : Problem set: 1 solved, 0 unsolved in 57 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 16/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 133ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2] Max Struct:[5]
Ending property specific reduction for DBSingleClientW-PT-d0m10-UpperBounds-13 in 11854 ms.
[2024-05-21 10:51:04] [INFO ] Flatten gal took : 29 ms
[2024-05-21 10:51:04] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-21 10:51:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 60 places, 70 transitions and 276 arcs took 4 ms.
Total runtime 25640 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d0m10

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 60
TRANSITIONS: 70
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.000s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 665
MODEL NAME: /home/mcc/execution/413/model
60 places, 70 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DBSingleClientW-PT-d0m10-UpperBounds-13 4 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716288666096

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-d0m10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DBSingleClientW-PT-d0m10, 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 r091-tall-171624187800485"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m10.tgz
mv DBSingleClientW-PT-d0m10 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;