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.r480-tall-171624189500533.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 ltsminxred
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 r480-tall-171624189500533
=====================================================================

--------------------
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 1717189845874

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:10:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:10:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:10:47] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-05-31 21:10:47] [INFO ] Transformed 1440 places.
[2024-05-31 21:10:47] [INFO ] Transformed 672 transitions.
[2024-05-31 21:10:47] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 1093 places in 5 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-31 21:10:47] [INFO ] Computed 6 invariants in 46 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 (2270 resets) in 150 ms. (66 steps per ms)
BEST_FIRST walk for 40002 steps (3903 resets) in 176 ms. (226 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 0, 0, 0] Max Struct:[7, 11, 7, 9]
[2024-05-31 21:10:48] [INFO ] Invariant cache hit.
[2024-05-31 21:10:48] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2024-05-31 21:10:48] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned unsat
[2024-05-31 21:10:48] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:10:48] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:10:48] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2024-05-31 21:10:48] [INFO ] State equation strengthened by 418 read => feed constraints.
[2024-05-31 21:10:48] [INFO ] [Real]Added 418 Read/Feed constraints in 142 ms returned sat
[2024-05-31 21:10:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:10:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:10:48] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2024-05-31 21:10:49] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2024-05-31 21:10:49] [INFO ] [Nat]Added 418 Read/Feed constraints in 84 ms returned sat
[2024-05-31 21:10:49] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 130 ms.
[2024-05-31 21:10:49] [INFO ] Added : 5 causal constraints over 2 iterations in 298 ms. Result :sat
Minimization took 518 ms.
[2024-05-31 21:10:50] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:10:50] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-31 21:10:50] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2024-05-31 21:10:50] [INFO ] [Real]Added 418 Read/Feed constraints in 84 ms returned sat
[2024-05-31 21:10:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:10:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-05-31 21:10:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:10:50] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-31 21:10:50] [INFO ] [Nat]Added 418 Read/Feed constraints in 61 ms returned sat
[2024-05-31 21:10:50] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 72 ms.
[2024-05-31 21:10:51] [INFO ] Added : 2 causal constraints over 1 iterations in 162 ms. Result :sat
Minimization took 560 ms.
[2024-05-31 21:10:51] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:10:51] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:10:51] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-05-31 21:10:51] [INFO ] [Real]Added 418 Read/Feed constraints in 91 ms returned sat
[2024-05-31 21:10:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:10:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:10:52] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:10:52] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2024-05-31 21:10:52] [INFO ] [Nat]Added 418 Read/Feed constraints in 78 ms returned sat
[2024-05-31 21:10:52] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 73 ms.
[2024-05-31 21:10:52] [INFO ] Added : 7 causal constraints over 2 iterations in 214 ms. Result :sat
Minimization took 521 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 0, 0, 0] Max Struct:[1, 11, 7, 9]
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, 0] Max Struct:[11, 7, 9]
Support contains 3 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 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 355 place count 158 transition count 252
Iterating global reduction 2 with 72 rules applied. Total rules applied 427 place count 158 transition count 252
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 433 place count 158 transition count 246
Discarding 41 places :
Symmetric choice reduction at 3 with 41 rule applications. Total rules 474 place count 117 transition count 183
Iterating global reduction 3 with 41 rules applied. Total rules applied 515 place count 117 transition count 183
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 538 place count 117 transition count 160
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 549 place count 106 transition count 142
Iterating global reduction 4 with 11 rules applied. Total rules applied 560 place count 106 transition count 142
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 562 place count 106 transition count 140
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 569 place count 99 transition count 133
Iterating global reduction 5 with 7 rules applied. Total rules applied 576 place count 99 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 577 place count 99 transition count 132
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 583 place count 93 transition count 126
Iterating global reduction 6 with 6 rules applied. Total rules applied 589 place count 93 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 590 place count 93 transition count 125
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 592 place count 91 transition count 117
Iterating global reduction 7 with 2 rules applied. Total rules applied 594 place count 91 transition count 117
Applied a total of 594 rules in 103 ms. Remains 91 /347 variables (removed 256) and now considering 117/672 (removed 555) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 91/347 places, 117/672 transitions.
// Phase 1: matrix 117 rows 91 cols
[2024-05-31 21:10:53] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[11, 7, 9]
RANDOM walk for 1000000 steps (229166 resets) in 2100 ms. (475 steps per ms)
BEST_FIRST walk for 3000002 steps (293899 resets) in 2820 ms. (1063 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0] Max Struct:[11, 7, 9]
[2024-05-31 21:10:58] [INFO ] Invariant cache hit.
[2024-05-31 21:10:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:10:58] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-31 21:10:58] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-05-31 21:10:58] [INFO ] [Real]Added 33 Read/Feed constraints in 12 ms returned sat
[2024-05-31 21:10:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:10:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:10:58] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-31 21:10:58] [INFO ] [Nat]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:10:58] [INFO ] Computed and/alt/rep : 33/81/33 causal constraints (skipped 83 transitions) in 12 ms.
[2024-05-31 21:10:58] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 12 ms to minimize.
[2024-05-31 21:10:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2024-05-31 21:10:58] [INFO ] Added : 6 causal constraints over 4 iterations in 144 ms. Result :sat
Minimization took 59 ms.
[2024-05-31 21:10:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:10:58] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
[2024-05-31 21:10:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:10:58] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 21:10:58] [INFO ] [Real]Added 33 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:10:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:10:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:10:58] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-31 21:10:58] [INFO ] [Nat]Added 33 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:10:58] [INFO ] Computed and/alt/rep : 33/81/33 causal constraints (skipped 83 transitions) in 7 ms.
[2024-05-31 21:10:58] [INFO ] Added : 16 causal constraints over 4 iterations in 63 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0] Max Struct:[11, 1, 9]
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-08 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 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 117/117 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 90 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 89 transition count 112
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 88 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 88 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 87 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 87 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 87 transition count 108
Applied a total of 10 rules in 17 ms. Remains 87 /91 variables (removed 4) and now considering 108/117 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 87/91 places, 108/117 transitions.
// Phase 1: matrix 108 rows 87 cols
[2024-05-31 21:10:58] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[11, 9]
RANDOM walk for 1000000 steps (229468 resets) in 1894 ms. (527 steps per ms)
BEST_FIRST walk for 2000001 steps (197285 resets) in 1752 ms. (1140 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[11, 9]
[2024-05-31 21:11:02] [INFO ] Invariant cache hit.
[2024-05-31 21:11:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-31 21:11:02] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 21:11:02] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 21:11:02] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:11:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:11:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:11:02] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-31 21:11:02] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:11:02] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 76 transitions) in 6 ms.
[2024-05-31 21:11:02] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
[2024-05-31 21:11:02] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:11:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2024-05-31 21:11:02] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:11:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-31 21:11:02] [INFO ] Added : 14 causal constraints over 4 iterations in 227 ms. Result :sat
Minimization took 72 ms.
[2024-05-31 21:11:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:11:03] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-31 21:11:03] [INFO ] [Real]Added 32 Read/Feed constraints in 3 ms returned sat
[2024-05-31 21:11:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:11:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:11:03] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-31 21:11:03] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:11:03] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 76 transitions) in 5 ms.
[2024-05-31 21:11:03] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-05-31 21:11:03] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:11:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2024-05-31 21:11:03] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:11:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-31 21:11:03] [INFO ] Added : 14 causal constraints over 5 iterations in 237 ms. Result :sat
Minimization took 70 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 5 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 6 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-31 21:11:03] [INFO ] Invariant cache hit.
[2024-05-31 21:11:03] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 21:11:03] [INFO ] Invariant cache hit.
[2024-05-31 21:11:03] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 21:11:03] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-31 21:11:03] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-31 21:11:03] [INFO ] Invariant cache hit.
[2024-05-31 21:11:03] [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 2231 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 4538 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 7020ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 7044ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7266 ms. Remains : 87/87 places, 108/108 transitions.
RANDOM walk for 40000 steps (9166 resets) in 1401 ms. (28 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (3938 resets) in 367 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (4029 resets) in 162 ms. (245 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3909 resets) in 114 ms. (347 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (3877 resets) in 102 ms. (388 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 880623 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :2 out of 4
Probabilistic random walk after 880623 steps, saw 353135 distinct states, run finished after 3009 ms. (steps per millisecond=292 ) properties seen :2
[2024-05-31 21:11:14] [INFO ] Invariant cache hit.
[2024-05-31 21:11:14] [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-31 21:11:14] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 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 176 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 182ms 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-31 21:11:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[11]
RANDOM walk for 10000 steps (2304 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10000 steps (943 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[11]
[2024-05-31 21:11:14] [INFO ] Invariant cache hit.
[2024-05-31 21:11:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:11:14] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 21:11:14] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 21:11:14] [INFO ] [Real]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:11:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:11:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:11:14] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 21:11:14] [INFO ] [Nat]Added 32 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:11:14] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 76 transitions) in 7 ms.
[2024-05-31 21:11:14] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:11:15] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-05-31 21:11:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2024-05-31 21:11:15] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:11:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-31 21:11:15] [INFO ] Added : 14 causal constraints over 4 iterations in 239 ms. Result :sat
Minimization took 55 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 14 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 14 ms. Remains : 82/87 places, 99/108 transitions.
// Phase 1: matrix 99 rows 82 cols
[2024-05-31 21:11:15] [INFO ] Computed 2 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[11]
RANDOM walk for 1000000 steps (229766 resets) in 1814 ms. (550 steps per ms)
BEST_FIRST walk for 1000000 steps (99300 resets) in 853 ms. (1170 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[11]
[2024-05-31 21:11:17] [INFO ] Invariant cache hit.
[2024-05-31 21:11:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:11:17] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 21:11:17] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-31 21:11:17] [INFO ] [Real]Added 29 Read/Feed constraints in 3 ms returned sat
[2024-05-31 21:11:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:11:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:11:18] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-31 21:11:18] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:11:18] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 7 ms.
[2024-05-31 21:11:18] [INFO ] Added : 5 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 52 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 12 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 12 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 4 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-31 21:11:18] [INFO ] Invariant cache hit.
[2024-05-31 21:11:18] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 21:11:18] [INFO ] Invariant cache hit.
[2024-05-31 21:11:18] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-31 21:11:18] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-31 21:11:18] [INFO ] Redundant transitions in 1 ms returned []
Running 98 sub problems to find dead transitions.
[2024-05-31 21:11:18] [INFO ] Invariant cache hit.
[2024-05-31 21:11:18] [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 1682 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 3183 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 4954ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 4956ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5151 ms. Remains : 82/82 places, 99/99 transitions.
RANDOM walk for 40000 steps (9211 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3963 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3911 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 2304281 steps, run timeout after 3001 ms. (steps per millisecond=767 ) properties seen :1 out of 2
Probabilistic random walk after 2304281 steps, saw 923067 distinct states, run finished after 3003 ms. (steps per millisecond=767 ) properties seen :1
[2024-05-31 21:11:26] [INFO ] Invariant cache hit.
[2024-05-31 21:11:26] [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 67 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 79ms 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 11766 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-31 21:11:26] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[9]
RANDOM walk for 10000 steps (2298 resets) in 20 ms. (476 steps per ms)
BEST_FIRST walk for 10001 steps (994 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[9]
[2024-05-31 21:11:26] [INFO ] Invariant cache hit.
[2024-05-31 21:11:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:11:26] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-31 21:11:26] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 21:11:26] [INFO ] [Real]Added 32 Read/Feed constraints in 11 ms returned sat
[2024-05-31 21:11:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:11:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:11:26] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2024-05-31 21:11:26] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:11:26] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 76 transitions) in 7 ms.
[2024-05-31 21:11:26] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-31 21:11:26] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:11:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2024-05-31 21:11:26] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:11:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-31 21:11:26] [INFO ] Added : 14 causal constraints over 5 iterations in 235 ms. Result :sat
Minimization took 68 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 14 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 14 ms. Remains : 87/87 places, 108/108 transitions.
[2024-05-31 21:11:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[9]
RANDOM walk for 1000000 steps (229991 resets) in 1863 ms. (536 steps per ms)
BEST_FIRST walk for 1000001 steps (98170 resets) in 878 ms. (1137 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[9]
[2024-05-31 21:11:29] [INFO ] Invariant cache hit.
[2024-05-31 21:11:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:11:29] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 21:11:29] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 21:11:29] [INFO ] [Real]Added 32 Read/Feed constraints in 7 ms returned sat
[2024-05-31 21:11:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:11:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:11:29] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 21:11:29] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:11:29] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 76 transitions) in 9 ms.
[2024-05-31 21:11:30] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:11:30] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-31 21:11:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2024-05-31 21:11:30] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:11:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-31 21:11:30] [INFO ] Added : 14 causal constraints over 5 iterations in 230 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 10 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 10 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-31 21:11:30] [INFO ] Invariant cache hit.
[2024-05-31 21:11:30] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 21:11:30] [INFO ] Invariant cache hit.
[2024-05-31 21:11:30] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 21:11:30] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-31 21:11:30] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-31 21:11:30] [INFO ] Invariant cache hit.
[2024-05-31 21:11:30] [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 1844 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 4335 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 6283ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 6286ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6498 ms. Remains : 87/87 places, 108/108 transitions.
RANDOM walk for 40000 steps (9185 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3874 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3899 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1924866 steps, run timeout after 3001 ms. (steps per millisecond=641 ) properties seen :1 out of 2
Probabilistic random walk after 1924866 steps, saw 758047 distinct states, run finished after 3001 ms. (steps per millisecond=641 ) properties seen :1
[2024-05-31 21:11:39] [INFO ] Invariant cache hit.
[2024-05-31 21:11:39] [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-31 21:11:40] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 2 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 136 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 142ms 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 13584 ms.
[2024-05-31 21:11:40] [INFO ] Flatten gal took : 35 ms
[2024-05-31 21:11:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-31 21:11:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 87 places, 108 transitions and 426 arcs took 4 ms.
Total runtime 53120 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DBSingleClientW-PT-d1m09-UpperBounds-07
Could not compute solution for formula : DBSingleClientW-PT-d1m09-UpperBounds-12

BK_STOP 1717189900583

--------------------
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
mcc2024
ub formula name DBSingleClientW-PT-d1m09-UpperBounds-07
ub formula formula --maxsum=/tmp/706/ub_0_
ub formula name DBSingleClientW-PT-d1m09-UpperBounds-12
ub formula formula --maxsum=/tmp/706/ub_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ltsminxred"
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 ltsminxred"
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 r480-tall-171624189500533"
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 ;