Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r127-tall-167814504400126.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
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 r127-tall-167814504400126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 8.6K Feb 25 13:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 25 13:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 13:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 13:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 13:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 192K Feb 25 13:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Feb 25 13:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 19 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 211K Mar 5 18:22 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 1678175441453

Running Version 202205111006
[2023-03-07 07:50:42] [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]
[2023-03-07 07:50:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-07 07:50:42] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2023-03-07 07:50:42] [INFO ] Transformed 43 places.
[2023-03-07 07:50:42] [INFO ] Transformed 490 transitions.
[2023-03-07 07:50:42] [INFO ] Parsed PT model containing 43 places and 490 transitions in 211 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
Normalized transition count is 489 out of 490 initially.
// Phase 1: matrix 489 rows 43 cols
[2023-03-07 07:50:42] [INFO ] Computed 0 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 380 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :31
[2023-03-07 07:50:43] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2023-03-07 07:50:43] [INFO ] Computed 0 place invariants in 6 ms
[2023-03-07 07:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:50:43] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2023-03-07 07:50:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:50:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:50:47] [INFO ] [Nat]Absence check using state equation in 3697 ms returned unsat
[2023-03-07 07:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:50:47] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-07 07:50:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:50:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:50:52] [INFO ] [Nat]Absence check using state equation in 4985 ms returned unknown
[2023-03-07 07:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:50:52] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-07 07:50:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:50:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:50:57] [INFO ] [Nat]Absence check using state equation in 4980 ms returned unknown
[2023-03-07 07:50:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:50:57] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-07 07:50:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:50:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:01] [INFO ] [Nat]Absence check using state equation in 4028 ms returned unsat
[2023-03-07 07:51:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:01] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2023-03-07 07:51:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:51:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:06] [INFO ] [Nat]Absence check using state equation in 4996 ms returned unknown
[2023-03-07 07:51:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:06] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-07 07:51:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:51:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:11] [INFO ] [Nat]Absence check using state equation in 4986 ms returned unknown
[2023-03-07 07:51:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:11] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-07 07:51:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:51:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:16] [INFO ] [Nat]Absence check using state equation in 4987 ms returned unknown
[2023-03-07 07:51:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:17] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2023-03-07 07:51:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:51:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:22] [INFO ] [Nat]Absence check using state equation in 4987 ms returned unknown
[2023-03-07 07:51:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:22] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-07 07:51:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:51:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:24] [INFO ] [Nat]Absence check using state equation in 2733 ms returned unsat
[2023-03-07 07:51:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:25] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-07 07:51:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:51:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:30] [INFO ] [Nat]Absence check using state equation in 4983 ms returned unknown
[2023-03-07 07:51:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:30] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-07 07:51:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:51:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:35] [INFO ] [Nat]Absence check using state equation in 4987 ms returned unknown
[2023-03-07 07:51:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:35] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-07 07:51:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:51:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:37] [INFO ] [Nat]Absence check using state equation in 2259 ms returned unsat
[2023-03-07 07:51:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:37] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-07 07:51:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:51:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:42] [INFO ] [Nat]Absence check using state equation in 4982 ms returned unknown
[2023-03-07 07:51:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:42] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-07 07:51:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:51:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:47] [INFO ] [Nat]Absence check using state equation in 4983 ms returned unknown
[2023-03-07 07:51:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:47] [INFO ] [Real]Absence check using state equation in 60 ms returned unsat
[2023-03-07 07:51:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:47] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-07 07:51:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:51:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:51:52] [INFO ] [Nat]Absence check using state equation in 4985 ms returned unknown
Current structural bounds on expressions (after SMT) : [2, -1, -1, 2, -1, -1, -1, -1, 2, -1, -1, 2, -1, -1, 1, -1] Max seen :[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2]
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-14 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-08 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 11 out of 43 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, 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 7 places and 7 transitions.
Iterating global reduction 1 with 7 rules applied. Total rules applied 19 place count 36 transition count 471
Applied a total of 19 rules in 51 ms. Remains 36 /43 variables (removed 7) and now considering 471/490 (removed 19) transitions.
// Phase 1: matrix 471 rows 36 cols
[2023-03-07 07:51:52] [INFO ] Computed 0 place invariants in 9 ms
[2023-03-07 07:51:53] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/43 places, 471/490 transitions.
// Phase 1: matrix 471 rows 36 cols
[2023-03-07 07:51:53] [INFO ] Computed 0 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 45908 resets, run finished after 4584 ms. (steps per millisecond=218 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000001 steps, including 3760 resets, run finished after 796 ms. (steps per millisecond=1256 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000000 steps, including 4260 resets, run finished after 831 ms. (steps per millisecond=1203 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000001 steps, including 4053 resets, run finished after 815 ms. (steps per millisecond=1226 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000001 steps, including 4464 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000001 steps, including 3943 resets, run finished after 804 ms. (steps per millisecond=1243 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000001 steps, including 4318 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000001 steps, including 4062 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000000 steps, including 6932 resets, run finished after 815 ms. (steps per millisecond=1226 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000001 steps, including 4202 resets, run finished after 810 ms. (steps per millisecond=1234 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000001 steps, including 6685 resets, run finished after 803 ms. (steps per millisecond=1245 ) properties (out of 11) seen :22
Incomplete Best-First random walk after 1000001 steps, including 3951 resets, run finished after 775 ms. (steps per millisecond=1290 ) properties (out of 11) seen :22
// Phase 1: matrix 471 rows 36 cols
[2023-03-07 07:52:06] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-07 07:52:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:06] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-07 07:52:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:52:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:12] [INFO ] [Nat]Absence check using state equation in 6072 ms returned unknown
[2023-03-07 07:52:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:12] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-07 07:52:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:52:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:19] [INFO ] [Nat]Absence check using state equation in 6077 ms returned unknown
[2023-03-07 07:52:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:19] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-07 07:52:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:52:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:20] [INFO ] [Nat]Absence check using state equation in 1784 ms returned unsat
[2023-03-07 07:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:20] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-07 07:52:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:52:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:27] [INFO ] [Nat]Absence check using state equation in 6067 ms returned unknown
[2023-03-07 07:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:27] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-07 07:52:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:28] [INFO ] [Nat]Absence check using state equation in 1519 ms returned unsat
[2023-03-07 07:52:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:28] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-07 07:52:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:52:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:34] [INFO ] [Nat]Absence check using state equation in 6077 ms returned unknown
[2023-03-07 07:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:34] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-07 07:52:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:52:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:41] [INFO ] [Nat]Absence check using state equation in 6067 ms returned unknown
[2023-03-07 07:52:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:41] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-07 07:52:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:52:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:45] [INFO ] [Nat]Absence check using state equation in 4224 ms returned unknown
[2023-03-07 07:52:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:45] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-07 07:52:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:52:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:51] [INFO ] [Nat]Absence check using state equation in 6075 ms returned unknown
[2023-03-07 07:52:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:51] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-07 07:52:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:52:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:55] [INFO ] [Nat]Absence check using state equation in 4215 ms returned unknown
[2023-03-07 07:52:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:52:55] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-07 07:52:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:52:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:02] [INFO ] [Nat]Absence check using state equation in 6077 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, -1, 2, -1, 2, -1, -1, -1, -1, -1, -1] Max seen :[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2]
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-06 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 9 out of 36 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 36/36 places, 471/471 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 35 transition count 470
Applied a total of 1 rules in 20 ms. Remains 35 /36 variables (removed 1) and now considering 470/471 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 35/36 places, 470/471 transitions.
// Phase 1: matrix 470 rows 35 cols
[2023-03-07 07:53:02] [INFO ] Computed 0 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 47958 resets, run finished after 4341 ms. (steps per millisecond=230 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4106 resets, run finished after 793 ms. (steps per millisecond=1261 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4530 resets, run finished after 796 ms. (steps per millisecond=1256 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4653 resets, run finished after 801 ms. (steps per millisecond=1248 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000000 steps, including 4531 resets, run finished after 787 ms. (steps per millisecond=1270 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000000 steps, including 4342 resets, run finished after 785 ms. (steps per millisecond=1273 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 7373 resets, run finished after 791 ms. (steps per millisecond=1264 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4482 resets, run finished after 792 ms. (steps per millisecond=1262 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 7016 resets, run finished after 787 ms. (steps per millisecond=1270 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 1000001 steps, including 4242 resets, run finished after 769 ms. (steps per millisecond=1300 ) properties (out of 9) seen :18
// Phase 1: matrix 470 rows 35 cols
[2023-03-07 07:53:13] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-07 07:53:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:13] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-07 07:53:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:53:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:14] [INFO ] [Nat]Absence check using state equation in 1348 ms returned unsat
[2023-03-07 07:53:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:15] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-07 07:53:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:53:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:16] [INFO ] [Nat]Absence check using state equation in 1392 ms returned unsat
[2023-03-07 07:53:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:16] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-07 07:53:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:53:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:17] [INFO ] [Nat]Absence check using state equation in 1239 ms returned unsat
[2023-03-07 07:53:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:17] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-07 07:53:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:53:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:20] [INFO ] [Nat]Absence check using state equation in 2127 ms returned unsat
[2023-03-07 07:53:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:20] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-07 07:53:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:53:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:26] [INFO ] [Nat]Absence check using state equation in 6072 ms returned unknown
[2023-03-07 07:53:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:26] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-07 07:53:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:53:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:32] [INFO ] [Nat]Absence check using state equation in 6062 ms returned unknown
[2023-03-07 07:53:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:32] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-07 07:53:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:53:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:34] [INFO ] [Nat]Absence check using state equation in 2192 ms returned unsat
[2023-03-07 07:53:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:34] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-07 07:53:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:53:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:37] [INFO ] [Nat]Absence check using state equation in 3137 ms returned unknown
[2023-03-07 07:53:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:38] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-07 07:53:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:53:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:39] [INFO ] [Nat]Absence check using state equation in 1298 ms returned unsat
Current structural bounds on expressions (after SMT) : [2, 2, 2, 2, -1, -1, 2, -1, 2] Max seen :[2, 2, 2, 2, 2, 2, 2, 2, 2]
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-15 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-12 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-05 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 3 out of 35 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 35/35 places, 470/470 transitions.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 33 transition count 468
Applied a total of 2 rules in 25 ms. Remains 33 /35 variables (removed 2) and now considering 468/470 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 33/35 places, 468/470 transitions.
// Phase 1: matrix 468 rows 33 cols
[2023-03-07 07:53:39] [INFO ] Computed 0 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 52863 resets, run finished after 4182 ms. (steps per millisecond=239 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 5099 resets, run finished after 773 ms. (steps per millisecond=1293 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 8689 resets, run finished after 774 ms. (steps per millisecond=1291 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 8726 resets, run finished after 786 ms. (steps per millisecond=1272 ) properties (out of 3) seen :6
// Phase 1: matrix 468 rows 33 cols
[2023-03-07 07:53:45] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-07 07:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:46] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-07 07:53:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:53:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:52] [INFO ] [Nat]Absence check using state equation in 6061 ms returned unknown
[2023-03-07 07:53:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:52] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-07 07:53:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:53:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:56] [INFO ] [Nat]Absence check using state equation in 4673 ms returned unknown
[2023-03-07 07:53:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:53:56] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-07 07:53:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:53:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:54:01] [INFO ] [Nat]Absence check using state equation in 4707 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1, -1, -1] Max seen :[2, 2, 2]
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 33/33 places, 468/468 transitions.
Applied a total of 0 rules in 14 ms. Remains 33 /33 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 468/468 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 33/33 places, 468/468 transitions.
Applied a total of 0 rules in 6 ms. Remains 33 /33 variables (removed 0) and now considering 468/468 (removed 0) transitions.
// Phase 1: matrix 468 rows 33 cols
[2023-03-07 07:54:01] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-07 07:54:01] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 468 rows 33 cols
[2023-03-07 07:54:01] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 07:54:02] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2023-03-07 07:54:02] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 468 rows 33 cols
[2023-03-07 07:54:02] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 07:54:02] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 468/468 transitions.
Starting property specific reduction for DNAwalker-PT-17redondantChoiceL-UpperBounds-09
// Phase 1: matrix 468 rows 33 cols
[2023-03-07 07:54:02] [INFO ] Computed 0 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 531 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :2
// Phase 1: matrix 468 rows 33 cols
[2023-03-07 07:54:02] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-07 07:54:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:54:02] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-07 07:54:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:54:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:54:07] [INFO ] [Nat]Absence check using state equation in 4985 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 33/33 places, 468/468 transitions.
Graph (complete) has 468 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 32 transition count 462
Applied a total of 7 rules in 12 ms. Remains 32 /33 variables (removed 1) and now considering 462/468 (removed 6) transitions.
// Phase 1: matrix 462 rows 32 cols
[2023-03-07 07:54:07] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-07 07:54:07] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32/33 places, 462/468 transitions.
// Phase 1: matrix 462 rows 32 cols
[2023-03-07 07:54:07] [INFO ] Computed 0 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 44494 resets, run finished after 4245 ms. (steps per millisecond=235 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4675 resets, run finished after 764 ms. (steps per millisecond=1308 ) properties (out of 1) seen :2
// Phase 1: matrix 462 rows 32 cols
[2023-03-07 07:54:12] [INFO ] Computed 0 place invariants in 8 ms
[2023-03-07 07:54:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:54:12] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-07 07:54:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:54:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:54:18] [INFO ] [Nat]Absence check using state equation in 6062 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32/32 places, 462/462 transitions.
Applied a total of 0 rules in 5 ms. Remains 32 /32 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 32/32 places, 462/462 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 32/32 places, 462/462 transitions.
Applied a total of 0 rules in 7 ms. Remains 32 /32 variables (removed 0) and now considering 462/462 (removed 0) transitions.
// Phase 1: matrix 462 rows 32 cols
[2023-03-07 07:54:18] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 07:54:18] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 462 rows 32 cols
[2023-03-07 07:54:18] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 07:54:19] [INFO ] Implicit Places using invariants and state equation in 482 ms returned [31]
Discarding 1 places :
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Implicit Place search using SMT with State Equation took 538 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 31/32 places, 457/462 transitions.
Applied a total of 0 rules in 8 ms. Remains 31 /31 variables (removed 0) and now considering 457/457 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/32 places, 457/462 transitions.
// Phase 1: matrix 457 rows 31 cols
[2023-03-07 07:54:19] [INFO ] Computed 0 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 37611 resets, run finished after 3955 ms. (steps per millisecond=252 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 4224 resets, run finished after 755 ms. (steps per millisecond=1324 ) properties (out of 1) seen :2
// Phase 1: matrix 457 rows 31 cols
[2023-03-07 07:54:24] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-07 07:54:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:54:24] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-07 07:54:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:54:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:54:30] [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 in SAFETY mode, iteration 0 : 31/31 places, 457/457 transitions.
Applied a total of 0 rules in 11 ms. Remains 31 /31 variables (removed 0) and now considering 457/457 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 457/457 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 31/31 places, 457/457 transitions.
Applied a total of 0 rules in 5 ms. Remains 31 /31 variables (removed 0) and now considering 457/457 (removed 0) transitions.
// Phase 1: matrix 457 rows 31 cols
[2023-03-07 07:54:30] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 07:54:30] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 457 rows 31 cols
[2023-03-07 07:54:30] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-07 07:54:30] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 566 ms to find 0 implicit places.
[2023-03-07 07:54:30] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 457 rows 31 cols
[2023-03-07 07:54:30] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 07:54:31] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/31 places, 457/457 transitions.
Ending property specific reduction for DNAwalker-PT-17redondantChoiceL-UpperBounds-09 in 28688 ms.
Starting property specific reduction for DNAwalker-PT-17redondantChoiceL-UpperBounds-10
// Phase 1: matrix 468 rows 33 cols
[2023-03-07 07:54:31] [INFO ] Computed 0 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 527 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :2
// Phase 1: matrix 468 rows 33 cols
[2023-03-07 07:54:31] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-07 07:54:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:54:31] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-07 07:54:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:54:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:54:35] [INFO ] [Nat]Absence check using state equation in 4707 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 33/33 places, 468/468 transitions.
Graph (complete) has 468 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 32 transition count 462
Applied a total of 7 rules in 12 ms. Remains 32 /33 variables (removed 1) and now considering 462/468 (removed 6) transitions.
// Phase 1: matrix 462 rows 32 cols
[2023-03-07 07:54:36] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 07:54:36] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32/33 places, 462/468 transitions.
// Phase 1: matrix 462 rows 32 cols
[2023-03-07 07:54:36] [INFO ] Computed 0 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 44564 resets, run finished after 4104 ms. (steps per millisecond=243 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 8335 resets, run finished after 771 ms. (steps per millisecond=1297 ) properties (out of 1) seen :2
// Phase 1: matrix 462 rows 32 cols
[2023-03-07 07:54:41] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-07 07:54:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:54:41] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-07 07:54:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:54:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:54:44] [INFO ] [Nat]Absence check using state equation in 3027 ms returned unsat
Current structural bounds on expressions (after SMT) : [2] Max seen :[2]
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for DNAwalker-PT-17redondantChoiceL-UpperBounds-10 in 13079 ms.
Starting property specific reduction for DNAwalker-PT-17redondantChoiceL-UpperBounds-13
// Phase 1: matrix 468 rows 33 cols
[2023-03-07 07:54:44] [INFO ] Computed 0 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 535 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :2
// Phase 1: matrix 468 rows 33 cols
[2023-03-07 07:54:44] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-07 07:54:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:54:44] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-07 07:54:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:54:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:54:49] [INFO ] [Nat]Absence check using state equation in 4704 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 33/33 places, 468/468 transitions.
Graph (complete) has 468 edges and 33 vertex of which 32 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 32 transition count 462
Applied a total of 7 rules in 12 ms. Remains 32 /33 variables (removed 1) and now considering 462/468 (removed 6) transitions.
// Phase 1: matrix 462 rows 32 cols
[2023-03-07 07:54:49] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-07 07:54:49] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32/33 places, 462/468 transitions.
// Phase 1: matrix 462 rows 32 cols
[2023-03-07 07:54:49] [INFO ] Computed 0 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 44448 resets, run finished after 4153 ms. (steps per millisecond=240 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 8331 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties (out of 1) seen :2
// Phase 1: matrix 462 rows 32 cols
[2023-03-07 07:54:54] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-07 07:54:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-07 07:54:54] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2023-03-07 07:54:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-07 07:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-07 07:55:00] [INFO ] [Nat]Absence check using state equation in 5967 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 32/32 places, 462/462 transitions.
Applied a total of 0 rules in 12 ms. Remains 32 /32 variables (removed 0) and now considering 462/462 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 32/32 places, 462/462 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 32/32 places, 462/462 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 462/462 (removed 0) transitions.
// Phase 1: matrix 462 rows 32 cols
[2023-03-07 07:55:00] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 07:55:00] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 462 rows 32 cols
[2023-03-07 07:55:00] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-07 07:55:00] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
[2023-03-07 07:55:00] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 462 rows 32 cols
[2023-03-07 07:55:00] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-07 07:55:00] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 32/32 places, 462/462 transitions.
Ending property specific reduction for DNAwalker-PT-17redondantChoiceL-UpperBounds-13 in 16702 ms.
[2023-03-07 07:55:01] [INFO ] Flatten gal took : 59 ms
[2023-03-07 07:55:01] [INFO ] Applying decomposition
[2023-03-07 07:55:01] [INFO ] Flatten gal took : 23 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/graph11780877665965566221.txt' '-o' '/tmp/graph11780877665965566221.bin' '-w' '/tmp/graph11780877665965566221.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11780877665965566221.bin' '-l' '-1' '-v' '-w' '/tmp/graph11780877665965566221.weights' '-q' '0' '-e' '0.001'
[2023-03-07 07:55:01] [INFO ] Decomposing Gal with order
[2023-03-07 07:55:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-07 07:55:01] [INFO ] Removed a total of 872 redundant transitions.
[2023-03-07 07:55:01] [INFO ] Flatten gal took : 65 ms
[2023-03-07 07:55:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2023-03-07 07:55:01] [INFO ] Time to serialize gal into /tmp/UpperBounds22341432497342585.gal : 5 ms
[2023-03-07 07:55:01] [INFO ] Time to serialize properties into /tmp/UpperBounds5182578364908116589.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds22341432497342585.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5182578364908116589.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...272
Loading property file /tmp/UpperBounds5182578364908116589.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.66112e+10,39.4471,1273772,21448,5,2.28875e+06,276,539,4.59758e+06,7,253,0
Total reachable state count : 16611193534

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property DNAwalker-PT-17redondantChoiceL-UpperBounds-09 :0 <= u14.A15 <= 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,40.1394,1273772,1,0,2.28875e+06,276,737,4.59758e+06,15,253,815
Min sum of variable value : 0
Maximum sum along a path : 2
Bounds property DNAwalker-PT-17redondantChoiceL-UpperBounds-13 :0 <= u32.A33 <= 2
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-13 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-13,0,40.1835,1273772,1,0,2.28875e+06,276,820,4.59758e+06,15,253,905
Total runtime 298999 ms.

BK_STOP 1678175741681

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DNAwalker-PT-17redondantChoiceL"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
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 r127-tall-167814504400126"
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 ;