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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 7.3K 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.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Apr 12 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 12 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 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 432K 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-d1m09-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716293891057

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-d1m09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 12:18:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 12:18:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 12:18:12] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-05-21 12:18:12] [INFO ] Transformed 1440 places.
[2024-05-21 12:18:12] [INFO ] Transformed 672 transitions.
[2024-05-21 12:18:12] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 232 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 672 rows 347 cols
[2024-05-21 12:18:12] [INFO ] Computed 6 invariants in 52 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[7, 11, 7, 9]
RANDOM walk for 10000 steps (2325 resets) in 125 ms. (79 steps per ms)
BEST_FIRST walk for 40003 steps (3836 resets) in 182 ms. (218 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 1, 0] Max Struct:[7, 11, 7, 9]
[2024-05-21 12:18:12] [INFO ] Invariant cache hit.
[2024-05-21 12:18:13] [INFO ] [Real]Absence check using 2 positive place invariants in 14 ms returned sat
[2024-05-21 12:18:13] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned unsat
[2024-05-21 12:18:13] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 12:18:13] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 12:18:13] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-21 12:18:13] [INFO ] State equation strengthened by 418 read => feed constraints.
[2024-05-21 12:18:13] [INFO ] [Real]Added 418 Read/Feed constraints in 151 ms returned sat
[2024-05-21 12:18:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:18:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 12:18:13] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2024-05-21 12:18:14] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2024-05-21 12:18:14] [INFO ] [Nat]Added 418 Read/Feed constraints in 81 ms returned sat
[2024-05-21 12:18:14] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 144 ms.
[2024-05-21 12:18:14] [INFO ] Added : 5 causal constraints over 2 iterations in 296 ms. Result :sat
Minimization took 557 ms.
[2024-05-21 12:18:15] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 12:18:15] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned unsat
[2024-05-21 12:18:15] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-21 12:18:15] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-21 12:18:15] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-21 12:18:15] [INFO ] [Real]Added 418 Read/Feed constraints in 75 ms returned sat
[2024-05-21 12:18:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:18:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 12:18:15] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 12:18:15] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-21 12:18:15] [INFO ] [Nat]Added 418 Read/Feed constraints in 85 ms returned sat
[2024-05-21 12:18:15] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 62 ms.
[2024-05-21 12:18:15] [INFO ] Added : 7 causal constraints over 2 iterations in 197 ms. Result :sat
Minimization took 517 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 1, 0] Max Struct:[1, 11, 1, 9]
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[11, 9]
Support contains 2 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 184 place count 230 transition count 328
Iterating global reduction 1 with 95 rules applied. Total rules applied 279 place count 230 transition count 328
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 283 place count 230 transition count 324
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 356 place count 157 transition count 251
Iterating global reduction 2 with 73 rules applied. Total rules applied 429 place count 157 transition count 251
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 435 place count 157 transition count 245
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 477 place count 115 transition count 178
Iterating global reduction 3 with 42 rules applied. Total rules applied 519 place count 115 transition count 178
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 542 place count 115 transition count 155
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 554 place count 103 transition count 136
Iterating global reduction 4 with 12 rules applied. Total rules applied 566 place count 103 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 568 place count 103 transition count 134
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 576 place count 95 transition count 126
Iterating global reduction 5 with 8 rules applied. Total rules applied 584 place count 95 transition count 126
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 587 place count 95 transition count 123
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 593 place count 89 transition count 117
Iterating global reduction 6 with 6 rules applied. Total rules applied 599 place count 89 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 600 place count 89 transition count 116
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 602 place count 87 transition count 108
Iterating global reduction 7 with 2 rules applied. Total rules applied 604 place count 87 transition count 108
Applied a total of 604 rules in 102 ms. Remains 87 /347 variables (removed 260) and now considering 108/672 (removed 564) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 87/347 places, 108/672 transitions.
// Phase 1: matrix 108 rows 87 cols
[2024-05-21 12:18:16] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[11, 9]
RANDOM walk for 1000000 steps (229449 resets) in 852 ms. (1172 steps per ms)
BEST_FIRST walk for 2000001 steps (196455 resets) in 813 ms. (2457 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[11, 9]
[2024-05-21 12:18:18] [INFO ] Invariant cache hit.
[2024-05-21 12:18:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:18:18] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-21 12:18:18] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 12:18:18] [INFO ] [Real]Added 32 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:18:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:18:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:18:18] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-21 12:18:18] [INFO ] [Nat]Added 32 Read/Feed constraints in 6 ms returned sat
[2024-05-21 12:18:18] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 76 transitions) in 7 ms.
[2024-05-21 12:18:18] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 7 ms to minimize.
[2024-05-21 12:18:18] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 2 ms to minimize.
[2024-05-21 12:18:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2024-05-21 12:18:18] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-21 12:18:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-21 12:18:18] [INFO ] Added : 14 causal constraints over 4 iterations in 251 ms. Result :sat
Minimization took 59 ms.
[2024-05-21 12:18:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 12:18:18] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-21 12:18:18] [INFO ] [Real]Added 32 Read/Feed constraints in 7 ms returned sat
[2024-05-21 12:18:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:18:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:18:18] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-21 12:18:18] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-21 12:18:18] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 76 transitions) in 7 ms.
[2024-05-21 12:18:18] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-21 12:18:18] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-21 12:18:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 106 ms
[2024-05-21 12:18:19] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 12:18:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-21 12:18:19] [INFO ] Added : 14 causal constraints over 5 iterations in 238 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[11, 9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[11, 9]
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 87/87 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-21 12:18:19] [INFO ] Invariant cache hit.
[2024-05-21 12:18:19] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-21 12:18:19] [INFO ] Invariant cache hit.
[2024-05-21 12:18:19] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 12:18:19] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-21 12:18:19] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-21 12:18:19] [INFO ] Invariant cache hit.
[2024-05-21 12:18:19] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/195 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 121 constraints, problems are : Problem set: 0 solved, 107 unsolved in 2202 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/195 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 107/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 228 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6135 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 8570ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 8588ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8814 ms. Remains : 87/87 places, 108/108 transitions.
RANDOM walk for 40000 steps (9197 resets) in 679 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (4011 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3976 resets) in 272 ms. (146 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3977 resets) in 273 ms. (145 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3935 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 985600 steps, run timeout after 3001 ms. (steps per millisecond=328 ) properties seen :2 out of 4
Probabilistic random walk after 985600 steps, saw 390140 distinct states, run finished after 3004 ms. (steps per millisecond=328 ) properties seen :2
[2024-05-21 12:18:31] [INFO ] Invariant cache hit.
[2024-05-21 12:18:31] [INFO ] State equation strengthened by 32 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) 55/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/64 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 84/148 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 40/188 variables, 19/85 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 29/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/195 variables, 4/118 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 3/121 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-21 12:18:31] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
Problem MAX1 is UNSAT
After SMT solving in domain Real declared 195/195 variables, and 122 constraints, problems are : Problem set: 2 solved, 0 unsolved in 216 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 220ms 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:[0, 0] Max Struct:[11, 9]
Starting property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[11]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[11]
[2024-05-21 12:18:31] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[11]
RANDOM walk for 10000 steps (2302 resets) in 9 ms. (1000 steps per ms)
BEST_FIRST walk for 10001 steps (993 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[11]
[2024-05-21 12:18:31] [INFO ] Invariant cache hit.
[2024-05-21 12:18:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:18:31] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-21 12:18:31] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 12:18:32] [INFO ] [Real]Added 32 Read/Feed constraints in 12 ms returned sat
[2024-05-21 12:18:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:18:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 13 ms returned sat
[2024-05-21 12:18:32] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 12:18:32] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-21 12:18:32] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 76 transitions) in 6 ms.
[2024-05-21 12:18:32] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-21 12:18:32] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-21 12:18:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2024-05-21 12:18:32] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-21 12:18:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-21 12:18:32] [INFO ] Added : 14 causal constraints over 4 iterations in 257 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[11]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[11]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 86 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 85 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 85 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 84 transition count 104
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 84 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 84 transition count 103
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 83 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 83 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 82 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 82 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 82 transition count 99
Applied a total of 13 rules in 17 ms. Remains 82 /87 variables (removed 5) and now considering 99/108 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 82/87 places, 99/108 transitions.
// Phase 1: matrix 99 rows 82 cols
[2024-05-21 12:18:32] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[11]
RANDOM walk for 1000000 steps (229641 resets) in 764 ms. (1307 steps per ms)
BEST_FIRST walk for 1000001 steps (98494 resets) in 371 ms. (2688 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[11]
[2024-05-21 12:18:33] [INFO ] Invariant cache hit.
[2024-05-21 12:18:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 12:18:33] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-21 12:18:33] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 12:18:33] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-21 12:18:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:18:33] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:18:33] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-21 12:18:33] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-21 12:18:33] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 8 ms.
[2024-05-21 12:18:33] [INFO ] Added : 5 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[11]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[11]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 17 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-21 12:18:33] [INFO ] Invariant cache hit.
[2024-05-21 12:18:34] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-21 12:18:34] [INFO ] Invariant cache hit.
[2024-05-21 12:18:34] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-21 12:18:34] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
[2024-05-21 12:18:34] [INFO ] Redundant transitions in 2 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-21 12:18:34] [INFO ] Invariant cache hit.
[2024-05-21 12:18:34] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 0/181 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 181/181 variables, and 113 constraints, problems are : Problem set: 0 solved, 98 unsolved in 2024 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 1/82 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (OVERLAPS) 99/181 variables, 82/84 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 29/113 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 98/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (OVERLAPS) 0/181 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 181/181 variables, and 211 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3462 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 82/82 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints]
After SMT, in 5679ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 5681ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6350 ms. Remains : 82/82 places, 99/99 transitions.
RANDOM walk for 40000 steps (9238 resets) in 167 ms. (238 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3955 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3862 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3188469 steps, run timeout after 3001 ms. (steps per millisecond=1062 ) properties seen :1 out of 2
Probabilistic random walk after 3188469 steps, saw 1288141 distinct states, run finished after 3001 ms. (steps per millisecond=1062 ) properties seen :1
[2024-05-21 12:18:43] [INFO ] Invariant cache hit.
[2024-05-21 12:18:43] [INFO ] State equation strengthened by 29 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) 51/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/59 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 75/134 variables, 59/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/134 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 172/181 variables, and 79 constraints, problems are : Problem set: 1 solved, 0 unsolved in 66 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 77/82 constraints, ReadFeed: 0/29 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 85ms 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:[11]
Ending property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-07 in 11567 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[9]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[9]
// Phase 1: matrix 108 rows 87 cols
[2024-05-21 12:18:43] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[9]
RANDOM walk for 10000 steps (2298 resets) in 10 ms. (909 steps per ms)
BEST_FIRST walk for 10000 steps (996 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[9]
[2024-05-21 12:18:43] [INFO ] Invariant cache hit.
[2024-05-21 12:18:43] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 12:18:43] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-21 12:18:43] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 12:18:43] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-21 12:18:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:18:43] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:18:43] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 12:18:43] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-21 12:18:43] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 76 transitions) in 6 ms.
[2024-05-21 12:18:43] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-21 12:18:43] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-21 12:18:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2024-05-21 12:18:43] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 3 ms to minimize.
[2024-05-21 12:18:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-21 12:18:43] [INFO ] Added : 14 causal constraints over 5 iterations in 273 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[9]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 87/87 places, 108/108 transitions.
[2024-05-21 12:18:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[9]
RANDOM walk for 1000000 steps (229525 resets) in 828 ms. (1206 steps per ms)
BEST_FIRST walk for 1000000 steps (98293 resets) in 403 ms. (2475 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[9]
[2024-05-21 12:18:45] [INFO ] Invariant cache hit.
[2024-05-21 12:18:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:18:45] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-21 12:18:45] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 12:18:45] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-21 12:18:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 12:18:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 12:18:45] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-21 12:18:45] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-21 12:18:45] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 76 transitions) in 6 ms.
[2024-05-21 12:18:45] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 12:18:45] [INFO ] Deduced a trap composed of 16 places in 211 ms of which 1 ms to minimize.
[2024-05-21 12:18:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 290 ms
[2024-05-21 12:18:45] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 2 ms to minimize.
[2024-05-21 12:18:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2024-05-21 12:18:45] [INFO ] Added : 14 causal constraints over 5 iterations in 492 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[9]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[9]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 87/87 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-21 12:18:46] [INFO ] Invariant cache hit.
[2024-05-21 12:18:46] [INFO ] Implicit Places using invariants in 746 ms returned []
[2024-05-21 12:18:46] [INFO ] Invariant cache hit.
[2024-05-21 12:18:46] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 12:18:47] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 1208 ms to find 0 implicit places.
[2024-05-21 12:18:47] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-21 12:18:47] [INFO ] Invariant cache hit.
[2024-05-21 12:18:47] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/195 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 0/195 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 121 constraints, problems are : Problem set: 0 solved, 107 unsolved in 1944 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 108/195 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 107/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 0/195 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 228 constraints, problems are : Problem set: 0 solved, 107 unsolved in 4228 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 0/0 constraints]
After SMT, in 6343ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 6345ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7574 ms. Remains : 87/87 places, 108/108 transitions.
RANDOM walk for 40000 steps (9166 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3985 resets) in 31 ms. (1250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3915 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 3159810 steps, run timeout after 3001 ms. (steps per millisecond=1052 ) properties seen :1 out of 2
Probabilistic random walk after 3159810 steps, saw 1250265 distinct states, run finished after 3003 ms. (steps per millisecond=1052 ) properties seen :1
[2024-05-21 12:18:56] [INFO ] Invariant cache hit.
[2024-05-21 12:18:56] [INFO ] State equation strengthened by 32 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) 85/88 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 54/142 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 7/149 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/149 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 46/195 variables, 40/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 25/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 12:18:56] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
After SMT solving in domain Real declared 195/195 variables, and 122 constraints, problems are : Problem set: 1 solved, 0 unsolved in 161 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 166ms 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:[9]
Ending property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-12 in 13366 ms.
[2024-05-21 12:18:57] [INFO ] Flatten gal took : 72 ms
[2024-05-21 12:18:57] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-21 12:18:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 87 places, 108 transitions and 426 arcs took 23 ms.
Total runtime 44895 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d1m09

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: 87
TRANSITIONS: 108
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, 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: 719
MODEL NAME: /home/mcc/execution/413/model
87 places, 108 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-d1m09-UpperBounds-07 3 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-12 6 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716293950654

--------------------
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-d1m09"
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-d1m09, 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-171624187900533"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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