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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 7.2K Jun 7 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Jun 7 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 7 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Jun 7 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K 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:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 6 15:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Jun 7 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Jun 7 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Jun 7 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:25 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-d2m05-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654745656057

Running Version 0
[2022-06-09 03:34:17] [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:34:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:34:18] [INFO ] Load time of PNML (sax parser for PT used): 246 ms
[2022-06-09 03:34:18] [INFO ] Transformed 4763 places.
[2022-06-09 03:34:18] [INFO ] Transformed 2478 transitions.
[2022-06-09 03:34:18] [INFO ] Parsed PT model containing 4763 places and 2478 transitions in 309 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 3580 places in 17 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2022-06-09 03:34:18] [INFO ] Computed 6 place invariants in 187 ms
Incomplete random walk after 10000 steps, including 2254 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 941 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 931 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 941 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 963 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 893 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 916 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
// Phase 1: matrix 2478 rows 1183 cols
[2022-06-09 03:34:19] [INFO ] Computed 6 place invariants in 108 ms
[2022-06-09 03:34:19] [INFO ] [Real]Absence check using 2 positive place invariants in 17 ms returned sat
[2022-06-09 03:34:19] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2022-06-09 03:34:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:34:20] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2022-06-09 03:34:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:34:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2022-06-09 03:34:20] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2022-06-09 03:34:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:34:21] [INFO ] [Nat]Absence check using state equation in 729 ms returned sat
[2022-06-09 03:34:21] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2022-06-09 03:34:25] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:34:25] [INFO ] [Nat]Added 1588 Read/Feed constraints in 3657 ms returned unknown
[2022-06-09 03:34:25] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-06-09 03:34:25] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:34:26] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2022-06-09 03:34:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:34:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2022-06-09 03:34:26] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:34:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:34:26] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2022-06-09 03:34:31] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:34:31] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4390 ms returned unknown
[2022-06-09 03:34:31] [INFO ] [Real]Absence check using 2 positive place invariants in 20 ms returned sat
[2022-06-09 03:34:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2022-06-09 03:34:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:34:32] [INFO ] [Real]Absence check using state equation in 689 ms returned sat
[2022-06-09 03:34:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:34:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2022-06-09 03:34:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2022-06-09 03:34:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:34:33] [INFO ] [Nat]Absence check using state equation in 697 ms returned sat
[2022-06-09 03:34:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:34:37] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4163 ms returned unknown
[2022-06-09 03:34:37] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-06-09 03:34:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2022-06-09 03:34:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:34:38] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2022-06-09 03:34:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:34:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2022-06-09 03:34:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2022-06-09 03:34:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:34:38] [INFO ] [Nat]Absence check using state equation in 676 ms returned sat
[2022-06-09 03:34:43] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:34:43] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4196 ms returned unknown
[2022-06-09 03:34:43] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-06-09 03:34:43] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2022-06-09 03:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:34:43] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2022-06-09 03:34:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:34:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2022-06-09 03:34:44] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2022-06-09 03:34:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:34:44] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2022-06-09 03:34:48] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:34:48] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4242 ms returned unknown
[2022-06-09 03:34:49] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-06-09 03:34:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:34:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:34:49] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2022-06-09 03:34:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:34:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2022-06-09 03:34:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:34:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:34:50] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2022-06-09 03:34:54] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:34:54] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4129 ms returned unknown
Current structural bounds on expressions (after SMT) : [5, 5, 7, 7, 1944, 7] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 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.11 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 387 places :
Symmetric choice reduction at 1 with 387 rule applications. Total rules 605 place count 749 transition count 1204
Iterating global reduction 1 with 387 rules applied. Total rules applied 992 place count 749 transition count 1204
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1001 place count 749 transition count 1195
Discarding 313 places :
Symmetric choice reduction at 2 with 313 rule applications. Total rules 1314 place count 436 transition count 882
Iterating global reduction 2 with 313 rules applied. Total rules applied 1627 place count 436 transition count 882
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1639 place count 436 transition count 870
Discarding 236 places :
Symmetric choice reduction at 3 with 236 rule applications. Total rules 1875 place count 200 transition count 537
Iterating global reduction 3 with 236 rules applied. Total rules applied 2111 place count 200 transition count 537
Ensure Unique test removed 208 transitions
Reduce isomorphic transitions removed 208 transitions.
Iterating post reduction 3 with 208 rules applied. Total rules applied 2319 place count 200 transition count 329
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2343 place count 176 transition count 290
Iterating global reduction 4 with 24 rules applied. Total rules applied 2367 place count 176 transition count 290
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2373 place count 176 transition count 284
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2389 place count 160 transition count 268
Iterating global reduction 5 with 16 rules applied. Total rules applied 2405 place count 160 transition count 268
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2409 place count 160 transition count 264
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2422 place count 147 transition count 251
Iterating global reduction 6 with 13 rules applied. Total rules applied 2435 place count 147 transition count 251
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2448 place count 147 transition count 238
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2452 place count 143 transition count 218
Iterating global reduction 7 with 4 rules applied. Total rules applied 2456 place count 143 transition count 218
Applied a total of 2456 rules in 274 ms. Remains 143 /1183 variables (removed 1040) and now considering 218/2478 (removed 2260) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/1183 places, 218/2478 transitions.
// Phase 1: matrix 218 rows 143 cols
[2022-06-09 03:34:55] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 230360 resets, run finished after 1403 ms. (steps per millisecond=712 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95995 resets, run finished after 627 ms. (steps per millisecond=1594 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95408 resets, run finished after 621 ms. (steps per millisecond=1610 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96021 resets, run finished after 631 ms. (steps per millisecond=1584 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95322 resets, run finished after 624 ms. (steps per millisecond=1602 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95801 resets, run finished after 628 ms. (steps per millisecond=1592 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95656 resets, run finished after 629 ms. (steps per millisecond=1589 ) properties (out of 6) seen :0
// Phase 1: matrix 218 rows 143 cols
[2022-06-09 03:35:00] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 03:35:00] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:00] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-06-09 03:35:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:00] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:00] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-06-09 03:35:00] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-09 03:35:00] [INFO ] [Nat]Added 81 Read/Feed constraints in 40 ms returned sat
[2022-06-09 03:35:00] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 22 ms to minimize.
[2022-06-09 03:35:00] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2022-06-09 03:35:00] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2022-06-09 03:35:00] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 2 ms to minimize.
[2022-06-09 03:35:00] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2022-06-09 03:35:01] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 0 ms to minimize.
[2022-06-09 03:35:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 445 ms
[2022-06-09 03:35:01] [INFO ] Computed and/alt/rep : 55/136/55 causal constraints (skipped 162 transitions) in 28 ms.
[2022-06-09 03:35:01] [INFO ] Added : 47 causal constraints over 10 iterations in 253 ms. Result :sat
Minimization took 72 ms.
[2022-06-09 03:35:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:01] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-06-09 03:35:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:01] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2022-06-09 03:35:01] [INFO ] [Nat]Added 81 Read/Feed constraints in 37 ms returned sat
[2022-06-09 03:35:01] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2022-06-09 03:35:01] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2022-06-09 03:35:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2022-06-09 03:35:01] [INFO ] Computed and/alt/rep : 55/136/55 causal constraints (skipped 162 transitions) in 27 ms.
[2022-06-09 03:35:01] [INFO ] Added : 47 causal constraints over 10 iterations in 222 ms. Result :sat
Minimization took 65 ms.
[2022-06-09 03:35:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:02] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-06-09 03:35:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:02] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-06-09 03:35:02] [INFO ] [Nat]Added 81 Read/Feed constraints in 24 ms returned sat
[2022-06-09 03:35:02] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2022-06-09 03:35:02] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2022-06-09 03:35:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 128 ms
[2022-06-09 03:35:02] [INFO ] Computed and/alt/rep : 55/136/55 causal constraints (skipped 162 transitions) in 26 ms.
[2022-06-09 03:35:02] [INFO ] Added : 47 causal constraints over 10 iterations in 217 ms. Result :sat
Minimization took 62 ms.
[2022-06-09 03:35:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:02] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-06-09 03:35:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:02] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-06-09 03:35:02] [INFO ] [Nat]Added 81 Read/Feed constraints in 27 ms returned sat
[2022-06-09 03:35:02] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2022-06-09 03:35:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2022-06-09 03:35:02] [INFO ] Computed and/alt/rep : 55/136/55 causal constraints (skipped 162 transitions) in 16 ms.
[2022-06-09 03:35:03] [INFO ] Added : 47 causal constraints over 10 iterations in 211 ms. Result :sat
Minimization took 64 ms.
[2022-06-09 03:35:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:03] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2022-06-09 03:35:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:03] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-06-09 03:35:03] [INFO ] [Nat]Added 81 Read/Feed constraints in 31 ms returned sat
[2022-06-09 03:35:03] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 0 ms to minimize.
[2022-06-09 03:35:03] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2022-06-09 03:35:03] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2022-06-09 03:35:03] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2022-06-09 03:35:03] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2022-06-09 03:35:03] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2022-06-09 03:35:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 380 ms
[2022-06-09 03:35:03] [INFO ] Computed and/alt/rep : 55/136/55 causal constraints (skipped 162 transitions) in 17 ms.
[2022-06-09 03:35:03] [INFO ] Added : 47 causal constraints over 10 iterations in 208 ms. Result :sat
Minimization took 67 ms.
[2022-06-09 03:35:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:04] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-06-09 03:35:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:04] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-06-09 03:35:04] [INFO ] [Nat]Added 81 Read/Feed constraints in 26 ms returned sat
[2022-06-09 03:35:04] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 0 ms to minimize.
[2022-06-09 03:35:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2022-06-09 03:35:04] [INFO ] Computed and/alt/rep : 55/136/55 causal constraints (skipped 162 transitions) in 14 ms.
[2022-06-09 03:35:04] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2022-06-09 03:35:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2022-06-09 03:35:04] [INFO ] Added : 47 causal constraints over 10 iterations in 282 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : [5, 5, 7, 7, 1944, 7] Max seen :[0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 33200 steps, including 6456 resets, run finished after 74 ms. (steps per millisecond=448 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 55800 steps, including 11211 resets, run finished after 101 ms. (steps per millisecond=552 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 33600 steps, including 6352 resets, run finished after 58 ms. (steps per millisecond=579 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 33600 steps, including 6524 resets, run finished after 59 ms. (steps per millisecond=569 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 54500 steps, including 10298 resets, run finished after 119 ms. (steps per millisecond=457 ) properties (out of 6) seen :0 could not realise parikh vector
Incomplete Parikh walk after 55800 steps, including 10652 resets, run finished after 90 ms. (steps per millisecond=620 ) properties (out of 6) seen :0 could not realise parikh vector
Support contains 6 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 218/218 transitions.
Applied a total of 0 rules in 14 ms. Remains 143 /143 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 218/218 transitions.
Starting structural reductions, iteration 0 : 143/143 places, 218/218 transitions.
Applied a total of 0 rules in 14 ms. Remains 143 /143 variables (removed 0) and now considering 218/218 (removed 0) transitions.
// Phase 1: matrix 218 rows 143 cols
[2022-06-09 03:35:05] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:35:05] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 218 rows 143 cols
[2022-06-09 03:35:05] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:35:05] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-09 03:35:05] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2022-06-09 03:35:05] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 218 rows 143 cols
[2022-06-09 03:35:05] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:35:05] [INFO ] Dead Transitions using invariants and state equation in 84 ms returned []
Finished structural reductions, in 1 iterations. Remains : 143/143 places, 218/218 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-05
// Phase 1: matrix 218 rows 143 cols
[2022-06-09 03:35:05] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2309 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 1000 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 218 rows 143 cols
[2022-06-09 03:35:05] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:35:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:05] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-06-09 03:35:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:05] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-06-09 03:35:05] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-09 03:35:05] [INFO ] [Nat]Added 81 Read/Feed constraints in 27 ms returned sat
[2022-06-09 03:35:06] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2022-06-09 03:35:06] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2022-06-09 03:35:06] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2022-06-09 03:35:06] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2022-06-09 03:35:06] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2022-06-09 03:35:06] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2022-06-09 03:35:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 346 ms
[2022-06-09 03:35:06] [INFO ] Computed and/alt/rep : 55/136/55 causal constraints (skipped 162 transitions) in 14 ms.
[2022-06-09 03:35:06] [INFO ] Added : 47 causal constraints over 10 iterations in 208 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 55800 steps, including 10690 resets, run finished after 89 ms. (steps per millisecond=626 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 218/218 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 138 transition count 213
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 138 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 138 transition count 212
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 134 transition count 206
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 134 transition count 206
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 134 transition count 203
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 131 transition count 184
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 131 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 130 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 130 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 129 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 129 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 128 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 128 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 127 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 127 transition count 179
Applied a total of 36 rules in 31 ms. Remains 127 /143 variables (removed 16) and now considering 179/218 (removed 39) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/143 places, 179/218 transitions.
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:35:06] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229654 resets, run finished after 1136 ms. (steps per millisecond=880 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 96391 resets, run finished after 533 ms. (steps per millisecond=1876 ) properties (out of 1) seen :0
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:35:08] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:35:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:08] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2022-06-09 03:35:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:35:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:08] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-06-09 03:35:08] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 03:35:08] [INFO ] [Nat]Added 58 Read/Feed constraints in 16 ms returned sat
[2022-06-09 03:35:08] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2022-06-09 03:35:08] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2022-06-09 03:35:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2022-06-09 03:35:08] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 13 ms.
[2022-06-09 03:35:08] [INFO ] Added : 44 causal constraints over 9 iterations in 156 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 46700 steps, including 9132 resets, run finished after 65 ms. (steps per millisecond=718 ) 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 6 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:35:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:35:09] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:35:09] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:35:09] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 03:35:09] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2022-06-09 03:35:09] [INFO ] Redundant transitions in 21 ms returned []
// Phase 1: matrix 179 rows 127 cols
[2022-06-09 03:35:09] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:35:09] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-05 in 3621 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-06
// Phase 1: matrix 218 rows 143 cols
[2022-06-09 03:35:09] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2311 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 912 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 218 rows 143 cols
[2022-06-09 03:35:09] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:35:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2022-06-09 03:35:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:09] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-06-09 03:35:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:09] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-06-09 03:35:09] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-09 03:35:09] [INFO ] [Nat]Added 81 Read/Feed constraints in 37 ms returned sat
[2022-06-09 03:35:09] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 0 ms to minimize.
[2022-06-09 03:35:09] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 0 ms to minimize.
[2022-06-09 03:35:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2022-06-09 03:35:09] [INFO ] Computed and/alt/rep : 55/136/55 causal constraints (skipped 162 transitions) in 13 ms.
[2022-06-09 03:35:09] [INFO ] Added : 47 causal constraints over 10 iterations in 189 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 54500 steps, including 10426 resets, run finished after 88 ms. (steps per millisecond=619 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 218/218 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 138 transition count 213
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 138 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 138 transition count 212
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 134 transition count 206
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 134 transition count 206
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 134 transition count 203
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 131 transition count 187
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 131 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 131 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 130 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 130 transition count 179
Applied a total of 31 rules in 18 ms. Remains 130 /143 variables (removed 13) and now considering 179/218 (removed 39) transitions.
Finished structural reductions, in 1 iterations. Remains : 130/143 places, 179/218 transitions.
// Phase 1: matrix 179 rows 130 cols
[2022-06-09 03:35:10] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229656 resets, run finished after 1126 ms. (steps per millisecond=888 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95469 resets, run finished after 539 ms. (steps per millisecond=1855 ) properties (out of 1) seen :0
// Phase 1: matrix 179 rows 130 cols
[2022-06-09 03:35:11] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:35:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:11] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-06-09 03:35:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:11] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:11] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-06-09 03:35:11] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-06-09 03:35:11] [INFO ] [Nat]Added 53 Read/Feed constraints in 21 ms returned sat
[2022-06-09 03:35:12] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2022-06-09 03:35:12] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2022-06-09 03:35:12] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2022-06-09 03:35:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 172 ms
[2022-06-09 03:35:12] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 127 transitions) in 15 ms.
[2022-06-09 03:35:12] [INFO ] Added : 43 causal constraints over 9 iterations in 140 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 38900 steps, including 7556 resets, run finished after 60 ms. (steps per millisecond=648 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 179/179 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 130/130 places, 179/179 transitions.
Starting structural reductions, iteration 0 : 130/130 places, 179/179 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 130 cols
[2022-06-09 03:35:12] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:35:12] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 179 rows 130 cols
[2022-06-09 03:35:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:35:12] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-06-09 03:35:12] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2022-06-09 03:35:12] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 179 rows 130 cols
[2022-06-09 03:35:12] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:35:12] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Finished structural reductions, in 1 iterations. Remains : 130/130 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-06 in 3465 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-07
// Phase 1: matrix 218 rows 143 cols
[2022-06-09 03:35:12] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2312 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 968 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 218 rows 143 cols
[2022-06-09 03:35:12] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:35:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:12] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:35:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:13] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2022-06-09 03:35:13] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-09 03:35:13] [INFO ] [Nat]Added 81 Read/Feed constraints in 29 ms returned sat
[2022-06-09 03:35:13] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 0 ms to minimize.
[2022-06-09 03:35:13] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2022-06-09 03:35:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2022-06-09 03:35:13] [INFO ] Computed and/alt/rep : 55/136/55 causal constraints (skipped 162 transitions) in 14 ms.
[2022-06-09 03:35:13] [INFO ] Added : 47 causal constraints over 10 iterations in 197 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 33600 steps, including 6578 resets, run finished after 86 ms. (steps per millisecond=390 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 218/218 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 138 transition count 213
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 138 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 138 transition count 212
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 134 transition count 206
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 134 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 134 transition count 204
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 131 transition count 191
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 131 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 131 transition count 190
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 30 place count 129 transition count 182
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 129 transition count 182
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 128 transition count 181
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 128 transition count 181
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 127 transition count 180
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 127 transition count 180
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 126 transition count 178
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 126 transition count 178
Applied a total of 38 rules in 35 ms. Remains 126 /143 variables (removed 17) and now considering 178/218 (removed 40) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/143 places, 178/218 transitions.
// Phase 1: matrix 178 rows 126 cols
[2022-06-09 03:35:13] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229680 resets, run finished after 1155 ms. (steps per millisecond=865 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95429 resets, run finished after 518 ms. (steps per millisecond=1930 ) properties (out of 1) seen :0
// Phase 1: matrix 178 rows 126 cols
[2022-06-09 03:35:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:35:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:35:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:15] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2022-06-09 03:35:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:15] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-06-09 03:35:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-09 03:35:15] [INFO ] [Nat]Added 57 Read/Feed constraints in 16 ms returned sat
[2022-06-09 03:35:15] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2022-06-09 03:35:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2022-06-09 03:35:15] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 127 transitions) in 11 ms.
[2022-06-09 03:35:15] [INFO ] Added : 44 causal constraints over 9 iterations in 129 ms. Result :sat
Minimization took 58 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 25800 steps, including 4983 resets, run finished after 36 ms. (steps per millisecond=716 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 178/178 transitions.
Starting structural reductions, iteration 0 : 126/126 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 178/178 (removed 0) transitions.
// Phase 1: matrix 178 rows 126 cols
[2022-06-09 03:35:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:35:15] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 178 rows 126 cols
[2022-06-09 03:35:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:35:15] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-09 03:35:16] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2022-06-09 03:35:16] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 178 rows 126 cols
[2022-06-09 03:35:16] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:35:16] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 178/178 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-07 in 3279 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-12
// Phase 1: matrix 218 rows 143 cols
[2022-06-09 03:35:16] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2293 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 964 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 218 rows 143 cols
[2022-06-09 03:35:16] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:35:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:16] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-06-09 03:35:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:16] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2022-06-09 03:35:16] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-09 03:35:16] [INFO ] [Nat]Added 81 Read/Feed constraints in 27 ms returned sat
[2022-06-09 03:35:16] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2022-06-09 03:35:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2022-06-09 03:35:16] [INFO ] Computed and/alt/rep : 55/136/55 causal constraints (skipped 162 transitions) in 14 ms.
[2022-06-09 03:35:16] [INFO ] Added : 47 causal constraints over 10 iterations in 199 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 33600 steps, including 6393 resets, run finished after 58 ms. (steps per millisecond=579 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 218/218 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 138 transition count 213
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 138 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 138 transition count 212
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 134 transition count 207
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 134 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 134 transition count 205
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 25 place count 130 transition count 185
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 130 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 130 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 129 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 129 transition count 183
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 128 transition count 182
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 128 transition count 182
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 127 transition count 181
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 127 transition count 181
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 126 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 126 transition count 179
Applied a total of 38 rules in 18 ms. Remains 126 /143 variables (removed 17) and now considering 179/218 (removed 39) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/143 places, 179/218 transitions.
// Phase 1: matrix 179 rows 126 cols
[2022-06-09 03:35:16] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230160 resets, run finished after 1118 ms. (steps per millisecond=894 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95862 resets, run finished after 525 ms. (steps per millisecond=1904 ) properties (out of 1) seen :0
// Phase 1: matrix 179 rows 126 cols
[2022-06-09 03:35:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:35:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:18] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-06-09 03:35:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:35:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:18] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-06-09 03:35:18] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-09 03:35:18] [INFO ] [Nat]Added 57 Read/Feed constraints in 18 ms returned sat
[2022-06-09 03:35:18] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2022-06-09 03:35:18] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2022-06-09 03:35:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2022-06-09 03:35:18] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 128 transitions) in 11 ms.
[2022-06-09 03:35:18] [INFO ] Added : 44 causal constraints over 9 iterations in 131 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 24900 steps, including 4405 resets, run finished after 40 ms. (steps per millisecond=622 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 179/179 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 179/179 transitions.
Starting structural reductions, iteration 0 : 126/126 places, 179/179 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 126 cols
[2022-06-09 03:35:18] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:35:18] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 179 rows 126 cols
[2022-06-09 03:35:18] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:35:19] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-09 03:35:19] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2022-06-09 03:35:19] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 179 rows 126 cols
[2022-06-09 03:35:19] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:35:19] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-12 in 3217 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-14
// Phase 1: matrix 218 rows 143 cols
[2022-06-09 03:35:19] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2320 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 913 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 218 rows 143 cols
[2022-06-09 03:35:19] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:35:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:19] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-06-09 03:35:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:19] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-06-09 03:35:19] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-09 03:35:19] [INFO ] [Nat]Added 81 Read/Feed constraints in 31 ms returned sat
[2022-06-09 03:35:19] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2022-06-09 03:35:19] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2022-06-09 03:35:19] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2022-06-09 03:35:19] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2022-06-09 03:35:19] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2022-06-09 03:35:19] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2022-06-09 03:35:19] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 344 ms
[2022-06-09 03:35:19] [INFO ] Computed and/alt/rep : 55/136/55 causal constraints (skipped 162 transitions) in 11 ms.
[2022-06-09 03:35:20] [INFO ] Added : 47 causal constraints over 10 iterations in 212 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 55800 steps, including 11226 resets, run finished after 91 ms. (steps per millisecond=613 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 218/218 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 138 transition count 213
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 138 transition count 213
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 133 transition count 206
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 133 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 133 transition count 203
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 129 transition count 183
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 129 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 129 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 33 place count 128 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 34 place count 128 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 127 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 127 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 37 place count 126 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 126 transition count 179
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 125 transition count 177
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 125 transition count 177
Applied a total of 40 rules in 22 ms. Remains 125 /143 variables (removed 18) and now considering 177/218 (removed 41) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/143 places, 177/218 transitions.
// Phase 1: matrix 177 rows 125 cols
[2022-06-09 03:35:20] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 230001 resets, run finished after 1153 ms. (steps per millisecond=867 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95699 resets, run finished after 534 ms. (steps per millisecond=1872 ) properties (out of 1) seen :0
// Phase 1: matrix 177 rows 125 cols
[2022-06-09 03:35:22] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:35:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:22] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-06-09 03:35:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:22] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-06-09 03:35:22] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-09 03:35:22] [INFO ] [Nat]Added 57 Read/Feed constraints in 17 ms returned sat
[2022-06-09 03:35:22] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 127 transitions) in 13 ms.
[2022-06-09 03:35:22] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2022-06-09 03:35:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2022-06-09 03:35:22] [INFO ] Added : 43 causal constraints over 9 iterations in 202 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 44600 steps, including 8687 resets, run finished after 63 ms. (steps per millisecond=707 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 125/125 places, 177/177 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 177/177 transitions.
Starting structural reductions, iteration 0 : 125/125 places, 177/177 transitions.
Applied a total of 0 rules in 3 ms. Remains 125 /125 variables (removed 0) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 125 cols
[2022-06-09 03:35:22] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:35:22] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 177 rows 125 cols
[2022-06-09 03:35:22] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:35:22] [INFO ] State equation strengthened by 57 read => feed constraints.
[2022-06-09 03:35:22] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2022-06-09 03:35:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 177 rows 125 cols
[2022-06-09 03:35:22] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:35:22] [INFO ] Dead Transitions using invariants and state equation in 63 ms returned []
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 177/177 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-14 in 3582 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-15
// Phase 1: matrix 218 rows 143 cols
[2022-06-09 03:35:22] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2313 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 968 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 218 rows 143 cols
[2022-06-09 03:35:22] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:35:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:23] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-06-09 03:35:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:23] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-06-09 03:35:23] [INFO ] State equation strengthened by 81 read => feed constraints.
[2022-06-09 03:35:23] [INFO ] [Nat]Added 81 Read/Feed constraints in 28 ms returned sat
[2022-06-09 03:35:23] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2022-06-09 03:35:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2022-06-09 03:35:23] [INFO ] Computed and/alt/rep : 55/136/55 causal constraints (skipped 162 transitions) in 14 ms.
[2022-06-09 03:35:23] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2022-06-09 03:35:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2022-06-09 03:35:23] [INFO ] Added : 47 causal constraints over 10 iterations in 284 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 33200 steps, including 6524 resets, run finished after 56 ms. (steps per millisecond=592 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 143 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 143/143 places, 218/218 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 138 transition count 213
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 138 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 138 transition count 212
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 15 place count 134 transition count 207
Iterating global reduction 1 with 4 rules applied. Total rules applied 19 place count 134 transition count 207
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 134 transition count 205
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 24 place count 131 transition count 193
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 131 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 131 transition count 192
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 30 place count 129 transition count 184
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 129 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 128 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 128 transition count 183
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 127 transition count 182
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 127 transition count 182
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 126 transition count 180
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 126 transition count 180
Applied a total of 38 rules in 26 ms. Remains 126 /143 variables (removed 17) and now considering 180/218 (removed 38) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/143 places, 180/218 transitions.
// Phase 1: matrix 180 rows 126 cols
[2022-06-09 03:35:23] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230019 resets, run finished after 1168 ms. (steps per millisecond=856 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95444 resets, run finished after 537 ms. (steps per millisecond=1862 ) properties (out of 1) seen :0
// Phase 1: matrix 180 rows 126 cols
[2022-06-09 03:35:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:35:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:25] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2022-06-09 03:35:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:35:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:35:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:35:25] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-06-09 03:35:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 03:35:25] [INFO ] [Nat]Added 58 Read/Feed constraints in 18 ms returned sat
[2022-06-09 03:35:25] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2022-06-09 03:35:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2022-06-09 03:35:25] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 10 ms.
[2022-06-09 03:35:25] [INFO ] Added : 44 causal constraints over 9 iterations in 142 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 26600 steps, including 4965 resets, run finished after 39 ms. (steps per millisecond=682 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 180/180 transitions.
Starting structural reductions, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 126 cols
[2022-06-09 03:35:25] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:35:25] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 180 rows 126 cols
[2022-06-09 03:35:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:35:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 03:35:26] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2022-06-09 03:35:26] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 180 rows 126 cols
[2022-06-09 03:35:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:35:26] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-15 in 3288 ms.
[2022-06-09 03:35:26] [INFO ] Flatten gal took : 72 ms
[2022-06-09 03:35:26] [INFO ] Applying decomposition
[2022-06-09 03:35:26] [INFO ] Flatten gal took : 25 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/graph6371595183201175029.txt, -o, /tmp/graph6371595183201175029.bin, -w, /tmp/graph6371595183201175029.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/graph6371595183201175029.bin, -l, -1, -v, -w, /tmp/graph6371595183201175029.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:35:26] [INFO ] Decomposing Gal with order
[2022-06-09 03:35:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:35:26] [INFO ] Removed a total of 218 redundant transitions.
[2022-06-09 03:35:26] [INFO ] Flatten gal took : 81 ms
[2022-06-09 03:35:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 147 labels/synchronizations in 10 ms.
[2022-06-09 03:35:26] [INFO ] Time to serialize gal into /tmp/UpperBounds14689107003577004183.gal : 14 ms
[2022-06-09 03:35:26] [INFO ] Time to serialize properties into /tmp/UpperBounds15620599736673326896.prop : 1 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/UpperBounds14689107003577004183.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15620599736673326896.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/UpperBounds14689107003577004183.gal -t CGAL -reachable-file /tmp/UpperBounds15620599736673326896.prop --nowitness
Loading property file /tmp/UpperBounds15620599736673326896.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,239794,2.28604,66536,1279,1558,51896,37575,528,323699,287,208697,0
Total reachable state count : 239794

Verifying 6 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-05 :0 <= u2.l2529 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-05 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-d2m05-UpperBounds-05,0,2.34047,66536,1,0,51896,37575,646,323699,329,208697,908
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-06 :0 <= u2.l2313 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-06 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-d2m05-UpperBounds-06,0,2.34119,66536,1,0,51896,37575,658,323699,334,208697,929
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-07 :0 <= i5.u0.p180 <= 1
FORMULA DBSingleClientW-PT-d2m05-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-d2m05-UpperBounds-07,0,2.34261,66536,1,0,51896,37575,682,323699,393,208697,1221
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-12 :0 <= i5.u10.p33 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-12 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-d2m05-UpperBounds-12,0,2.34372,66536,1,0,51896,37575,702,323699,406,208697,1352
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-14 :0 <= i5.u10.l1615 <= 1
FORMULA DBSingleClientW-PT-d2m05-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-d2m05-UpperBounds-14,0,2.34451,66536,1,0,51896,37575,722,323699,411,208697,1475
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m05-UpperBounds-15 :0 <= i4.u8.p164 <= 1
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-15 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-d2m05-UpperBounds-15,0,2.34484,66536,1,0,51896,37575,739,323699,427,208697,1499
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1654745730284

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

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