fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r312-tall-165472281800149
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for DBSingleClientW-PT-d0m06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
373.644 16400.00 24976.00 135.30 0 0 0 1 0 0 0 1 3 4 0 1 0 0 0 0 normal

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.r312-tall-165472281800149.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 itstools
Input is DBSingleClientW-PT-d0m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472281800149
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.0K Jun 7 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Jun 7 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 7 17:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Jun 7 17:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 6 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 6 15:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 8.1K Jun 7 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Jun 7 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 7 17:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 7 17:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:23 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 119K 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-d0m06-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654774426709

Running Version 202205111006
[2022-06-09 11:33:48] [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 11:33:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 11:33:48] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2022-06-09 11:33:48] [INFO ] Transformed 553 places.
[2022-06-09 11:33:48] [INFO ] Transformed 150 transitions.
[2022-06-09 11:33:48] [INFO ] Parsed PT model containing 553 places and 150 transitions in 203 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 150 rows 109 cols
[2022-06-09 11:33:48] [INFO ] Computed 6 place invariants in 23 ms
Incomplete random walk after 10000 steps, including 2308 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 974 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 1009 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 1011 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 954 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 1008 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 5) seen :2
// Phase 1: matrix 150 rows 109 cols
[2022-06-09 11:33:48] [INFO ] Computed 6 place invariants in 5 ms
[2022-06-09 11:33:48] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-06-09 11:33:48] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-09 11:33:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:48] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2022-06-09 11:33:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:33:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 11:33:48] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-09 11:33:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:48] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-06-09 11:33:48] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-06-09 11:33:48] [INFO ] [Nat]Added 74 Read/Feed constraints in 13 ms returned sat
[2022-06-09 11:33:49] [INFO ] Deduced a trap composed of 54 places in 66 ms of which 3 ms to minimize.
[2022-06-09 11:33:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2022-06-09 11:33:49] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 18 ms.
[2022-06-09 11:33:49] [INFO ] Added : 6 causal constraints over 2 iterations in 65 ms. Result :sat
Minimization took 25 ms.
[2022-06-09 11:33:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 11:33:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-09 11:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:49] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2022-06-09 11:33:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:33:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:49] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2022-06-09 11:33:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:49] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-06-09 11:33:49] [INFO ] [Nat]Added 74 Read/Feed constraints in 11 ms returned sat
[2022-06-09 11:33:49] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 15 ms.
[2022-06-09 11:33:49] [INFO ] Added : 6 causal constraints over 2 iterations in 58 ms. Result :sat
Minimization took 21 ms.
[2022-06-09 11:33:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 11:33:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-09 11:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:49] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-06-09 11:33:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:33:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 11:33:49] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-09 11:33:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:49] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2022-06-09 11:33:49] [INFO ] [Nat]Added 74 Read/Feed constraints in 8 ms returned sat
[2022-06-09 11:33:49] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 16 ms.
[2022-06-09 11:33:49] [INFO ] Added : 7 causal constraints over 2 iterations in 50 ms. Result :sat
Minimization took 45 ms.
[2022-06-09 11:33:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 11:33:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-09 11:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:49] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2022-06-09 11:33:49] [INFO ] [Real]Added 74 Read/Feed constraints in 11 ms returned sat
[2022-06-09 11:33:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:33:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:49] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2022-06-09 11:33:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:49] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-06-09 11:33:49] [INFO ] [Nat]Added 74 Read/Feed constraints in 9 ms returned sat
[2022-06-09 11:33:49] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 15 ms.
[2022-06-09 11:33:49] [INFO ] Added : 1 causal constraints over 1 iterations in 41 ms. Result :sat
Minimization took 19 ms.
[2022-06-09 11:33:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-06-09 11:33:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : [6, 6, 6, 6, 1] Max seen :[0, 0, 0, 1, 1]
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 102 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 102 transition count 139
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 34 place count 80 transition count 99
Iterating global reduction 1 with 22 rules applied. Total rules applied 56 place count 80 transition count 99
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 66 place count 70 transition count 89
Iterating global reduction 1 with 10 rules applied. Total rules applied 76 place count 70 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 78 place count 70 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 68 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 68 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 83 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 67 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 67 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 66 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 66 transition count 80
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 65 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 65 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 91 place count 65 transition count 77
Applied a total of 91 rules in 38 ms. Remains 65 /109 variables (removed 44) and now considering 77/150 (removed 73) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/109 places, 77/150 transitions.
// Phase 1: matrix 77 rows 65 cols
[2022-06-09 11:33:49] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229097 resets, run finished after 731 ms. (steps per millisecond=1367 ) properties (out of 4) seen :5
Incomplete Best-First random walk after 1000001 steps, including 101810 resets, run finished after 377 ms. (steps per millisecond=2652 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000001 steps, including 101948 resets, run finished after 443 ms. (steps per millisecond=2257 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 101287 resets, run finished after 374 ms. (steps per millisecond=2673 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000001 steps, including 99864 resets, run finished after 335 ms. (steps per millisecond=2985 ) properties (out of 4) seen :4
// Phase 1: matrix 77 rows 65 cols
[2022-06-09 11:33:52] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 11:33:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 11:33:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:52] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-06-09 11:33:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:33:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:33:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:52] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 11:33:52] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:33:52] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2022-06-09 11:33:52] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2022-06-09 11:33:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2022-06-09 11:33:52] [INFO ] Computed and/alt/rep : 23/48/23 causal constraints (skipped 53 transitions) in 7 ms.
[2022-06-09 11:33:52] [INFO ] Added : 10 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 11 ms.
[2022-06-09 11:33:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 11:33:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:52] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
[2022-06-09 11:33:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-09 11:33:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:52] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 11:33:52] [INFO ] [Real]Added 25 Read/Feed constraints in 3 ms returned sat
[2022-06-09 11:33:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:33:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2022-06-09 11:33:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:33:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:52] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-06-09 11:33:52] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2022-06-09 11:33:52] [INFO ] Computed and/alt/rep : 23/48/23 causal constraints (skipped 53 transitions) in 6 ms.
[2022-06-09 11:33:52] [INFO ] Added : 9 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 29 ms.
[2022-06-09 11:33:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:33:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:52] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-06-09 11:33:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:33:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:33:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:52] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-06-09 11:33:52] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2022-06-09 11:33:52] [INFO ] Computed and/alt/rep : 23/48/23 causal constraints (skipped 53 transitions) in 6 ms.
[2022-06-09 11:33:52] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [6, 1, 6, 6] Max seen :[0, 1, 1, 4]
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 77/77 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 77/77 transitions.
// Phase 1: matrix 77 rows 65 cols
[2022-06-09 11:33:52] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 228653 resets, run finished after 821 ms. (steps per millisecond=1218 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 101465 resets, run finished after 373 ms. (steps per millisecond=2680 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000000 steps, including 101702 resets, run finished after 384 ms. (steps per millisecond=2604 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 100095 resets, run finished after 356 ms. (steps per millisecond=2808 ) properties (out of 3) seen :4
// Phase 1: matrix 77 rows 65 cols
[2022-06-09 11:33:54] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:33:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 11:33:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:54] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-06-09 11:33:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:33:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 11:33:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:54] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 11:33:54] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:33:54] [INFO ] [Nat]Added 25 Read/Feed constraints in 2 ms returned sat
[2022-06-09 11:33:54] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2022-06-09 11:33:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2022-06-09 11:33:54] [INFO ] Computed and/alt/rep : 23/48/23 causal constraints (skipped 53 transitions) in 6 ms.
[2022-06-09 11:33:54] [INFO ] Added : 10 causal constraints over 4 iterations in 37 ms. Result :sat
Minimization took 10 ms.
[2022-06-09 11:33:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:54] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:33:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:54] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-06-09 11:33:54] [INFO ] [Real]Added 25 Read/Feed constraints in 2 ms returned sat
[2022-06-09 11:33:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:33:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:54] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:33:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:54] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 11:33:54] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2022-06-09 11:33:54] [INFO ] Computed and/alt/rep : 23/48/23 causal constraints (skipped 53 transitions) in 6 ms.
[2022-06-09 11:33:55] [INFO ] Added : 9 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 21 ms.
[2022-06-09 11:33:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:55] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-09 11:33:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:33:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:33:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:55] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-09 11:33:55] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2022-06-09 11:33:55] [INFO ] Computed and/alt/rep : 23/48/23 causal constraints (skipped 53 transitions) in 6 ms.
[2022-06-09 11:33:55] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [6, 6, 6] Max seen :[0, 1, 4]
Support contains 3 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 77/77 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 77/77 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 77/77 transitions.
Applied a total of 0 rules in 4 ms. Remains 65 /65 variables (removed 0) and now considering 77/77 (removed 0) transitions.
// Phase 1: matrix 77 rows 65 cols
[2022-06-09 11:33:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:33:55] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 77 rows 65 cols
[2022-06-09 11:33:55] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:33:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:33:55] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2022-06-09 11:33:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 77 rows 65 cols
[2022-06-09 11:33:55] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:33:55] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 65/65 places, 77/77 transitions.
Starting property specific reduction for DBSingleClientW-PT-d0m06-UpperBounds-03
// Phase 1: matrix 77 rows 65 cols
[2022-06-09 11:33:55] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2304 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1044 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
// Phase 1: matrix 77 rows 65 cols
[2022-06-09 11:33:55] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:33:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 11:33:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:55] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-06-09 11:33:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:33:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:33:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:55] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 11:33:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:33:55] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2022-06-09 11:33:55] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2022-06-09 11:33:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2022-06-09 11:33:55] [INFO ] Computed and/alt/rep : 23/48/23 causal constraints (skipped 53 transitions) in 7 ms.
[2022-06-09 11:33:55] [INFO ] Added : 10 causal constraints over 4 iterations in 49 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 77/77 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 76
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 62 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 62 transition count 74
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 61 transition count 71
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 61 transition count 71
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 60 transition count 70
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 59 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 59 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 59 transition count 67
Applied a total of 14 rules in 15 ms. Remains 59 /65 variables (removed 6) and now considering 67/77 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/65 places, 67/77 transitions.
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 11:33:55] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229521 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102238 resets, run finished after 323 ms. (steps per millisecond=3095 ) properties (out of 1) seen :0
// Phase 1: matrix 67 rows 59 cols
[2022-06-09 11:33:56] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:33:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:56] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for DBSingleClientW-PT-d0m06-UpperBounds-03 in 1221 ms.
Starting property specific reduction for DBSingleClientW-PT-d0m06-UpperBounds-08
// Phase 1: matrix 77 rows 65 cols
[2022-06-09 11:33:56] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1006 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 77 rows 65 cols
[2022-06-09 11:33:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:33:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:56] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-06-09 11:33:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:33:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 11:33:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:56] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-06-09 11:33:56] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:33:56] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2022-06-09 11:33:56] [INFO ] Computed and/alt/rep : 23/48/23 causal constraints (skipped 53 transitions) in 7 ms.
[2022-06-09 11:33:56] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2022-06-09 11:33:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-06-09 11:33:56] [INFO ] Added : 9 causal constraints over 3 iterations in 81 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 77/77 transitions.
Graph (complete) has 193 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 63 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 63 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 63 transition count 73
Applied a total of 6 rules in 9 ms. Remains 63 /65 variables (removed 2) and now considering 73/77 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/65 places, 73/77 transitions.
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:33:56] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229104 resets, run finished after 643 ms. (steps per millisecond=1555 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 101792 resets, run finished after 344 ms. (steps per millisecond=2906 ) properties (out of 1) seen :0
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:33:57] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:33:57] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:33:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:57] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-06-09 11:33:57] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:33:57] [INFO ] [Real]Added 21 Read/Feed constraints in 7 ms returned sat
[2022-06-09 11:33:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:33:57] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:33:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:57] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-09 11:33:57] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 11:33:57] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 5 ms.
[2022-06-09 11:33:58] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2022-06-09 11:33:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2022-06-09 11:33:58] [INFO ] Added : 9 causal constraints over 3 iterations in 79 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 5 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 73/73 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:33:58] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:33:58] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:33:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:33:58] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:33:58] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2022-06-09 11:33:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:33:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:33:58] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 73/73 transitions.
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:33:58] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229286 resets, run finished after 651 ms. (steps per millisecond=1536 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000000 steps, including 101446 resets, run finished after 318 ms. (steps per millisecond=3144 ) properties (out of 1) seen :0
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:33:59] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:33:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:59] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-06-09 11:33:59] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:33:59] [INFO ] [Real]Added 21 Read/Feed constraints in 7 ms returned sat
[2022-06-09 11:33:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:33:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-09 11:33:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:59] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-06-09 11:33:59] [INFO ] [Nat]Added 21 Read/Feed constraints in 3 ms returned sat
[2022-06-09 11:33:59] [INFO ] Computed and/alt/rep : 21/44/21 causal constraints (skipped 51 transitions) in 6 ms.
[2022-06-09 11:33:59] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2022-06-09 11:33:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2022-06-09 11:33:59] [INFO ] Added : 9 causal constraints over 3 iterations in 76 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 73/73 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 63/63 places, 73/73 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 73/73 (removed 0) transitions.
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:33:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:33:59] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:33:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:33:59] [INFO ] State equation strengthened by 21 read => feed constraints.
[2022-06-09 11:33:59] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2022-06-09 11:33:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 73 rows 63 cols
[2022-06-09 11:33:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:33:59] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/63 places, 73/73 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m06-UpperBounds-08 in 3058 ms.
Starting property specific reduction for DBSingleClientW-PT-d0m06-UpperBounds-09
// Phase 1: matrix 77 rows 65 cols
[2022-06-09 11:33:59] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 1009 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :3
// Phase 1: matrix 77 rows 65 cols
[2022-06-09 11:33:59] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:33:59] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2022-06-09 11:33:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:59] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-06-09 11:33:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:33:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 11:33:59] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 11:33:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:33:59] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-06-09 11:33:59] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-06-09 11:33:59] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2022-06-09 11:33:59] [INFO ] Computed and/alt/rep : 23/48/23 causal constraints (skipped 53 transitions) in 5 ms.
[2022-06-09 11:33:59] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[3]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 65/65 places, 77/77 transitions.
Graph (complete) has 193 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 64 transition count 75
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 62 transition count 73
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 62 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 62 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 10 place count 60 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 60 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 59 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 58 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 58 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 57 transition count 65
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 57 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 57 transition count 63
Applied a total of 20 rules in 19 ms. Remains 57 /65 variables (removed 8) and now considering 63/77 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/65 places, 63/77 transitions.
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 11:33:59] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229612 resets, run finished after 557 ms. (steps per millisecond=1795 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 101508 resets, run finished after 305 ms. (steps per millisecond=3278 ) properties (out of 1) seen :4
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 11:34:00] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:34:00] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:34:00] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-06-09 11:34:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:34:00] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:34:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:34:00] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-06-09 11:34:00] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 11:34:00] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2022-06-09 11:34:00] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 3 ms.
[2022-06-09 11:34:00] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 11:34:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:34:00] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 11:34:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:34:00] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 11:34:00] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2022-06-09 11:34:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 11:34:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:34:00] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 11:34:00] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229672 resets, run finished after 544 ms. (steps per millisecond=1838 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 101481 resets, run finished after 291 ms. (steps per millisecond=3436 ) properties (out of 1) seen :4
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 11:34:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:34:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 11:34:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 11:34:01] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-06-09 11:34:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 11:34:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 11:34:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 11:34:01] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-06-09 11:34:01] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 11:34:01] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2022-06-09 11:34:01] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 4 ms.
[2022-06-09 11:34:01] [INFO ] Added : 1 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 11:34:01] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 11:34:01] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 11:34:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 11:34:02] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 11:34:02] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2022-06-09 11:34:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 57 cols
[2022-06-09 11:34:02] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 11:34:02] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 57/57 places, 63/63 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m06-UpperBounds-09 in 2424 ms.
[2022-06-09 11:34:02] [INFO ] Flatten gal took : 33 ms
[2022-06-09 11:34:02] [INFO ] Applying decomposition
[2022-06-09 11:34:02] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10230040199651175242.txt' '-o' '/tmp/graph10230040199651175242.bin' '-w' '/tmp/graph10230040199651175242.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10230040199651175242.bin' '-l' '-1' '-v' '-w' '/tmp/graph10230040199651175242.weights' '-q' '0' '-e' '0.001'
[2022-06-09 11:34:02] [INFO ] Decomposing Gal with order
[2022-06-09 11:34:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 11:34:02] [INFO ] Removed a total of 72 redundant transitions.
[2022-06-09 11:34:02] [INFO ] Flatten gal took : 41 ms
[2022-06-09 11:34:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 6 ms.
[2022-06-09 11:34:02] [INFO ] Time to serialize gal into /tmp/UpperBounds7482141272851108774.gal : 4 ms
[2022-06-09 11:34:02] [INFO ] Time to serialize properties into /tmp/UpperBounds241479503970412717.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7482141272851108774.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds241479503970412717.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...273
Loading property file /tmp/UpperBounds241479503970412717.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,289386,0.531792,20796,595,350,25624,4301,243,71416,80,26973,0
Total reachable state count : 289386

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

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d0m06-UpperBounds-08,0,0.555293,20796,1,0,25624,4301,317,71416,101,26973,411
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DBSingleClientW-PT-d0m06-UpperBounds-09 :0 <= u10.l345 <= 4
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-09 4 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-d0m06-UpperBounds-09,0,0.559837,20796,1,0,25624,4301,341,71416,113,26973,586
Total runtime 14877 ms.

BK_STOP 1654774443109

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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-d0m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DBSingleClientW-PT-d0m06, 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 r312-tall-165472281800149"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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