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-171624187800469.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-d0m08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187800469
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 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-d0m08-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716287869045

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-d0m08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:37:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 10:37:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:37:50] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-05-21 10:37:50] [INFO ] Transformed 553 places.
[2024-05-21 10:37:50] [INFO ] Transformed 150 transitions.
[2024-05-21 10:37:50] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0] Max Struct:[+inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0] Max Struct:[+inf, +inf]
// Phase 1: matrix 150 rows 109 cols
[2024-05-21 10:37:50] [INFO ] Computed 6 invariants in 25 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[8, 6]
RANDOM walk for 10000 steps (2315 resets) in 38 ms. (256 steps per ms)
BEST_FIRST walk for 20001 steps (2078 resets) in 40 ms. (487 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[8, 6]
[2024-05-21 10:37:50] [INFO ] Invariant cache hit.
[2024-05-21 10:37:50] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 10:37:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 10:37:50] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-21 10:37:50] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 10:37:50] [INFO ] [Real]Added 74 Read/Feed constraints in 12 ms returned sat
[2024-05-21 10:37:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:37:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-21 10:37:51] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-21 10:37:51] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 10:37:51] [INFO ] [Nat]Added 74 Read/Feed constraints in 10 ms returned sat
[2024-05-21 10:37:51] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 26 ms.
[2024-05-21 10:37:51] [INFO ] Added : 8 causal constraints over 3 iterations in 72 ms. Result :sat
Minimization took 94 ms.
[2024-05-21 10:37:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-21 10:37:51] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-21 10:37:51] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 10:37:51] [INFO ] [Real]Added 74 Read/Feed constraints in 26 ms returned sat
[2024-05-21 10:37:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:37:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-21 10:37:51] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-21 10:37:51] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 10:37:51] [INFO ] [Nat]Added 74 Read/Feed constraints in 10 ms returned sat
[2024-05-21 10:37:51] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 20 ms to minimize.
[2024-05-21 10:37:51] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 2 ms to minimize.
[2024-05-21 10:37:51] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-21 10:37:51] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-21 10:37:51] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-21 10:37:51] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 10:37:51] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-21 10:37:51] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-21 10:37:51] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-21 10:37:52] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 2 ms to minimize.
[2024-05-21 10:37:52] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-21 10:37:52] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 640 ms
[2024-05-21 10:37:52] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 19 ms.
[2024-05-21 10:37:52] [INFO ] Added : 11 causal constraints over 3 iterations in 74 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[8, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[8, 6]
Support contains 2 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.3 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 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 36 place count 79 transition count 97
Iterating global reduction 1 with 22 rules applied. Total rules applied 58 place count 79 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 79 transition count 96
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 70 place count 68 transition count 85
Iterating global reduction 2 with 11 rules applied. Total rules applied 81 place count 68 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 82 place count 68 transition count 84
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 84 place count 66 transition count 81
Iterating global reduction 3 with 2 rules applied. Total rules applied 86 place count 66 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 66 transition count 80
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 88 place count 65 transition count 78
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 90 place count 64 transition count 77
Iterating global reduction 4 with 1 rules applied. Total rules applied 91 place count 64 transition count 77
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 92 place count 63 transition count 76
Iterating global reduction 4 with 1 rules applied. Total rules applied 93 place count 63 transition count 76
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 95 place count 63 transition count 74
Applied a total of 95 rules in 60 ms. Remains 63 /109 variables (removed 46) and now considering 74/150 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 63/109 places, 74/150 transitions.
// Phase 1: matrix 74 rows 63 cols
[2024-05-21 10:37:52] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[8, 6]
RANDOM walk for 1000000 steps (229044 resets) in 785 ms. (1272 steps per ms)
BEST_FIRST walk for 2000001 steps (202886 resets) in 735 ms. (2717 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0] Max Struct:[8, 6]
[2024-05-21 10:37:53] [INFO ] Invariant cache hit.
[2024-05-21 10:37:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:37:53] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-21 10:37:53] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 10:37:54] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-05-21 10:37:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:37:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:37:54] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-21 10:37:54] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-21 10:37:54] [INFO ] Computed and/alt/rep : 21/45/21 causal constraints (skipped 52 transitions) in 6 ms.
[2024-05-21 10:37:54] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 3 ms to minimize.
[2024-05-21 10:37:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-21 10:37:54] [INFO ] Added : 8 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 38 ms.
[2024-05-21 10:37:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:37:54] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-21 10:37:54] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-05-21 10:37:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:37:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:37:54] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-21 10:37:54] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-21 10:37:54] [INFO ] Computed and/alt/rep : 21/45/21 causal constraints (skipped 52 transitions) in 7 ms.
[2024-05-21 10:37:54] [INFO ] Added : 9 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0] Max Struct:[8, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[8, 6]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 63/63 places, 74/74 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 10:37:54] [INFO ] Invariant cache hit.
[2024-05-21 10:37:54] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 10:37:54] [INFO ] Invariant cache hit.
[2024-05-21 10:37:54] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 10:37:54] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-21 10:37:54] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2024-05-21 10:37:54] [INFO ] Invariant cache hit.
[2024-05-21 10:37:54] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/137 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 73 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/137 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 86 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1135 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/137 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 73/159 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 159 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2093 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 3327ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 3337ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3504 ms. Remains : 63/63 places, 74/74 transitions.
[2024-05-21 10:37:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0] Max Struct:[8, 6]
RANDOM walk for 1000000 steps (229009 resets) in 667 ms. (1497 steps per ms)
BEST_FIRST walk for 2000000 steps (203971 resets) in 678 ms. (2945 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0] Max Struct:[8, 6]
[2024-05-21 10:37:59] [INFO ] Invariant cache hit.
[2024-05-21 10:37:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:37:59] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-21 10:37:59] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 10:37:59] [INFO ] [Real]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-21 10:37:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:37:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:37:59] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-21 10:37:59] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-21 10:37:59] [INFO ] Computed and/alt/rep : 21/45/21 causal constraints (skipped 52 transitions) in 10 ms.
[2024-05-21 10:37:59] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-21 10:37:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-21 10:37:59] [INFO ] Added : 8 causal constraints over 3 iterations in 95 ms. Result :sat
Minimization took 38 ms.
[2024-05-21 10:37:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:37:59] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-21 10:37:59] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-05-21 10:37:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:37:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:37:59] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-21 10:37:59] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-21 10:37:59] [INFO ] Computed and/alt/rep : 21/45/21 causal constraints (skipped 52 transitions) in 6 ms.
[2024-05-21 10:37:59] [INFO ] Added : 9 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0] Max Struct:[8, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 0] Max Struct:[8, 6]
Support contains 2 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 63/63 places, 74/74 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2024-05-21 10:37:59] [INFO ] Invariant cache hit.
[2024-05-21 10:37:59] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-21 10:37:59] [INFO ] Invariant cache hit.
[2024-05-21 10:37:59] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 10:37:59] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-21 10:37:59] [INFO ] Redundant transitions in 0 ms returned []
Running 73 sub problems to find dead transitions.
[2024-05-21 10:37:59] [INFO ] Invariant cache hit.
[2024-05-21 10:37:59] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/137 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 73 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/137 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 86 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1045 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 1/63 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 74/137 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 21/86 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 73/159 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 159 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2006 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints]
After SMT, in 3109ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 3111ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3254 ms. Remains : 63/63 places, 74/74 transitions.
RANDOM walk for 40000 steps (9112 resets) in 1025 ms. (38 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4087 resets) in 192 ms. (207 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (4112 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4029 resets) in 74 ms. (533 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (4029 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 897005 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :2 out of 4
Probabilistic random walk after 897005 steps, saw 358833 distinct states, run finished after 3004 ms. (steps per millisecond=298 ) properties seen :2
[2024-05-21 10:38:06] [INFO ] Invariant cache hit.
[2024-05-21 10:38:06] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 62/68 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 40/108 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 26/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX1 is UNSAT
At refinement iteration 9 (OVERLAPS) 29/137 variables, 28/71 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 15/86 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 10:38:06] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 137/137 variables, and 87 constraints, problems are : Problem set: 2 solved, 0 unsolved in 148 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 63/63 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 151ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[1, 0] Max Struct:[8, 6]
Starting property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-00
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:[8]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[8]
[2024-05-21 10:38:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 10000 steps (2337 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (989 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-21 10:38:06] [INFO ] Invariant cache hit.
[2024-05-21 10:38:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:38:06] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-21 10:38:06] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 10:38:06] [INFO ] [Real]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-05-21 10:38:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:38:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:38:06] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-21 10:38:06] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2024-05-21 10:38:06] [INFO ] Computed and/alt/rep : 21/45/21 causal constraints (skipped 52 transitions) in 6 ms.
[2024-05-21 10:38:06] [INFO ] Added : 7 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 62 transition count 72
Applied a total of 3 rules in 11 ms. Remains 62 /63 variables (removed 1) and now considering 72/74 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 62/63 places, 72/74 transitions.
// Phase 1: matrix 72 rows 62 cols
[2024-05-21 10:38:06] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[8]
RANDOM walk for 1000000 steps (229196 resets) in 668 ms. (1494 steps per ms)
BEST_FIRST walk for 1000001 steps (101630 resets) in 337 ms. (2958 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[8]
[2024-05-21 10:38:07] [INFO ] Invariant cache hit.
[2024-05-21 10:38:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 10:38:07] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-21 10:38:07] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 10:38:07] [INFO ] [Real]Added 21 Read/Feed constraints in 5 ms returned sat
[2024-05-21 10:38:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:38:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-21 10:38:08] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-21 10:38:08] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-05-21 10:38:08] [INFO ] Computed and/alt/rep : 20/43/20 causal constraints (skipped 51 transitions) in 5 ms.
[2024-05-21 10:38:08] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-21 10:38:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-21 10:38:08] [INFO ] Added : 10 causal constraints over 2 iterations in 74 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[8]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[8]
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 62/62 places, 72/72 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 72/72 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 72/72 (removed 0) transitions.
[2024-05-21 10:38:08] [INFO ] Invariant cache hit.
[2024-05-21 10:38:08] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 10:38:08] [INFO ] Invariant cache hit.
[2024-05-21 10:38:08] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 10:38:08] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-21 10:38:08] [INFO ] Redundant transitions in 1 ms returned []
Running 71 sub problems to find dead transitions.
[2024-05-21 10:38:08] [INFO ] Invariant cache hit.
[2024-05-21 10:38:08] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 21/85 constraints. Problems are: Problem set: 0 solved, 71 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (OVERLAPS) 0/134 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 85 constraints, problems are : Problem set: 0 solved, 71 unsolved in 983 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 1/62 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 72/134 variables, 62/64 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 21/85 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 71/156 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 156 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1920 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 0/0 constraints]
After SMT, in 2969ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2970ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3111 ms. Remains : 62/62 places, 72/72 transitions.
RANDOM walk for 40000 steps (9104 resets) in 64 ms. (615 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (4089 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3947 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3032126 steps, run timeout after 3001 ms. (steps per millisecond=1010 ) properties seen :1 out of 2
Probabilistic random walk after 3032126 steps, saw 1159476 distinct states, run finished after 3001 ms. (steps per millisecond=1010 ) properties seen :1
[2024-05-21 10:38:14] [INFO ] Invariant cache hit.
[2024-05-21 10:38:14] [INFO ] State equation strengthened by 21 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) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 58/61 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/97 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 23/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/103 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/103 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 31/134 variables, 30/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/134 variables, 16/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 10:38:14] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 2 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 134/134 variables, and 86 constraints, problems are : Problem set: 1 solved, 0 unsolved in 108 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 62/62 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 114ms 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:[0] Max Struct:[8]
Ending property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-00 in 7770 ms.
Starting property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 74 rows 63 cols
[2024-05-21 10:38:14] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2281 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10001 steps (996 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-21 10:38:14] [INFO ] Invariant cache hit.
[2024-05-21 10:38:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:38:14] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-21 10:38:14] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 10:38:14] [INFO ] [Real]Added 21 Read/Feed constraints in 6 ms returned sat
[2024-05-21 10:38:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:38:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:38:14] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-21 10:38:14] [INFO ] [Nat]Added 21 Read/Feed constraints in 2 ms returned sat
[2024-05-21 10:38:14] [INFO ] Computed and/alt/rep : 21/45/21 causal constraints (skipped 52 transitions) in 6 ms.
[2024-05-21 10:38:14] [INFO ] Added : 9 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 74/74 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 62 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 62 transition count 73
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 61 transition count 72
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 61 transition count 72
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 60 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 60 transition count 69
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 58 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 58 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 58 transition count 65
Applied a total of 12 rules in 23 ms. Remains 58 /63 variables (removed 5) and now considering 65/74 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 58/63 places, 65/74 transitions.
// Phase 1: matrix 65 rows 58 cols
[2024-05-21 10:38:14] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (229503 resets) in 599 ms. (1666 steps per ms)
BEST_FIRST walk for 1000000 steps (102310 resets) in 322 ms. (3095 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[6]
[2024-05-21 10:38:15] [INFO ] Invariant cache hit.
[2024-05-21 10:38:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 10:38:15] [INFO ] [Real]Absence check using state equation in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[1]
FORMULA DBSingleClientW-PT-d0m08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for DBSingleClientW-PT-d0m08-UpperBounds-06 in 1183 ms.
[2024-05-21 10:38:15] [INFO ] Flatten gal took : 29 ms
[2024-05-21 10:38:15] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-21 10:38:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 63 places, 74 transitions and 292 arcs took 3 ms.
Total runtime 25521 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d0m08

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/414/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: 712
MODEL NAME: /home/mcc/execution/414/model
63 places, 74 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-d0m08-UpperBounds-00 5 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716287896885

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ 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-d0m08"
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-d0m08, 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-171624187800469"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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