Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r064-tall-162038397500659.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DNAwalker-PT-17redondantChoiceL, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038397500659
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 22 17:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 17:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 19 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 211K May 5 16:51 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 DNAwalker-PT-17redondantChoiceL-UpperBounds-00
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-01
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-02
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-03
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-04
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-05
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-06
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-07
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-08
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-09
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-10
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-11
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-12
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-13
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-14
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620549363219

Running Version 0
[2021-05-09 08:36:04] [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]
[2021-05-09 08:36:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 08:36:04] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2021-05-09 08:36:04] [INFO ] Transformed 43 places.
[2021-05-09 08:36:04] [INFO ] Transformed 490 transitions.
[2021-05-09 08:36:04] [INFO ] Parsed PT model containing 43 places and 490 transitions in 112 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 489 out of 490 initially.
// Phase 1: matrix 489 rows 43 cols
[2021-05-09 08:36:04] [INFO ] Computed 0 place invariants in 15 ms
Incomplete random walk after 10000 steps, including 379 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :26
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :27
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :27
[2021-05-09 08:36:05] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2021-05-09 08:36:05] [INFO ] Computed 0 place invariants in 14 ms
[2021-05-09 08:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:05] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2021-05-09 08:36:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:08] [INFO ] [Nat]Absence check using state equation in 2903 ms returned unsat
[2021-05-09 08:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:08] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-09 08:36:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:13] [INFO ] [Nat]Absence check using state equation in 4992 ms returned unknown
[2021-05-09 08:36:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:13] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-09 08:36:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:36:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:18] [INFO ] [Nat]Absence check using state equation in 4993 ms returned unknown
[2021-05-09 08:36:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:18] [INFO ] [Real]Absence check using state equation in 48 ms returned unsat
[2021-05-09 08:36:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:18] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-09 08:36:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:36:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:23] [INFO ] [Nat]Absence check using state equation in 4993 ms returned unknown
[2021-05-09 08:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:23] [INFO ] [Real]Absence check using state equation in 51 ms returned unsat
[2021-05-09 08:36:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:23] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2021-05-09 08:36:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:36:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:28] [INFO ] [Nat]Absence check using state equation in 4949 ms returned unsat
[2021-05-09 08:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:28] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2021-05-09 08:36:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:36:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:33] [INFO ] [Nat]Absence check using state equation in 4996 ms returned unknown
[2021-05-09 08:36:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:33] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-09 08:36:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:36:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:38] [INFO ] [Nat]Absence check using state equation in 4995 ms returned unknown
[2021-05-09 08:36:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:38] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2021-05-09 08:36:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:36:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:43] [INFO ] [Nat]Absence check using state equation in 4993 ms returned unknown
[2021-05-09 08:36:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:44] [INFO ] [Real]Absence check using state equation in 48 ms returned unsat
[2021-05-09 08:36:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:44] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2021-05-09 08:36:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:36:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:47] [INFO ] [Nat]Absence check using state equation in 3003 ms returned unsat
[2021-05-09 08:36:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:47] [INFO ] [Real]Absence check using state equation in 52 ms returned unsat
[2021-05-09 08:36:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:47] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2021-05-09 08:36:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:36:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:52] [INFO ] [Nat]Absence check using state equation in 4994 ms returned unknown
[2021-05-09 08:36:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:52] [INFO ] [Real]Absence check using state equation in 44 ms returned unsat
[2021-05-09 08:36:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:52] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2021-05-09 08:36:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:36:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:36:56] [INFO ] [Nat]Absence check using state equation in 3865 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, -1, -1, 1, -1, 1, 2, -1, -1, -1, 1, 2, 1, -1, 1, 2] Max seen :[2, 2, 2, 1, 2, 1, 2, 2, 2, 2, 1, 2, 1, 2, 1, 2]
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 7 out of 43 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 43/43 places, 490/490 transitions.
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 43 transition count 478
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 42 transition count 477
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 41 transition count 476
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 40 transition count 475
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 39 transition count 474
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 38 transition count 473
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 37 transition count 472
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 36 transition count 471
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 35 transition count 470
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 34 transition count 469
Applied a total of 21 rules in 109 ms. Remains 34 /43 variables (removed 9) and now considering 469/490 (removed 21) transitions.
// Phase 1: matrix 469 rows 34 cols
[2021-05-09 08:36:56] [INFO ] Computed 0 place invariants in 7 ms
[2021-05-09 08:36:56] [INFO ] Dead Transitions using invariants and state equation in 156 ms returned []
Finished structural reductions, in 1 iterations. Remains : 34/43 places, 469/490 transitions.
// Phase 1: matrix 469 rows 34 cols
[2021-05-09 08:36:56] [INFO ] Computed 0 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 50471 resets, run finished after 5628 ms. (steps per millisecond=177 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 8103 resets, run finished after 965 ms. (steps per millisecond=1036 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 4744 resets, run finished after 965 ms. (steps per millisecond=1036 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 4842 resets, run finished after 977 ms. (steps per millisecond=1023 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000000 steps, including 4722 resets, run finished after 965 ms. (steps per millisecond=1036 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 8078 resets, run finished after 965 ms. (steps per millisecond=1036 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 4708 resets, run finished after 957 ms. (steps per millisecond=1044 ) properties (out of 7) seen :14
Incomplete Best-First random walk after 1000001 steps, including 4842 resets, run finished after 967 ms. (steps per millisecond=1034 ) properties (out of 7) seen :14
// Phase 1: matrix 469 rows 34 cols
[2021-05-09 08:37:08] [INFO ] Computed 0 place invariants in 9 ms
[2021-05-09 08:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:09] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-09 08:37:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:37:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:10] [INFO ] [Nat]Absence check using state equation in 1751 ms returned unsat
[2021-05-09 08:37:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:10] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-09 08:37:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:37:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:13] [INFO ] [Nat]Absence check using state equation in 3056 ms returned unsat
[2021-05-09 08:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:13] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-09 08:37:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:37:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:16] [INFO ] [Nat]Absence check using state equation in 2193 ms returned unsat
[2021-05-09 08:37:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:16] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-09 08:37:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:37:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:18] [INFO ] [Nat]Absence check using state equation in 1954 ms returned unsat
[2021-05-09 08:37:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:18] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2021-05-09 08:37:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:37:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:23] [INFO ] [Nat]Absence check using state equation in 5345 ms returned unsat
[2021-05-09 08:37:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:23] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2021-05-09 08:37:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:37:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:29] [INFO ] [Nat]Absence check using state equation in 6062 ms returned unknown
[2021-05-09 08:37:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:29] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-09 08:37:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:37:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:32] [INFO ] [Nat]Absence check using state equation in 3001 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 2, 2, 2, 2, -1, 2] Max seen :[2, 2, 2, 2, 2, 2, 2]
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-13 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-07 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 34/34 places, 469/469 transitions.
Graph (complete) has 469 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 32 transition count 457
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 31 transition count 456
Applied a total of 14 rules in 20 ms. Remains 31 /34 variables (removed 3) and now considering 456/469 (removed 13) transitions.
Finished structural reductions, in 1 iterations. Remains : 31/34 places, 456/469 transitions.
// Phase 1: matrix 456 rows 31 cols
[2021-05-09 08:37:32] [INFO ] Computed 0 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 36200 resets, run finished after 5206 ms. (steps per millisecond=192 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4009 resets, run finished after 953 ms. (steps per millisecond=1049 ) properties (out of 1) seen :2
// Phase 1: matrix 456 rows 31 cols
[2021-05-09 08:37:39] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-09 08:37:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:39] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2021-05-09 08:37:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:37:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:45] [INFO ] [Nat]Absence check using state equation in 6076 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 456/456 transitions.
Applied a total of 0 rules in 7 ms. Remains 31 /31 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 456/456 transitions.
Starting structural reductions, iteration 0 : 31/31 places, 456/456 transitions.
Applied a total of 0 rules in 8 ms. Remains 31 /31 variables (removed 0) and now considering 456/456 (removed 0) transitions.
// Phase 1: matrix 456 rows 31 cols
[2021-05-09 08:37:45] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 08:37:45] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 456 rows 31 cols
[2021-05-09 08:37:45] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 08:37:45] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2021-05-09 08:37:45] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 456 rows 31 cols
[2021-05-09 08:37:45] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 08:37:45] [INFO ] Dead Transitions using invariants and state equation in 126 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 456/456 transitions.
Starting property specific reduction for DNAwalker-PT-17redondantChoiceL-UpperBounds-09
// Phase 1: matrix 456 rows 31 cols
[2021-05-09 08:37:45] [INFO ] Computed 0 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 363 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :2
// Phase 1: matrix 456 rows 31 cols
[2021-05-09 08:37:45] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-09 08:37:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:45] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2021-05-09 08:37:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:37:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:50] [INFO ] [Nat]Absence check using state equation in 4994 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 456/456 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 456/456 (removed 0) transitions.
// Phase 1: matrix 456 rows 31 cols
[2021-05-09 08:37:51] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-09 08:37:51] [INFO ] Dead Transitions using invariants and state equation in 126 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 456/456 transitions.
// Phase 1: matrix 456 rows 31 cols
[2021-05-09 08:37:51] [INFO ] Computed 0 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 36232 resets, run finished after 5121 ms. (steps per millisecond=195 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4010 resets, run finished after 944 ms. (steps per millisecond=1059 ) properties (out of 1) seen :2
// Phase 1: matrix 456 rows 31 cols
[2021-05-09 08:37:57] [INFO ] Computed 0 place invariants in 6 ms
[2021-05-09 08:37:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 08:37:57] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2021-05-09 08:37:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 08:37:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 08:38:03] [INFO ] [Nat]Absence check using state equation in 6073 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 31 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 31/31 places, 456/456 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 456/456 transitions.
Starting structural reductions, iteration 0 : 31/31 places, 456/456 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 456/456 (removed 0) transitions.
// Phase 1: matrix 456 rows 31 cols
[2021-05-09 08:38:03] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 08:38:03] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 456 rows 31 cols
[2021-05-09 08:38:03] [INFO ] Computed 0 place invariants in 7 ms
[2021-05-09 08:38:03] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2021-05-09 08:38:03] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 456 rows 31 cols
[2021-05-09 08:38:03] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-09 08:38:03] [INFO ] Dead Transitions using invariants and state equation in 124 ms returned []
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 456/456 transitions.
Ending property specific reduction for DNAwalker-PT-17redondantChoiceL-UpperBounds-09 in 18135 ms.
[2021-05-09 08:38:04] [INFO ] Flatten gal took : 57 ms
[2021-05-09 08:38:04] [INFO ] Applying decomposition
[2021-05-09 08:38:04] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15253761053490934288.txt, -o, /tmp/graph15253761053490934288.bin, -w, /tmp/graph15253761053490934288.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15253761053490934288.bin, -l, -1, -v, -w, /tmp/graph15253761053490934288.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 08:38:04] [INFO ] Decomposing Gal with order
[2021-05-09 08:38:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 08:38:04] [INFO ] Removed a total of 850 redundant transitions.
[2021-05-09 08:38:04] [INFO ] Flatten gal took : 61 ms
[2021-05-09 08:38:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-09 08:38:04] [INFO ] Time to serialize gal into /tmp/UpperBounds12101127577462321120.gal : 6 ms
[2021-05-09 08:38:04] [INFO ] Time to serialize properties into /tmp/UpperBounds17102913995475049388.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds12101127577462321120.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17102913995475049388.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds12101127577462321120.gal -t CGAL -reachable-file /tmp/UpperBounds17102913995475049388.prop --nowitness
Loading property file /tmp/UpperBounds17102913995475049388.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,1.46555e+10,38.4349,1098040,17286,5,1.93361e+06,262,525,3.94148e+06,7,241,0
Total reachable state count : 14655455288

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property DNAwalker-PT-17redondantChoiceL-UpperBounds-09 :0 <= u2.A3 <= 2
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-09 2 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
DNAwalker-PT-17redondantChoiceL-UpperBounds-09,0,39.0153,1098040,1,0,1.93361e+06,262,711,3.94148e+06,15,241,662
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1620549524489

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DNAwalker-PT-17redondantChoiceL"
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 DNAwalker-PT-17redondantChoiceL, 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 r064-tall-162038397500659"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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