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.r109-tall-171624208400351.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 gold2023
Input is DBSingleClientW-PT-d2m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208400351
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 12:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 12 12:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 12:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 12:42 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 1.6M 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-d2m06-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716328221999

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m06
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-21 21:50:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 21:50:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:50:23] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2024-05-21 21:50:23] [INFO ] Transformed 4763 places.
[2024-05-21 21:50:23] [INFO ] Transformed 2478 transitions.
[2024-05-21 21:50:23] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 3580 places in 18 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-21 21:50:23] [INFO ] Computed 6 invariants in 164 ms
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 879 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 961 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 972 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 4) seen :0
[2024-05-21 21:50:24] [INFO ] Invariant cache hit.
[2024-05-21 21:50:24] [INFO ] [Real]Absence check using 2 positive place invariants in 20 ms returned sat
[2024-05-21 21:50:24] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2024-05-21 21:50:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:25] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2024-05-21 21:50:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:50:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 21:50:25] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2024-05-21 21:50:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:26] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2024-05-21 21:50:26] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-21 21:50:27] [INFO ] [Nat]Added 1588 Read/Feed constraints in 694 ms returned sat
[2024-05-21 21:50:27] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 634 ms.
[2024-05-21 21:50:28] [INFO ] Added : 2 causal constraints over 1 iterations in 918 ms. Result :sat
Minimization took 371 ms.
[2024-05-21 21:50:28] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 21:50:28] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 21:50:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:29] [INFO ] [Real]Absence check using state equation in 586 ms returned sat
[2024-05-21 21:50:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:50:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 21:50:29] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2024-05-21 21:50:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:30] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2024-05-21 21:50:30] [INFO ] [Nat]Added 1588 Read/Feed constraints in 721 ms returned sat
[2024-05-21 21:50:31] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 389 ms.
[2024-05-21 21:50:31] [INFO ] Added : 6 causal constraints over 2 iterations in 755 ms. Result :sat
Minimization took 1810 ms.
[2024-05-21 21:50:33] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 21:50:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 21:50:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:34] [INFO ] [Real]Absence check using state equation in 588 ms returned sat
[2024-05-21 21:50:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:50:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 21:50:34] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 21:50:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:34] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2024-05-21 21:50:35] [INFO ] [Nat]Added 1588 Read/Feed constraints in 872 ms returned sat
[2024-05-21 21:50:36] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 378 ms.
[2024-05-21 21:50:36] [INFO ] Added : 10 causal constraints over 3 iterations in 867 ms. Result :sat
Minimization took 1013 ms.
[2024-05-21 21:50:37] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 21:50:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 21:50:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:38] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2024-05-21 21:50:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:50:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 21:50:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 21:50:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:39] [INFO ] [Nat]Absence check using state equation in 640 ms returned sat
[2024-05-21 21:50:40] [INFO ] [Nat]Added 1588 Read/Feed constraints in 958 ms returned sat
[2024-05-21 21:50:41] [INFO ] Deduced a trap composed of 41 places in 643 ms of which 5 ms to minimize.
[2024-05-21 21:50:41] [INFO ] Deduced a trap composed of 419 places in 545 ms of which 2 ms to minimize.
[2024-05-21 21:50:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1422 ms
[2024-05-21 21:50:42] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 373 ms.
[2024-05-21 21:50:42] [INFO ] Added : 13 causal constraints over 3 iterations in 1044 ms. Result :sat
Minimization took 805 ms.
Current structural bounds on expressions (after SMT) : [6, 6, 7, 6] Max seen :[0, 0, 0, 0]
Support contains 4 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.6 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 389 places :
Symmetric choice reduction at 1 with 389 rule applications. Total rules 607 place count 747 transition count 1202
Iterating global reduction 1 with 389 rules applied. Total rules applied 996 place count 747 transition count 1202
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1005 place count 747 transition count 1193
Discarding 312 places :
Symmetric choice reduction at 2 with 312 rule applications. Total rules 1317 place count 435 transition count 881
Iterating global reduction 2 with 312 rules applied. Total rules applied 1629 place count 435 transition count 881
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1641 place count 435 transition count 869
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 1880 place count 196 transition count 535
Iterating global reduction 3 with 239 rules applied. Total rules applied 2119 place count 196 transition count 535
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Iterating post reduction 3 with 210 rules applied. Total rules applied 2329 place count 196 transition count 325
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 2352 place count 173 transition count 287
Iterating global reduction 4 with 23 rules applied. Total rules applied 2375 place count 173 transition count 287
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2381 place count 173 transition count 281
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 2396 place count 158 transition count 266
Iterating global reduction 5 with 15 rules applied. Total rules applied 2411 place count 158 transition count 266
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2414 place count 158 transition count 263
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2427 place count 145 transition count 250
Iterating global reduction 6 with 13 rules applied. Total rules applied 2440 place count 145 transition count 250
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2450 place count 145 transition count 240
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2455 place count 140 transition count 216
Iterating global reduction 7 with 5 rules applied. Total rules applied 2460 place count 140 transition count 216
Applied a total of 2460 rules in 228 ms. Remains 140 /1183 variables (removed 1043) and now considering 216/2478 (removed 2262) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 140/1183 places, 216/2478 transitions.
// Phase 1: matrix 216 rows 140 cols
[2024-05-21 21:50:44] [INFO ] Computed 2 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 229967 resets, run finished after 1539 ms. (steps per millisecond=649 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95390 resets, run finished after 695 ms. (steps per millisecond=1438 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95494 resets, run finished after 666 ms. (steps per millisecond=1501 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 95345 resets, run finished after 701 ms. (steps per millisecond=1426 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000000 steps, including 94728 resets, run finished after 669 ms. (steps per millisecond=1494 ) properties (out of 4) seen :1
[2024-05-21 21:50:48] [INFO ] Invariant cache hit.
[2024-05-21 21:50:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:50:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:48] [INFO ] [Real]Absence check using state equation in 26 ms returned unsat
[2024-05-21 21:50:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:50:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:48] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-21 21:50:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:50:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:50:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:48] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-21 21:50:48] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-21 21:50:48] [INFO ] [Nat]Added 79 Read/Feed constraints in 16 ms returned sat
[2024-05-21 21:50:48] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 160 transitions) in 13 ms.
[2024-05-21 21:50:48] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-21 21:50:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-21 21:50:48] [INFO ] Added : 15 causal constraints over 3 iterations in 186 ms. Result :sat
Minimization took 104 ms.
[2024-05-21 21:50:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:50:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:48] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-21 21:50:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:50:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:50:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:48] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 21:50:48] [INFO ] [Nat]Added 79 Read/Feed constraints in 21 ms returned sat
[2024-05-21 21:50:48] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 160 transitions) in 15 ms.
[2024-05-21 21:50:49] [INFO ] Added : 11 causal constraints over 3 iterations in 77 ms. Result :sat
Minimization took 54 ms.
[2024-05-21 21:50:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:50:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:49] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-21 21:50:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:50:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:50:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:49] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 21:50:49] [INFO ] [Nat]Added 79 Read/Feed constraints in 16 ms returned sat
[2024-05-21 21:50:49] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 160 transitions) in 15 ms.
[2024-05-21 21:50:49] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:50:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-05-21 21:50:49] [INFO ] Added : 26 causal constraints over 6 iterations in 233 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [1, 6, 7, 6] Max seen :[1, 0, 0, 0]
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 140/140 places, 216/216 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 139 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 139 transition count 215
Applied a total of 2 rules in 22 ms. Remains 139 /140 variables (removed 1) and now considering 215/216 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 139/140 places, 215/216 transitions.
// Phase 1: matrix 215 rows 139 cols
[2024-05-21 21:50:49] [INFO ] Computed 2 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 229945 resets, run finished after 1477 ms. (steps per millisecond=677 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95061 resets, run finished after 667 ms. (steps per millisecond=1499 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95050 resets, run finished after 671 ms. (steps per millisecond=1490 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95153 resets, run finished after 662 ms. (steps per millisecond=1510 ) properties (out of 3) seen :0
[2024-05-21 21:50:53] [INFO ] Invariant cache hit.
[2024-05-21 21:50:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:50:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:53] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-21 21:50:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:50:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:50:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:53] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-21 21:50:53] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-21 21:50:53] [INFO ] [Nat]Added 79 Read/Feed constraints in 18 ms returned sat
[2024-05-21 21:50:53] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 160 transitions) in 16 ms.
[2024-05-21 21:50:53] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:50:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-21 21:50:53] [INFO ] Added : 15 causal constraints over 4 iterations in 184 ms. Result :sat
Minimization took 87 ms.
[2024-05-21 21:50:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:50:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:53] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 21:50:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:50:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:50:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:53] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 21:50:53] [INFO ] [Nat]Added 79 Read/Feed constraints in 20 ms returned sat
[2024-05-21 21:50:53] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 160 transitions) in 13 ms.
[2024-05-21 21:50:53] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2024-05-21 21:50:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-05-21 21:50:53] [INFO ] Added : 19 causal constraints over 4 iterations in 170 ms. Result :sat
Minimization took 42 ms.
[2024-05-21 21:50:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:54] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 21:50:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:50:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:54] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-21 21:50:54] [INFO ] [Nat]Added 79 Read/Feed constraints in 20 ms returned sat
[2024-05-21 21:50:54] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 160 transitions) in 13 ms.
[2024-05-21 21:50:54] [INFO ] Added : 13 causal constraints over 4 iterations in 92 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [6, 7, 6] Max seen :[0, 0, 0]
Support contains 3 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 215/215 transitions.
Applied a total of 0 rules in 20 ms. Remains 139 /139 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 139/139 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 215/215 transitions.
Applied a total of 0 rules in 6 ms. Remains 139 /139 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-21 21:50:54] [INFO ] Invariant cache hit.
[2024-05-21 21:50:54] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 21:50:54] [INFO ] Invariant cache hit.
[2024-05-21 21:50:54] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-21 21:50:54] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2024-05-21 21:50:54] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-21 21:50:54] [INFO ] Invariant cache hit.
[2024-05-21 21:50:55] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 507 ms. Remains : 139/139 places, 215/215 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-04
[2024-05-21 21:50:55] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2275 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1003 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2024-05-21 21:50:55] [INFO ] Invariant cache hit.
[2024-05-21 21:50:55] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:50:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:55] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 21:50:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:50:55] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:50:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:55] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 21:50:55] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-21 21:50:55] [INFO ] [Nat]Added 79 Read/Feed constraints in 15 ms returned sat
[2024-05-21 21:50:55] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 160 transitions) in 13 ms.
[2024-05-21 21:50:55] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-21 21:50:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-21 21:50:55] [INFO ] Added : 15 causal constraints over 4 iterations in 174 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 215/215 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 137 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 137 transition count 213
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 135 transition count 211
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 135 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 135 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 134 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 134 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 133 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 133 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 132 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 132 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 131 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 131 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 131 transition count 198
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 128 transition count 178
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 128 transition count 178
Applied a total of 28 rules in 30 ms. Remains 128 /139 variables (removed 11) and now considering 178/215 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 128/139 places, 178/215 transitions.
// Phase 1: matrix 178 rows 128 cols
[2024-05-21 21:50:55] [INFO ] Computed 2 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229980 resets, run finished after 1210 ms. (steps per millisecond=826 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95638 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties (out of 1) seen :0
[2024-05-21 21:50:57] [INFO ] Invariant cache hit.
[2024-05-21 21:50:57] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:50:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:57] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-21 21:50:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:50:57] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:50:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:57] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-21 21:50:57] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 21:50:57] [INFO ] [Nat]Added 51 Read/Feed constraints in 8 ms returned sat
[2024-05-21 21:50:57] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 126 transitions) in 10 ms.
[2024-05-21 21:50:57] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-05-21 21:50:57] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-21 21:50:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 149 ms
[2024-05-21 21:50:57] [INFO ] Added : 21 causal constraints over 5 iterations in 264 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 128/128 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 21:50:57] [INFO ] Invariant cache hit.
[2024-05-21 21:50:57] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 21:50:57] [INFO ] Invariant cache hit.
[2024-05-21 21:50:58] [INFO ] State equation strengthened by 51 read => feed constraints.
[2024-05-21 21:50:58] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-21 21:50:58] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-21 21:50:58] [INFO ] Invariant cache hit.
[2024-05-21 21:50:58] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 394 ms. Remains : 128/128 places, 178/178 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-04 in 3240 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-07
// Phase 1: matrix 215 rows 139 cols
[2024-05-21 21:50:58] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2326 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1004 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2024-05-21 21:50:58] [INFO ] Invariant cache hit.
[2024-05-21 21:50:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:50:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:58] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-21 21:50:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:50:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:50:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:50:58] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 21:50:58] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-21 21:50:58] [INFO ] [Nat]Added 79 Read/Feed constraints in 20 ms returned sat
[2024-05-21 21:50:58] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 160 transitions) in 13 ms.
[2024-05-21 21:50:58] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2024-05-21 21:50:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-21 21:50:58] [INFO ] Added : 19 causal constraints over 4 iterations in 178 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 215/215 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 137 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 137 transition count 213
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 135 transition count 211
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 135 transition count 211
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 133 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 133 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 131 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 131 transition count 200
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 129 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 129 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 129 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 128 transition count 196
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 128 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 128 transition count 193
Applied a total of 26 rules in 34 ms. Remains 128 /139 variables (removed 11) and now considering 193/215 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 128/139 places, 193/215 transitions.
// Phase 1: matrix 193 rows 128 cols
[2024-05-21 21:50:58] [INFO ] Computed 2 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 229955 resets, run finished after 1342 ms. (steps per millisecond=745 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95926 resets, run finished after 599 ms. (steps per millisecond=1669 ) properties (out of 1) seen :0
[2024-05-21 21:51:00] [INFO ] Invariant cache hit.
[2024-05-21 21:51:00] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:51:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:51:00] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 21:51:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:51:00] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:51:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:51:00] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-21 21:51:00] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-21 21:51:00] [INFO ] [Nat]Added 72 Read/Feed constraints in 16 ms returned sat
[2024-05-21 21:51:00] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 142 transitions) in 11 ms.
[2024-05-21 21:51:01] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-21 21:51:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-21 21:51:01] [INFO ] Added : 22 causal constraints over 6 iterations in 197 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 193/193 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 128/128 places, 193/193 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 193/193 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2024-05-21 21:51:01] [INFO ] Invariant cache hit.
[2024-05-21 21:51:01] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-21 21:51:01] [INFO ] Invariant cache hit.
[2024-05-21 21:51:01] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-21 21:51:01] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-05-21 21:51:01] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-21 21:51:01] [INFO ] Invariant cache hit.
[2024-05-21 21:51:01] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 421 ms. Remains : 128/128 places, 193/193 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-07 in 3348 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-14
// Phase 1: matrix 215 rows 139 cols
[2024-05-21 21:51:01] [INFO ] Computed 2 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 951 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2024-05-21 21:51:01] [INFO ] Invariant cache hit.
[2024-05-21 21:51:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:51:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:51:01] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-21 21:51:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:51:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:51:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:51:01] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-21 21:51:01] [INFO ] State equation strengthened by 79 read => feed constraints.
[2024-05-21 21:51:01] [INFO ] [Nat]Added 79 Read/Feed constraints in 20 ms returned sat
[2024-05-21 21:51:01] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 160 transitions) in 14 ms.
[2024-05-21 21:51:01] [INFO ] Added : 13 causal constraints over 4 iterations in 79 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 215/215 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 137 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 137 transition count 213
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 135 transition count 211
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 135 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 11 place count 135 transition count 208
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 134 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 134 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 133 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 133 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 132 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 132 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 132 transition count 200
Applied a total of 18 rules in 26 ms. Remains 132 /139 variables (removed 7) and now considering 200/215 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 132/139 places, 200/215 transitions.
// Phase 1: matrix 200 rows 132 cols
[2024-05-21 21:51:02] [INFO ] Computed 2 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 230128 resets, run finished after 1387 ms. (steps per millisecond=720 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95575 resets, run finished after 618 ms. (steps per millisecond=1618 ) properties (out of 1) seen :0
[2024-05-21 21:51:04] [INFO ] Invariant cache hit.
[2024-05-21 21:51:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:51:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:51:04] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-21 21:51:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:51:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:51:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:51:04] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 21:51:04] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 21:51:04] [INFO ] [Nat]Added 74 Read/Feed constraints in 25 ms returned sat
[2024-05-21 21:51:04] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 148 transitions) in 12 ms.
[2024-05-21 21:51:04] [INFO ] Added : 15 causal constraints over 4 iterations in 71 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 132/132 places, 200/200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2024-05-21 21:51:04] [INFO ] Invariant cache hit.
[2024-05-21 21:51:04] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 21:51:04] [INFO ] Invariant cache hit.
[2024-05-21 21:51:04] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 21:51:04] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2024-05-21 21:51:04] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:51:04] [INFO ] Invariant cache hit.
[2024-05-21 21:51:04] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 459 ms. Remains : 132/132 places, 200/200 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-14 in 3207 ms.
[2024-05-21 21:51:05] [INFO ] Flatten gal took : 43 ms
[2024-05-21 21:51:05] [INFO ] Applying decomposition
[2024-05-21 21:51:05] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11414432818311703951.txt' '-o' '/tmp/graph11414432818311703951.bin' '-w' '/tmp/graph11414432818311703951.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11414432818311703951.bin' '-l' '-1' '-v' '-w' '/tmp/graph11414432818311703951.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:51:05] [INFO ] Decomposing Gal with order
[2024-05-21 21:51:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:51:05] [INFO ] Removed a total of 240 redundant transitions.
[2024-05-21 21:51:05] [INFO ] Flatten gal took : 53 ms
[2024-05-21 21:51:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 176 labels/synchronizations in 11 ms.
[2024-05-21 21:51:05] [INFO ] Time to serialize gal into /tmp/UpperBounds11182906081631263481.gal : 7 ms
[2024-05-21 21:51:05] [INFO ] Time to serialize properties into /tmp/UpperBounds2642944167287692419.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11182906081631263481.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds2642944167287692419.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds2642944167287692419.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.498e+06,14.0213,410848,5025,3864,404544,162493,527,2.36776e+06,188,1.42902e+06,0
Total reachable state count : 3498000

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property DBSingleClientW-PT-d2m06-UpperBounds-04 :0 <= i6.u4.l4143 <= 3
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-04 3 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m06-UpperBounds-04,0,14.4208,410848,1,0,404544,162493,664,2.36776e+06,215,1.42902e+06,3963
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m06-UpperBounds-07 :0 <= i2.u9.p49 <= 1
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m06-UpperBounds-07,0,14.4828,410848,1,0,404544,162493,694,2.36776e+06,235,1.42902e+06,4250
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m06-UpperBounds-14 :0 <= i3.u11.l2315 <= 1
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m06-UpperBounds-14,0,14.4831,410848,1,0,404544,162493,710,2.36776e+06,240,1.42902e+06,4277
Total runtime 56464 ms.

BK_STOP 1716328280674

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d2m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is DBSingleClientW-PT-d2m06, 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 r109-tall-171624208400351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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