fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r105-tall-167814482001005
Last Updated
May 14, 2023

About the Execution of LTSMin+red for DNAwalker-PT-17redondantChoiceL

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1065.071 645937.00 1837102.00 869.90 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 2 normal

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.r105-tall-167814482001005.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 ltsminxred
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 r105-tall-167814482001005
=====================================================================

--------------------
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 1678406744451

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-17redondantChoiceL
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 00:05:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 00:05:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 00:05:46] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-10 00:05:46] [INFO ] Transformed 43 places.
[2023-03-10 00:05:46] [INFO ] Transformed 490 transitions.
[2023-03-10 00:05:46] [INFO ] Parsed PT model containing 43 places and 490 transitions and 1438 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Normalized transition count is 489 out of 490 initially.
// Phase 1: matrix 489 rows 43 cols
[2023-03-10 00:05:46] [INFO ] Computed 0 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 377 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 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 23 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :31
Incomplete Best-First random walk after 10001 steps, including 27 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 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :31
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 :31
Incomplete Best-First random walk after 10001 steps, including 33 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 24 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :31
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 :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 26 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 34 resets, run finished after 14 ms. (steps per millisecond=714 ) 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 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 28 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :30
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 10000 steps, including 26 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :31
[2023-03-10 00:05:46] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2023-03-10 00:05:46] [INFO ] Computed 0 place invariants in 16 ms
[2023-03-10 00:05:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:46] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-10 00:05:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:52] [INFO ] [Nat]Absence check using state equation in 4975 ms returned unknown
[2023-03-10 00:05:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:52] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-03-10 00:05:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:05:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:57] [INFO ] [Nat]Absence check using state equation in 4984 ms returned unknown
[2023-03-10 00:05:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:05:57] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-10 00:05:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:05:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:02] [INFO ] [Nat]Absence check using state equation in 4982 ms returned unknown
[2023-03-10 00:06:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:02] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-10 00:06:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:06:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:07] [INFO ] [Nat]Absence check using state equation in 4982 ms returned unknown
[2023-03-10 00:06:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:07] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-10 00:06:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:06:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:12] [INFO ] [Nat]Absence check using state equation in 4980 ms returned unknown
[2023-03-10 00:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:12] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-10 00:06:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:06:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:17] [INFO ] [Nat]Absence check using state equation in 4983 ms returned unknown
[2023-03-10 00:06:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:17] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-10 00:06:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:06:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:22] [INFO ] [Nat]Absence check using state equation in 4985 ms returned unknown
[2023-03-10 00:06:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:22] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-10 00:06:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:06:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:27] [INFO ] [Nat]Absence check using state equation in 4980 ms returned unknown
[2023-03-10 00:06:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:27] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2023-03-10 00:06:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:06:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:32] [INFO ] [Nat]Absence check using state equation in 4985 ms returned unknown
[2023-03-10 00:06:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:33] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-10 00:06:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:06:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:38] [INFO ] [Nat]Absence check using state equation in 4981 ms returned unknown
[2023-03-10 00:06:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:38] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-10 00:06:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:06:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:43] [INFO ] [Nat]Absence check using state equation in 4998 ms returned unknown
[2023-03-10 00:06:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:43] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-10 00:06:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:06:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:48] [INFO ] [Nat]Absence check using state equation in 4979 ms returned unknown
[2023-03-10 00:06:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:48] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-10 00:06:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:06:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:53] [INFO ] [Nat]Absence check using state equation in 4982 ms returned unknown
[2023-03-10 00:06:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:53] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-10 00:06:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:06:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:58] [INFO ] [Nat]Absence check using state equation in 4982 ms returned unknown
[2023-03-10 00:06:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:58] [INFO ] [Real]Absence check using state equation in 52 ms returned unsat
[2023-03-10 00:06:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:06:58] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2023-03-10 00:06:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:06:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:07:00] [INFO ] [Nat]Absence check using state equation in 1652 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 2] Max seen :[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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
Support contains 14 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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 5 places and 5 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 17 place count 38 transition count 473
Applied a total of 17 rules in 48 ms. Remains 38 /43 variables (removed 5) and now considering 473/490 (removed 17) transitions.
// Phase 1: matrix 473 rows 38 cols
[2023-03-10 00:07:00] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-10 00:07:00] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 216 ms. Remains : 38/43 places, 473/490 transitions.
[2023-03-10 00:07:00] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 42327 resets, run finished after 4995 ms. (steps per millisecond=200 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 1000000 steps, including 3714 resets, run finished after 837 ms. (steps per millisecond=1194 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 1000001 steps, including 3197 resets, run finished after 815 ms. (steps per millisecond=1226 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 1000001 steps, including 3699 resets, run finished after 839 ms. (steps per millisecond=1191 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 1000001 steps, including 3494 resets, run finished after 835 ms. (steps per millisecond=1197 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 1000001 steps, including 3553 resets, run finished after 831 ms. (steps per millisecond=1203 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 1000001 steps, including 4071 resets, run finished after 873 ms. (steps per millisecond=1145 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 1000001 steps, including 3309 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 1000001 steps, including 3778 resets, run finished after 839 ms. (steps per millisecond=1191 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 1000001 steps, including 3915 resets, run finished after 850 ms. (steps per millisecond=1176 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 1000001 steps, including 3560 resets, run finished after 833 ms. (steps per millisecond=1200 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 1000001 steps, including 5891 resets, run finished after 861 ms. (steps per millisecond=1161 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 1000001 steps, including 3569 resets, run finished after 840 ms. (steps per millisecond=1190 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 1000001 steps, including 3670 resets, run finished after 838 ms. (steps per millisecond=1193 ) properties (out of 14) seen :28
Incomplete Best-First random walk after 1000001 steps, including 5678 resets, run finished after 856 ms. (steps per millisecond=1168 ) properties (out of 14) seen :28
[2023-03-10 00:07:17] [INFO ] Invariant cache hit.
[2023-03-10 00:07:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:07:17] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-10 00:07:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:07:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:07:23] [INFO ] [Nat]Absence check using state equation in 6078 ms returned unknown
[2023-03-10 00:07:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:07:23] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-10 00:07:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:07:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:07:29] [INFO ] [Nat]Absence check using state equation in 6081 ms returned unknown
[2023-03-10 00:07:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:07:30] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-10 00:07:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:07:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:07:31] [INFO ] [Nat]Absence check using state equation in 1627 ms returned unsat
[2023-03-10 00:07:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:07:31] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-10 00:07:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:07:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:07:37] [INFO ] [Nat]Absence check using state equation in 6076 ms returned unknown
[2023-03-10 00:07:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:07:37] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2023-03-10 00:07:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:07:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:07:44] [INFO ] [Nat]Absence check using state equation in 6086 ms returned unknown
[2023-03-10 00:07:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:07:44] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-10 00:07:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:07:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:07:49] [INFO ] [Nat]Absence check using state equation in 5060 ms returned unsat
[2023-03-10 00:07:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:07:49] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-10 00:07:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:07:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:07:54] [INFO ] [Nat]Absence check using state equation in 5559 ms returned unsat
[2023-03-10 00:07:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:07:55] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-10 00:07:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:07:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:07:56] [INFO ] [Nat]Absence check using state equation in 1382 ms returned unsat
[2023-03-10 00:07:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:07:56] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-10 00:07:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:07:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:02] [INFO ] [Nat]Absence check using state equation in 6072 ms returned unknown
[2023-03-10 00:08:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:02] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-10 00:08:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:08:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:05] [INFO ] [Nat]Absence check using state equation in 3031 ms returned unsat
[2023-03-10 00:08:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:05] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-10 00:08:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:08:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:11] [INFO ] [Nat]Absence check using state equation in 6072 ms returned unknown
[2023-03-10 00:08:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:12] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-10 00:08:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:08:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:15] [INFO ] [Nat]Absence check using state equation in 3634 ms returned unsat
[2023-03-10 00:08:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:15] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-10 00:08:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:08:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:18] [INFO ] [Nat]Absence check using state equation in 2207 ms returned unsat
[2023-03-10 00:08:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:18] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-10 00:08:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:08:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:20] [INFO ] [Nat]Absence check using state equation in 2845 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, -1, 2, -1, -1, 2, 2, 2, -1, 2, -1, 2, 2, 2] Max seen :[2, 2, 2, 2, 2, 2, 2, 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-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-09 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-06 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
Support contains 6 out of 38 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 38/38 places, 473/473 transitions.
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 35 transition count 470
Applied a total of 3 rules in 22 ms. Remains 35 /38 variables (removed 3) and now considering 470/473 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 35/38 places, 470/473 transitions.
// Phase 1: matrix 470 rows 35 cols
[2023-03-10 00:08:21] [INFO ] Computed 0 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 48187 resets, run finished after 4626 ms. (steps per millisecond=216 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 4613 resets, run finished after 830 ms. (steps per millisecond=1204 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 4128 resets, run finished after 825 ms. (steps per millisecond=1212 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 4451 resets, run finished after 833 ms. (steps per millisecond=1200 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 4364 resets, run finished after 826 ms. (steps per millisecond=1210 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 4513 resets, run finished after 818 ms. (steps per millisecond=1222 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 7394 resets, run finished after 831 ms. (steps per millisecond=1203 ) properties (out of 6) seen :12
[2023-03-10 00:08:30] [INFO ] Invariant cache hit.
[2023-03-10 00:08:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:30] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-10 00:08:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:08:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:36] [INFO ] [Nat]Absence check using state equation in 6086 ms returned unknown
[2023-03-10 00:08:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:36] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-10 00:08:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:08:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:42] [INFO ] [Nat]Absence check using state equation in 6075 ms returned unknown
[2023-03-10 00:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:43] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-03-10 00:08:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:08:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:49] [INFO ] [Nat]Absence check using state equation in 6069 ms returned unknown
[2023-03-10 00:08:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:49] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-10 00:08:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:08:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:52] [INFO ] [Nat]Absence check using state equation in 3653 ms returned unsat
[2023-03-10 00:08:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:53] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-10 00:08:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:08:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:59] [INFO ] [Nat]Absence check using state equation in 6074 ms returned unknown
[2023-03-10 00:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:08:59] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-10 00:08:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:08:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:09:04] [INFO ] [Nat]Absence check using state equation in 5311 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, -1, -1, 2, -1, 2] Max seen :[2, 2, 2, 2, 2, 2]
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 470/470 transitions.
Graph (complete) has 470 edges and 35 vertex of which 34 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 34 transition count 464
Applied a total of 7 rules in 16 ms. Remains 34 /35 variables (removed 1) and now considering 464/470 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 34/35 places, 464/470 transitions.
// Phase 1: matrix 464 rows 34 cols
[2023-03-10 00:09:04] [INFO ] Computed 0 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 40979 resets, run finished after 4405 ms. (steps per millisecond=227 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 4243 resets, run finished after 806 ms. (steps per millisecond=1240 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 3806 resets, run finished after 798 ms. (steps per millisecond=1253 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 3977 resets, run finished after 813 ms. (steps per millisecond=1230 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 4127 resets, run finished after 797 ms. (steps per millisecond=1254 ) properties (out of 4) seen :8
[2023-03-10 00:09:12] [INFO ] Invariant cache hit.
[2023-03-10 00:09:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:09:12] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-10 00:09:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:09:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:09:14] [INFO ] [Nat]Absence check using state equation in 2366 ms returned unsat
[2023-03-10 00:09:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:09:14] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-10 00:09:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:09:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:09:18] [INFO ] [Nat]Absence check using state equation in 3729 ms returned unsat
[2023-03-10 00:09:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:09:18] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-10 00:09:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:09:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:09:20] [INFO ] [Nat]Absence check using state equation in 1533 ms returned unsat
[2023-03-10 00:09:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:09:20] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-10 00:09:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:09:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:09:26] [INFO ] [Nat]Absence check using state equation in 6073 ms returned unknown
Current structural bounds on expressions (after SMT) : [2, 2, 2, -1] Max seen :[2, 2, 2, 2]
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-03 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 464/464 transitions.
Graph (complete) has 464 edges and 34 vertex of which 33 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 33 transition count 458
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 31 transition count 456
Applied a total of 9 rules in 26 ms. Remains 31 /34 variables (removed 3) and now considering 456/464 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 31/34 places, 456/464 transitions.
// Phase 1: matrix 456 rows 31 cols
[2023-03-10 00:09:26] [INFO ] Computed 0 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 36218 resets, run finished after 4055 ms. (steps per millisecond=246 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 3990 resets, run finished after 773 ms. (steps per millisecond=1293 ) properties (out of 1) seen :2
[2023-03-10 00:09:31] [INFO ] Invariant cache hit.
[2023-03-10 00:09:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:09:31] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2023-03-10 00:09:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:09:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:09:37] [INFO ] [Nat]Absence check using state equation in 6074 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 REACHABILITY mode, iteration 0 : 31/31 places, 456/456 transitions.
Applied a total of 0 rules in 11 ms. Remains 31 /31 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 31/31 places, 456/456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 456/456 transitions.
Applied a total of 0 rules in 5 ms. Remains 31 /31 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2023-03-10 00:09:37] [INFO ] Invariant cache hit.
[2023-03-10 00:09:37] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-10 00:09:37] [INFO ] Invariant cache hit.
[2023-03-10 00:09:37] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2023-03-10 00:09:38] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-10 00:09:38] [INFO ] Invariant cache hit.
[2023-03-10 00:09:38] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 748 ms. Remains : 31/31 places, 456/456 transitions.
Starting property specific reduction for DNAwalker-PT-17redondantChoiceL-UpperBounds-08
[2023-03-10 00:09:38] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 363 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :2
[2023-03-10 00:09:38] [INFO ] Invariant cache hit.
[2023-03-10 00:09:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:09:38] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-10 00:09:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:09:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:09:43] [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 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 456/456 transitions.
Applied a total of 0 rules in 10 ms. Remains 31 /31 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2023-03-10 00:09:43] [INFO ] Invariant cache hit.
[2023-03-10 00:09:43] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 31/31 places, 456/456 transitions.
[2023-03-10 00:09:43] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 36262 resets, run finished after 4056 ms. (steps per millisecond=246 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 3987 resets, run finished after 777 ms. (steps per millisecond=1287 ) properties (out of 1) seen :2
[2023-03-10 00:09:48] [INFO ] Invariant cache hit.
[2023-03-10 00:09:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 00:09:48] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2023-03-10 00:09:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 00:09:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 00:09:54] [INFO ] [Nat]Absence check using state equation in 6071 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 REACHABILITY mode, iteration 0 : 31/31 places, 456/456 transitions.
Applied a total of 0 rules in 14 ms. Remains 31 /31 variables (removed 0) and now considering 456/456 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 31/31 places, 456/456 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 456/456 transitions.
Applied a total of 0 rules in 6 ms. Remains 31 /31 variables (removed 0) and now considering 456/456 (removed 0) transitions.
[2023-03-10 00:09:54] [INFO ] Invariant cache hit.
[2023-03-10 00:09:54] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-10 00:09:54] [INFO ] Invariant cache hit.
[2023-03-10 00:09:55] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2023-03-10 00:09:55] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-10 00:09:55] [INFO ] Invariant cache hit.
[2023-03-10 00:09:55] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 729 ms. Remains : 31/31 places, 456/456 transitions.
Ending property specific reduction for DNAwalker-PT-17redondantChoiceL-UpperBounds-08 in 17077 ms.
[2023-03-10 00:09:55] [INFO ] Flatten gal took : 55 ms
[2023-03-10 00:09:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-10 00:09:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 31 places, 456 transitions and 1368 arcs took 3 ms.
Total runtime 249258 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/759/ub_0_
FORMULA DNAwalker-PT-17redondantChoiceL-UpperBounds-08 2 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678407390388

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name DNAwalker-PT-17redondantChoiceL-UpperBounds-08
ub formula formula --maxsum=/tmp/759/ub_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 31 places, 456 transitions and 1368 arcs
pnml2lts-sym: Petri net DNAwalker_PT_17redondantChoiceL analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 456->228 groups
pnml2lts-sym: Regrouping took 0.060 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 31; there are 228 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 60413782 group checks and 0 next state calls
pnml2lts-sym: reachability took 393.620 real 1571.640 user 1.690 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.030 user 0.000 sys
pnml2lts-sym: state space has 14655455288 states, 51865 nodes
pnml2lts-sym: Maximum sum of /tmp/759/ub_0_ is: 2
pnml2lts-sym: group_next: 2255 nodes total
pnml2lts-sym: group_explored: 1814 nodes, 1804 short vectors total
pnml2lts-sym: max token count: 2

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="ltsminxred"
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 ltsminxred"
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 r105-tall-167814482001005"
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 ;