Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.2K Jun 7 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 7 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 7 17:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 7 17:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 17K Jun 7 17:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 186K Jun 7 17:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Jun 7 17:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 17:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 1.6M Jun 6 12:11 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-d2m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654745591928

Running Version 0
[2022-06-09 03:33:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 03:33:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:33:14] [INFO ] Load time of PNML (sax parser for PT used): 223 ms
[2022-06-09 03:33:14] [INFO ] Transformed 4763 places.
[2022-06-09 03:33:14] [INFO ] Transformed 2478 transitions.
[2022-06-09 03:33:14] [INFO ] Parsed PT model containing 4763 places and 2478 transitions in 303 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 3580 places in 17 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2022-06-09 03:33:14] [INFO ] Computed 6 place invariants in 176 ms
Incomplete random walk after 10000 steps, including 2332 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 910 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 940 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 920 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
// Phase 1: matrix 2478 rows 1183 cols
[2022-06-09 03:33:15] [INFO ] Computed 6 place invariants in 142 ms
[2022-06-09 03:33:15] [INFO ] [Real]Absence check using 2 positive place invariants in 17 ms returned sat
[2022-06-09 03:33:15] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 15 ms returned sat
[2022-06-09 03:33:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:16] [INFO ] [Real]Absence check using state equation in 734 ms returned sat
[2022-06-09 03:33:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:33:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2022-06-09 03:33:16] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 22 ms returned sat
[2022-06-09 03:33:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:17] [INFO ] [Nat]Absence check using state equation in 881 ms returned sat
[2022-06-09 03:33:18] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2022-06-09 03:33:21] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:33:21] [INFO ] [Nat]Added 1588 Read/Feed constraints in 3243 ms returned unknown
[2022-06-09 03:33:21] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-06-09 03:33:21] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:22] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2022-06-09 03:33:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:33:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2022-06-09 03:33:22] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2022-06-09 03:33:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:22] [INFO ] [Nat]Absence check using state equation in 594 ms returned sat
[2022-06-09 03:33:27] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:33:27] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4299 ms returned unknown
[2022-06-09 03:33:27] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-06-09 03:33:27] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:28] [INFO ] [Real]Absence check using state equation in 750 ms returned sat
[2022-06-09 03:33:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:33:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 18 ms returned sat
[2022-06-09 03:33:28] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2022-06-09 03:33:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:29] [INFO ] [Nat]Absence check using state equation in 715 ms returned sat
[2022-06-09 03:33:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:33:33] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4167 ms returned unknown
Current structural bounds on expressions (after SMT) : [4, 4, 4] Max seen :[0, 0, 0]
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions, 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.23 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 388 places :
Symmetric choice reduction at 1 with 388 rule applications. Total rules 606 place count 748 transition count 1203
Iterating global reduction 1 with 388 rules applied. Total rules applied 994 place count 748 transition count 1203
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1003 place count 748 transition count 1194
Discarding 313 places :
Symmetric choice reduction at 2 with 313 rule applications. Total rules 1316 place count 435 transition count 881
Iterating global reduction 2 with 313 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 528
Iterating global reduction 3 with 239 rules applied. Total rules applied 2119 place count 196 transition count 528
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 318
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2354 place count 171 transition count 278
Iterating global reduction 4 with 25 rules applied. Total rules applied 2379 place count 171 transition count 278
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2385 place count 171 transition count 272
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2402 place count 154 transition count 255
Iterating global reduction 5 with 17 rules applied. Total rules applied 2419 place count 154 transition count 255
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2423 place count 154 transition count 251
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2437 place count 140 transition count 237
Iterating global reduction 6 with 14 rules applied. Total rules applied 2451 place count 140 transition count 237
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2464 place count 140 transition count 224
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 2469 place count 135 transition count 200
Iterating global reduction 7 with 5 rules applied. Total rules applied 2474 place count 135 transition count 200
Applied a total of 2474 rules in 287 ms. Remains 135 /1183 variables (removed 1048) and now considering 200/2478 (removed 2278) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/1183 places, 200/2478 transitions.
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 03:33:33] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 230063 resets, run finished after 1323 ms. (steps per millisecond=755 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96285 resets, run finished after 596 ms. (steps per millisecond=1677 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96211 resets, run finished after 558 ms. (steps per millisecond=1792 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95403 resets, run finished after 586 ms. (steps per millisecond=1706 ) properties (out of 3) seen :0
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 03:33:36] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:33:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:36] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-06-09 03:33:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:33:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:33:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:36] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-06-09 03:33:36] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-09 03:33:36] [INFO ] [Nat]Added 75 Read/Feed constraints in 50 ms returned sat
[2022-06-09 03:33:37] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 12 ms to minimize.
[2022-06-09 03:33:37] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2022-06-09 03:33:37] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
[2022-06-09 03:33:37] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 2 ms to minimize.
[2022-06-09 03:33:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 466 ms
[2022-06-09 03:33:37] [INFO ] Computed and/alt/rep : 52/121/52 causal constraints (skipped 147 transitions) in 30 ms.
[2022-06-09 03:33:37] [INFO ] Added : 46 causal constraints over 10 iterations in 245 ms. Result :sat
Minimization took 72 ms.
[2022-06-09 03:33:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:33:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:37] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-06-09 03:33:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:33:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:33:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:37] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-06-09 03:33:37] [INFO ] [Nat]Added 75 Read/Feed constraints in 25 ms returned sat
[2022-06-09 03:33:37] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2022-06-09 03:33:37] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2022-06-09 03:33:37] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2022-06-09 03:33:38] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2022-06-09 03:33:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 253 ms
[2022-06-09 03:33:38] [INFO ] Computed and/alt/rep : 52/121/52 causal constraints (skipped 147 transitions) in 23 ms.
[2022-06-09 03:33:38] [INFO ] Added : 46 causal constraints over 10 iterations in 220 ms. Result :sat
Minimization took 68 ms.
[2022-06-09 03:33:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:33:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:38] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-06-09 03:33:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:33:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:33:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:38] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-06-09 03:33:38] [INFO ] [Nat]Added 75 Read/Feed constraints in 23 ms returned sat
[2022-06-09 03:33:38] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2022-06-09 03:33:38] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2022-06-09 03:33:38] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2022-06-09 03:33:38] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2022-06-09 03:33:38] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2022-06-09 03:33:38] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2022-06-09 03:33:38] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 355 ms
[2022-06-09 03:33:38] [INFO ] Computed and/alt/rep : 52/121/52 causal constraints (skipped 147 transitions) in 25 ms.
[2022-06-09 03:33:39] [INFO ] Added : 46 causal constraints over 10 iterations in 216 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [4, 4, 4] Max seen :[0, 0, 0]
Incomplete Parikh walk after 55300 steps, including 10848 resets, run finished after 121 ms. (steps per millisecond=457 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 56600 steps, including 10814 resets, run finished after 94 ms. (steps per millisecond=602 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 58500 steps, including 11552 resets, run finished after 105 ms. (steps per millisecond=557 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 200/200 transitions.
Applied a total of 0 rules in 16 ms. Remains 135 /135 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 200/200 transitions.
Starting structural reductions, iteration 0 : 135/135 places, 200/200 transitions.
Applied a total of 0 rules in 10 ms. Remains 135 /135 variables (removed 0) and now considering 200/200 (removed 0) transitions.
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 03:33:39] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:33:39] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 03:33:39] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:33:39] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-09 03:33:39] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2022-06-09 03:33:39] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 03:33:39] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:33:40] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 200/200 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-00
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 03:33:40] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2322 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 928 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 03:33:40] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:33:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:40] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-06-09 03:33:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:33:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:33:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:40] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-06-09 03:33:40] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-09 03:33:40] [INFO ] [Nat]Added 75 Read/Feed constraints in 23 ms returned sat
[2022-06-09 03:33:40] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2022-06-09 03:33:40] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2022-06-09 03:33:40] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2022-06-09 03:33:40] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2022-06-09 03:33:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 236 ms
[2022-06-09 03:33:40] [INFO ] Computed and/alt/rep : 52/121/52 causal constraints (skipped 147 transitions) in 17 ms.
[2022-06-09 03:33:40] [INFO ] Added : 46 causal constraints over 10 iterations in 214 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 58500 steps, including 11547 resets, run finished after 100 ms. (steps per millisecond=585 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 200/200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 131 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 131 transition count 196
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 129 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 129 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 129 transition count 192
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 127 transition count 177
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 127 transition count 177
Applied a total of 18 rules in 25 ms. Remains 127 /135 variables (removed 8) and now considering 177/200 (removed 23) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/135 places, 177/200 transitions.
// Phase 1: matrix 177 rows 127 cols
[2022-06-09 03:33:40] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 230331 resets, run finished after 1140 ms. (steps per millisecond=877 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95600 resets, run finished after 518 ms. (steps per millisecond=1930 ) properties (out of 1) seen :0
// Phase 1: matrix 177 rows 127 cols
[2022-06-09 03:33:42] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:33:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:42] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-06-09 03:33:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:33:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:33:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:42] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-06-09 03:33:42] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-06-09 03:33:42] [INFO ] [Nat]Added 56 Read/Feed constraints in 18 ms returned sat
[2022-06-09 03:33:42] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2022-06-09 03:33:42] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2022-06-09 03:33:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2022-06-09 03:33:42] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 126 transitions) in 14 ms.
[2022-06-09 03:33:43] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2022-06-09 03:33:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2022-06-09 03:33:43] [INFO ] Added : 44 causal constraints over 9 iterations in 239 ms. Result :sat
Minimization took 60 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 49400 steps, including 9328 resets, run finished after 69 ms. (steps per millisecond=715 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 177/177 transitions.
Applied a total of 0 rules in 6 ms. Remains 127 /127 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 177/177 transitions.
Starting structural reductions, iteration 0 : 127/127 places, 177/177 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 127 cols
[2022-06-09 03:33:43] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:33:43] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 177 rows 127 cols
[2022-06-09 03:33:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:33:43] [INFO ] State equation strengthened by 56 read => feed constraints.
[2022-06-09 03:33:43] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2022-06-09 03:33:43] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 177 rows 127 cols
[2022-06-09 03:33:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:33:43] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 177/177 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-00 in 3639 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-03
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 03:33:43] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 975 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 03:33:43] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:33:43] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:33:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:43] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-06-09 03:33:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:33:43] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:33:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:43] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-06-09 03:33:43] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-09 03:33:43] [INFO ] [Nat]Added 75 Read/Feed constraints in 24 ms returned sat
[2022-06-09 03:33:43] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2022-06-09 03:33:43] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2022-06-09 03:33:44] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2022-06-09 03:33:44] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2022-06-09 03:33:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 250 ms
[2022-06-09 03:33:44] [INFO ] Computed and/alt/rep : 52/121/52 causal constraints (skipped 147 transitions) in 14 ms.
[2022-06-09 03:33:44] [INFO ] Added : 46 causal constraints over 10 iterations in 194 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 56600 steps, including 10809 resets, run finished after 95 ms. (steps per millisecond=595 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 200/200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 131 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 131 transition count 196
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 129 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 129 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 129 transition count 192
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 127 transition count 179
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 127 transition count 179
Applied a total of 18 rules in 16 ms. Remains 127 /135 variables (removed 8) and now considering 179/200 (removed 21) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/135 places, 179/200 transitions.
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:33:44] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229946 resets, run finished after 1148 ms. (steps per millisecond=871 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95644 resets, run finished after 535 ms. (steps per millisecond=1869 ) properties (out of 1) seen :0
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:33:46] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:33:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:33:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:46] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-06-09 03:33:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:33:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:33:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:46] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-06-09 03:33:46] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 03:33:46] [INFO ] [Nat]Added 58 Read/Feed constraints in 17 ms returned sat
[2022-06-09 03:33:46] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 0 ms to minimize.
[2022-06-09 03:33:46] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2022-06-09 03:33:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2022-06-09 03:33:46] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 12 ms.
[2022-06-09 03:33:46] [INFO ] Added : 44 causal constraints over 9 iterations in 155 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 46300 steps, including 9437 resets, run finished after 63 ms. (steps per millisecond=734 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 179/179 transitions.
Starting structural reductions, iteration 0 : 127/127 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:33:46] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:33:46] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:33:46] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:33:46] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 03:33:47] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2022-06-09 03:33:47] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:33:47] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:33:47] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-03 in 3550 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-10
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 03:33:47] [INFO ] Computed 2 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 2336 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 899 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 200 rows 135 cols
[2022-06-09 03:33:47] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:33:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:33:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:47] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-06-09 03:33:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:33:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:33:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:47] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2022-06-09 03:33:47] [INFO ] State equation strengthened by 75 read => feed constraints.
[2022-06-09 03:33:47] [INFO ] [Nat]Added 75 Read/Feed constraints in 24 ms returned sat
[2022-06-09 03:33:47] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2022-06-09 03:33:47] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2022-06-09 03:33:47] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2022-06-09 03:33:47] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2022-06-09 03:33:47] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2022-06-09 03:33:47] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2022-06-09 03:33:47] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 370 ms
[2022-06-09 03:33:47] [INFO ] Computed and/alt/rep : 52/121/52 causal constraints (skipped 147 transitions) in 11 ms.
[2022-06-09 03:33:47] [INFO ] Added : 46 causal constraints over 10 iterations in 191 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 55300 steps, including 10864 resets, run finished after 84 ms. (steps per millisecond=658 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 200/200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 133 transition count 198
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 133 transition count 198
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 131 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 131 transition count 196
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 129 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 129 transition count 194
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 129 transition count 192
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 127 transition count 180
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 127 transition count 180
Applied a total of 18 rules in 13 ms. Remains 127 /135 variables (removed 8) and now considering 180/200 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/135 places, 180/200 transitions.
// Phase 1: matrix 180 rows 127 cols
[2022-06-09 03:33:48] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230005 resets, run finished after 1197 ms. (steps per millisecond=835 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95545 resets, run finished after 549 ms. (steps per millisecond=1821 ) properties (out of 1) seen :0
// Phase 1: matrix 180 rows 127 cols
[2022-06-09 03:33:49] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:33:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:49] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-06-09 03:33:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:33:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:33:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:33:50] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-06-09 03:33:50] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-06-09 03:33:50] [INFO ] [Nat]Added 59 Read/Feed constraints in 20 ms returned sat
[2022-06-09 03:33:50] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2022-06-09 03:33:50] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 5 ms to minimize.
[2022-06-09 03:33:50] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2022-06-09 03:33:50] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2022-06-09 03:33:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 239 ms
[2022-06-09 03:33:50] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 129 transitions) in 12 ms.
[2022-06-09 03:33:50] [INFO ] Added : 44 causal constraints over 9 iterations in 146 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 41100 steps, including 8010 resets, run finished after 55 ms. (steps per millisecond=747 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 180/180 transitions.
Starting structural reductions, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 127 cols
[2022-06-09 03:33:50] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:33:50] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 180 rows 127 cols
[2022-06-09 03:33:50] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:33:50] [INFO ] State equation strengthened by 59 read => feed constraints.
[2022-06-09 03:33:50] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2022-06-09 03:33:50] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 180 rows 127 cols
[2022-06-09 03:33:50] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:33:51] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-10 in 3842 ms.
[2022-06-09 03:33:51] [INFO ] Flatten gal took : 55 ms
[2022-06-09 03:33:51] [INFO ] Applying decomposition
[2022-06-09 03:33:51] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8157458593060610275.txt, -o, /tmp/graph8157458593060610275.bin, -w, /tmp/graph8157458593060610275.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8157458593060610275.bin, -l, -1, -v, -w, /tmp/graph8157458593060610275.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:33:51] [INFO ] Decomposing Gal with order
[2022-06-09 03:33:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:33:51] [INFO ] Removed a total of 237 redundant transitions.
[2022-06-09 03:33:51] [INFO ] Flatten gal took : 60 ms
[2022-06-09 03:33:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 177 labels/synchronizations in 14 ms.
[2022-06-09 03:33:51] [INFO ] Time to serialize gal into /tmp/UpperBounds12653297628288965231.gal : 7 ms
[2022-06-09 03:33:51] [INFO ] Time to serialize properties into /tmp/UpperBounds13240085970118193762.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds12653297628288965231.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds13240085970118193762.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds12653297628288965231.gal -t CGAL -reachable-file /tmp/UpperBounds13240085970118193762.prop --nowitness
Loading property file /tmp/UpperBounds13240085970118193762.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,27476,0.201866,11340,718,740,9891,5998,588,22462,180,16394,0
Total reachable state count : 27476

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-00 :0 <= i5.i1.u12.l2185 <= 1
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-00 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-d2m04-UpperBounds-00,0,0.219352,11340,1,0,9891,5998,717,22462,211,16394,792
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-03 :0 <= i5.i1.u12.l2579 <= 1
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-03 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-d2m04-UpperBounds-03,0,0.221563,11340,1,0,9891,5998,739,22462,216,16394,912
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m04-UpperBounds-10 :0 <= i3.u13.l2580 <= 1
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-10 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-d2m04-UpperBounds-10,0,0.222086,11340,1,0,9891,5998,768,22462,221,16394,1035

BK_STOP 1654745632992

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-d2m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is DBSingleClientW-PT-d2m04, 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 r323-tall-165472292600091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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