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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 904K
-rw-r--r-- 1 mcc users 9.1K Jun 7 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 7 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 17:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 7 17:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 7 17:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Jun 7 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Jun 7 17:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 432K 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-d1m07-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654776974707

Running Version 202205111006
[2022-06-09 12:16:16] [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 12:16:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 12:16:16] [INFO ] Load time of PNML (sax parser for PT used): 238 ms
[2022-06-09 12:16:16] [INFO ] Transformed 1440 places.
[2022-06-09 12:16:16] [INFO ] Transformed 672 transitions.
[2022-06-09 12:16:16] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 354 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 12:16:17] [INFO ] Computed 6 place invariants in 40 ms
Incomplete random walk after 10000 steps, including 2278 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 962 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 944 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 942 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :1
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 12:16:17] [INFO ] Computed 6 place invariants in 18 ms
[2022-06-09 12:16:17] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-06-09 12:16:17] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2022-06-09 12:16:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:16:17] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2022-06-09 12:16:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:16:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 18 ms returned sat
[2022-06-09 12:16:17] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2022-06-09 12:16:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:16:18] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2022-06-09 12:16:18] [INFO ] State equation strengthened by 418 read => feed constraints.
[2022-06-09 12:16:18] [INFO ] [Nat]Added 418 Read/Feed constraints in 65 ms returned sat
[2022-06-09 12:16:18] [INFO ] Deduced a trap composed of 190 places in 218 ms of which 4 ms to minimize.
[2022-06-09 12:16:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2022-06-09 12:16:18] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 135 ms.
[2022-06-09 12:16:18] [INFO ] Added : 5 causal constraints over 1 iterations in 266 ms. Result :sat
Minimization took 79 ms.
[2022-06-09 12:16:18] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 12:16:18] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 12:16:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:16:19] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2022-06-09 12:16:19] [INFO ] [Real]Added 418 Read/Feed constraints in 103 ms returned sat
[2022-06-09 12:16:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:16:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 12:16:19] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-09 12:16:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:16:19] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2022-06-09 12:16:19] [INFO ] [Nat]Added 418 Read/Feed constraints in 54 ms returned sat
[2022-06-09 12:16:19] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 77 ms.
[2022-06-09 12:16:19] [INFO ] Added : 2 causal constraints over 1 iterations in 175 ms. Result :sat
Minimization took 165 ms.
[2022-06-09 12:16:19] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 12:16:19] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 12:16:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:16:20] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2022-06-09 12:16:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:16:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 12:16:20] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-09 12:16:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:16:20] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2022-06-09 12:16:20] [INFO ] [Nat]Added 418 Read/Feed constraints in 84 ms returned sat
[2022-06-09 12:16:20] [INFO ] Deduced a trap composed of 96 places in 234 ms of which 1 ms to minimize.
[2022-06-09 12:16:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 298 ms
[2022-06-09 12:16:20] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 70 ms.
[2022-06-09 12:16:20] [INFO ] Added : 4 causal constraints over 1 iterations in 185 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : [7, 3, 1428] Max seen :[0, 1, 0]
Support contains 3 out of 347 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 326 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.7 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 77 transitions
Reduce isomorphic transitions removed 85 transitions.
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 326 transition count 587
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 181 place count 231 transition count 330
Iterating global reduction 1 with 95 rules applied. Total rules applied 276 place count 231 transition count 330
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 280 place count 231 transition count 326
Discarding 73 places :
Symmetric choice reduction at 2 with 73 rule applications. Total rules 353 place count 158 transition count 253
Iterating global reduction 2 with 73 rules applied. Total rules applied 426 place count 158 transition count 253
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 432 place count 158 transition count 247
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 474 place count 116 transition count 179
Iterating global reduction 3 with 42 rules applied. Total rules applied 516 place count 116 transition count 179
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 539 place count 116 transition count 156
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 549 place count 106 transition count 140
Iterating global reduction 4 with 10 rules applied. Total rules applied 559 place count 106 transition count 140
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 561 place count 106 transition count 138
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 569 place count 98 transition count 130
Iterating global reduction 5 with 8 rules applied. Total rules applied 577 place count 98 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 578 place count 98 transition count 129
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 585 place count 91 transition count 122
Iterating global reduction 6 with 7 rules applied. Total rules applied 592 place count 91 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 595 place count 91 transition count 119
Applied a total of 595 rules in 104 ms. Remains 91 /347 variables (removed 256) and now considering 119/672 (removed 553) transitions.
Finished structural reductions, in 1 iterations. Remains : 91/347 places, 119/672 transitions.
// Phase 1: matrix 119 rows 91 cols
[2022-06-09 12:16:21] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229844 resets, run finished after 1034 ms. (steps per millisecond=967 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000000 steps, including 98729 resets, run finished after 502 ms. (steps per millisecond=1992 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 98799 resets, run finished after 470 ms. (steps per millisecond=2127 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 98275 resets, run finished after 497 ms. (steps per millisecond=2012 ) properties (out of 3) seen :2
// Phase 1: matrix 119 rows 91 cols
[2022-06-09 12:16:23] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:16:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 12:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:16:23] [INFO ] [Real]Absence check using state equation in 22 ms returned unsat
[2022-06-09 12:16:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:16:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:16:23] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-06-09 12:16:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:16:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 12:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:16:23] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-06-09 12:16:23] [INFO ] State equation strengthened by 44 read => feed constraints.
[2022-06-09 12:16:23] [INFO ] [Nat]Added 44 Read/Feed constraints in 10 ms returned sat
[2022-06-09 12:16:23] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2022-06-09 12:16:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2022-06-09 12:16:23] [INFO ] Computed and/alt/rep : 31/69/31 causal constraints (skipped 87 transitions) in 7 ms.
[2022-06-09 12:16:23] [INFO ] Added : 2 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 16 ms.
[2022-06-09 12:16:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:16:24] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 3, 1] Max seen :[1, 2, 1]
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 91/91 places, 119/119 transitions.
Graph (complete) has 281 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 90 transition count 117
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 87 transition count 108
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 87 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 86 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 86 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 85 transition count 106
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 85 transition count 106
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 85 transition count 105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 84 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 84 transition count 103
Applied a total of 16 rules in 14 ms. Remains 84 /91 variables (removed 7) and now considering 103/119 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/91 places, 103/119 transitions.
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:16:24] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229755 resets, run finished after 812 ms. (steps per millisecond=1231 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98415 resets, run finished after 403 ms. (steps per millisecond=2481 ) properties (out of 1) seen :1
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:16:25] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:16:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 12:16:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:16:25] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 12:16:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:16:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:16:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:16:25] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-09 12:16:25] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:16:25] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2022-06-09 12:16:25] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2022-06-09 12:16:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2022-06-09 12:16:25] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 72 transitions) in 7 ms.
[2022-06-09 12:16:25] [INFO ] Added : 2 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[2]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 103/103 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 103/103 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:16:25] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:16:25] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:16:25] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:16:25] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:16:25] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2022-06-09 12:16:25] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:16:25] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 12:16:25] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 103/103 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-08
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:16:25] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2320 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 987 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :1
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:16:25] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:16:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:16:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:16:25] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 12:16:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:16:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:16:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:16:25] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-06-09 12:16:25] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:16:25] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2022-06-09 12:16:25] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 72 transitions) in 5 ms.
[2022-06-09 12:16:25] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 103/103 transitions.
Applied a total of 0 rules in 8 ms. Remains 84 /84 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 103/103 transitions.
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:16:25] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 230008 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98965 resets, run finished after 403 ms. (steps per millisecond=2481 ) properties (out of 1) seen :2
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:16:27] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 12:16:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:16:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:16:27] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-06-09 12:16:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:16:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-09 12:16:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:16:27] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-09 12:16:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:16:27] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2022-06-09 12:16:27] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2022-06-09 12:16:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-06-09 12:16:27] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 72 transitions) in 6 ms.
[2022-06-09 12:16:27] [INFO ] Added : 2 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 103/103 transitions.
Applied a total of 0 rules in 6 ms. Remains 84 /84 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 103/103 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:16:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:16:27] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:16:27] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:16:27] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:16:27] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2022-06-09 12:16:27] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:16:27] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:16:27] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 103/103 transitions.
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:16:27] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229642 resets, run finished after 809 ms. (steps per millisecond=1236 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 98156 resets, run finished after 405 ms. (steps per millisecond=2469 ) properties (out of 1) seen :1
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:16:28] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 12:16:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:16:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:16:28] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 12:16:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:16:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:16:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:16:28] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 12:16:28] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:16:28] [INFO ] [Nat]Added 30 Read/Feed constraints in 4 ms returned sat
[2022-06-09 12:16:29] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 0 ms to minimize.
[2022-06-09 12:16:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2022-06-09 12:16:29] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 72 transitions) in 6 ms.
[2022-06-09 12:16:29] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 103/103 transitions.
Applied a total of 0 rules in 7 ms. Remains 84 /84 variables (removed 0) and now considering 103/103 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 103/103 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 84/84 places, 103/103 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 103/103 (removed 0) transitions.
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:16:29] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:16:29] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:16:29] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:16:29] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:16:29] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2022-06-09 12:16:29] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 103 rows 84 cols
[2022-06-09 12:16:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:16:29] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/84 places, 103/103 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-08 in 3572 ms.
[2022-06-09 12:16:29] [INFO ] Flatten gal took : 37 ms
[2022-06-09 12:16:29] [INFO ] Applying decomposition
[2022-06-09 12:16:29] [INFO ] Flatten gal took : 13 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/graph3344292413324038723.txt' '-o' '/tmp/graph3344292413324038723.bin' '-w' '/tmp/graph3344292413324038723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3344292413324038723.bin' '-l' '-1' '-v' '-w' '/tmp/graph3344292413324038723.weights' '-q' '0' '-e' '0.001'
[2022-06-09 12:16:29] [INFO ] Decomposing Gal with order
[2022-06-09 12:16:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 12:16:29] [INFO ] Removed a total of 88 redundant transitions.
[2022-06-09 12:16:29] [INFO ] Flatten gal took : 44 ms
[2022-06-09 12:16:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 9 ms.
[2022-06-09 12:16:29] [INFO ] Time to serialize gal into /tmp/UpperBounds4428114947744637455.gal : 5 ms
[2022-06-09 12:16:29] [INFO ] Time to serialize properties into /tmp/UpperBounds11569290731047846979.prop : 1 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/UpperBounds4428114947744637455.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11569290731047846979.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...275
Loading property file /tmp/UpperBounds11569290731047846979.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.00878e+06,6.31773,145112,1769,758,135990,31491,363,979231,143,200331,0
Total reachable state count : 3008782

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 3
Bounds property DBSingleClientW-PT-d1m07-UpperBounds-08 :0 <= i3.u0.l965 <= 3
FORMULA DBSingleClientW-PT-d1m07-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-d1m07-UpperBounds-08,0,6.48976,145112,1,0,135990,31491,452,979231,170,200331,1829
Total runtime 19661 ms.

BK_STOP 1654776996261

--------------------
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
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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-d1m07"
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-d1m07, 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-165472281900213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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