Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r089-tall-165260117600064.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is DoubleExponent-PT-002, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r089-tall-165260117600064
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 6.0K Apr 29 13:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 29 13:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 13:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 13:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 33K May 10 09:33 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 DoubleExponent-PT-002-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-002-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652718877196

Running Version 0
[2022-05-16 16:34:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 16:34:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 16:34:39] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2022-05-16 16:34:39] [INFO ] Transformed 110 places.
[2022-05-16 16:34:39] [INFO ] Transformed 98 transitions.
[2022-05-16 16:34:39] [INFO ] Parsed PT model containing 110 places and 98 transitions in 200 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 98 rows 110 cols
[2022-05-16 16:34:39] [INFO ] Computed 14 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 334 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :10
FORMULA DoubleExponent-PT-002-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 281 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10000 steps, including 292 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10000 steps, including 284 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 269 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :4
// Phase 1: matrix 98 rows 110 cols
[2022-05-16 16:34:39] [INFO ] Computed 14 place invariants in 9 ms
[2022-05-16 16:34:39] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2022-05-16 16:34:39] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2022-05-16 16:34:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:39] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-16 16:34:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2022-05-16 16:34:39] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:39] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-05-16 16:34:39] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 15 ms to minimize.
[2022-05-16 16:34:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-16 16:34:39] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 16:34:39] [INFO ] Added : 90 causal constraints over 19 iterations in 278 ms. Result :sat
Minimization took 37 ms.
[2022-05-16 16:34:39] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 16:34:39] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:40] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2022-05-16 16:34:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-05-16 16:34:40] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 5 ms returned sat
[2022-05-16 16:34:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:40] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-05-16 16:34:40] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 2 ms to minimize.
[2022-05-16 16:34:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-05-16 16:34:40] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 16:34:40] [INFO ] Added : 87 causal constraints over 18 iterations in 224 ms. Result :sat
Minimization took 30 ms.
[2022-05-16 16:34:40] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:40] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 6 ms returned sat
[2022-05-16 16:34:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:40] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-05-16 16:34:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 16:34:40] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:40] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-05-16 16:34:40] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2022-05-16 16:34:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-05-16 16:34:40] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 16:34:40] [INFO ] Added : 96 causal constraints over 20 iterations in 220 ms. Result :sat
Minimization took 34 ms.
[2022-05-16 16:34:40] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:40] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:40] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-05-16 16:34:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:40] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 16:34:40] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 4 ms returned sat
[2022-05-16 16:34:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:40] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-05-16 16:34:41] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 3 ms to minimize.
[2022-05-16 16:34:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2022-05-16 16:34:41] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 16:34:41] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2022-05-16 16:34:41] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
[2022-05-16 16:34:41] [INFO ] Deduced a trap composed of 44 places in 31 ms of which 0 ms to minimize.
[2022-05-16 16:34:41] [INFO ] Deduced a trap composed of 53 places in 26 ms of which 0 ms to minimize.
[2022-05-16 16:34:41] [INFO ] Deduced a trap composed of 38 places in 28 ms of which 0 ms to minimize.
[2022-05-16 16:34:41] [INFO ] Deduced a trap composed of 44 places in 20 ms of which 0 ms to minimize.
[2022-05-16 16:34:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 288 ms
[2022-05-16 16:34:41] [INFO ] Added : 94 causal constraints over 20 iterations in 518 ms. Result :sat
Minimization took 66 ms.
[2022-05-16 16:34:41] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:41] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:41] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-16 16:34:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 16:34:41] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:41] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-05-16 16:34:41] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2022-05-16 16:34:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2022-05-16 16:34:41] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 16:34:41] [INFO ] Added : 64 causal constraints over 13 iterations in 129 ms. Result :sat
Minimization took 26 ms.
[2022-05-16 16:34:41] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:41] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:41] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-16 16:34:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:41] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:42] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-05-16 16:34:42] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 16:34:42] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 0 ms to minimize.
[2022-05-16 16:34:42] [INFO ] Deduced a trap composed of 61 places in 28 ms of which 0 ms to minimize.
[2022-05-16 16:34:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2022-05-16 16:34:42] [INFO ] Added : 94 causal constraints over 19 iterations in 304 ms. Result :sat
Minimization took 37 ms.
[2022-05-16 16:34:42] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:42] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-16 16:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:42] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-16 16:34:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:42] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:42] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-05-16 16:34:42] [INFO ] Deduced a trap composed of 41 places in 42 ms of which 0 ms to minimize.
[2022-05-16 16:34:42] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2022-05-16 16:34:42] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 0 ms to minimize.
[2022-05-16 16:34:42] [INFO ] Deduced a trap composed of 34 places in 24 ms of which 1 ms to minimize.
[2022-05-16 16:34:42] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 160 ms
[2022-05-16 16:34:42] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 16:34:42] [INFO ] Added : 93 causal constraints over 19 iterations in 187 ms. Result :sat
Minimization took 35 ms.
[2022-05-16 16:34:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 16:34:42] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:42] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-16 16:34:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:42] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:43] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-05-16 16:34:43] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2022-05-16 16:34:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2022-05-16 16:34:43] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 16:34:43] [INFO ] Added : 88 causal constraints over 18 iterations in 173 ms. Result :sat
Minimization took 31 ms.
[2022-05-16 16:34:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 16:34:43] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:43] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-05-16 16:34:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 16:34:43] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:43] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-05-16 16:34:43] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 0 ms to minimize.
[2022-05-16 16:34:43] [INFO ] Deduced a trap composed of 70 places in 26 ms of which 1 ms to minimize.
[2022-05-16 16:34:43] [INFO ] Deduced a trap composed of 44 places in 23 ms of which 0 ms to minimize.
[2022-05-16 16:34:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 106 ms
[2022-05-16 16:34:43] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 16:34:43] [INFO ] Deduced a trap composed of 52 places in 30 ms of which 0 ms to minimize.
[2022-05-16 16:34:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-05-16 16:34:43] [INFO ] Added : 91 causal constraints over 19 iterations in 244 ms. Result :sat
Minimization took 36 ms.
[2022-05-16 16:34:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 16:34:43] [INFO ] [Real]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:43] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-16 16:34:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:34:43] [INFO ] [Nat]Absence check using 5 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:43] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-05-16 16:34:43] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2022-05-16 16:34:43] [INFO ] Deduced a trap composed of 40 places in 26 ms of which 0 ms to minimize.
[2022-05-16 16:34:43] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2022-05-16 16:34:44] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2022-05-16 16:34:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 139 ms
[2022-05-16 16:34:44] [INFO ] Computed and/alt/rep : 97/187/97 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-16 16:34:44] [INFO ] Deduced a trap composed of 53 places in 33 ms of which 1 ms to minimize.
[2022-05-16 16:34:44] [INFO ] Deduced a trap composed of 44 places in 28 ms of which 1 ms to minimize.
[2022-05-16 16:34:44] [INFO ] Deduced a trap composed of 44 places in 27 ms of which 0 ms to minimize.
[2022-05-16 16:34:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 136 ms
[2022-05-16 16:34:44] [INFO ] Added : 79 causal constraints over 16 iterations in 332 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, -1, 1, 1, 1, 1, 1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 4]
Incomplete Parikh walk after 13300 steps, including 459 resets, run finished after 21 ms. (steps per millisecond=633 ) properties (out of 10) seen :4 could not realise parikh vector
Incomplete Parikh walk after 39300 steps, including 1500 resets, run finished after 52 ms. (steps per millisecond=755 ) properties (out of 10) seen :4 could not realise parikh vector
Incomplete Parikh walk after 33800 steps, including 1186 resets, run finished after 27 ms. (steps per millisecond=1251 ) properties (out of 10) seen :4 could not realise parikh vector
Incomplete Parikh walk after 27500 steps, including 1015 resets, run finished after 27 ms. (steps per millisecond=1018 ) properties (out of 10) seen :4 could not realise parikh vector
Incomplete Parikh walk after 30300 steps, including 1195 resets, run finished after 23 ms. (steps per millisecond=1317 ) properties (out of 10) seen :3 could not realise parikh vector
Incomplete Parikh walk after 19800 steps, including 696 resets, run finished after 15 ms. (steps per millisecond=1320 ) properties (out of 10) seen :4 could not realise parikh vector
Incomplete Parikh walk after 37700 steps, including 1319 resets, run finished after 31 ms. (steps per millisecond=1216 ) properties (out of 10) seen :4 could not realise parikh vector
Incomplete Parikh walk after 36500 steps, including 1280 resets, run finished after 27 ms. (steps per millisecond=1351 ) properties (out of 10) seen :4 could not realise parikh vector
Incomplete Parikh walk after 33800 steps, including 1179 resets, run finished after 27 ms. (steps per millisecond=1251 ) properties (out of 10) seen :4 could not realise parikh vector
Incomplete Parikh walk after 47400 steps, including 1673 resets, run finished after 38 ms. (steps per millisecond=1247 ) properties (out of 10) seen :4 could not realise parikh vector
Support contains 10 out of 110 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 110/110 places, 98/98 transitions.
Graph (complete) has 178 edges and 110 vertex of which 107 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 107 transition count 83
Reduce places removed 15 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 19 rules applied. Total rules applied 35 place count 92 transition count 79
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 39 place count 88 transition count 79
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 39 place count 88 transition count 74
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 49 place count 83 transition count 74
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 79 place count 68 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 66 transition count 59
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 86 place count 66 transition count 56
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 89 place count 63 transition count 56
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 97 place count 63 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 62 transition count 55
Applied a total of 98 rules in 35 ms. Remains 62 /110 variables (removed 48) and now considering 55/98 (removed 43) transitions.
Finished structural reductions, in 1 iterations. Remains : 62/110 places, 55/98 transitions.
// Phase 1: matrix 55 rows 62 cols
[2022-05-16 16:34:44] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 112681 resets, run finished after 844 ms. (steps per millisecond=1184 ) properties (out of 10) seen :16
FORMULA DoubleExponent-PT-002-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleExponent-PT-002-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 77611 resets, run finished after 529 ms. (steps per millisecond=1890 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 77805 resets, run finished after 491 ms. (steps per millisecond=2036 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000000 steps, including 77473 resets, run finished after 477 ms. (steps per millisecond=2096 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 77722 resets, run finished after 478 ms. (steps per millisecond=2092 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000000 steps, including 77437 resets, run finished after 459 ms. (steps per millisecond=2178 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 77625 resets, run finished after 461 ms. (steps per millisecond=2169 ) properties (out of 6) seen :11
// Phase 1: matrix 55 rows 62 cols
[2022-05-16 16:34:48] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-16 16:34:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:48] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:48] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 16:34:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:48] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:48] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:34:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 16:34:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-16 16:34:48] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2022-05-16 16:34:48] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 1 ms to minimize.
[2022-05-16 16:34:48] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 1 ms to minimize.
[2022-05-16 16:34:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 64 ms
[2022-05-16 16:34:48] [INFO ] Computed and/alt/rep : 54/170/54 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:34:48] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2022-05-16 16:34:48] [INFO ] Deduced a trap composed of 11 places in 15 ms of which 1 ms to minimize.
[2022-05-16 16:34:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2022-05-16 16:34:48] [INFO ] Added : 52 causal constraints over 11 iterations in 135 ms. Result :sat
Minimization took 23 ms.
[2022-05-16 16:34:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:48] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:48] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-16 16:34:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:48] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:48] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 16:34:48] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-16 16:34:48] [INFO ] Computed and/alt/rep : 54/170/54 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 16:34:48] [INFO ] Added : 53 causal constraints over 11 iterations in 80 ms. Result :sat
Minimization took 24 ms.
[2022-05-16 16:34:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:48] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:48] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 16:34:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:49] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:49] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-16 16:34:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2022-05-16 16:34:49] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 6 ms to minimize.
[2022-05-16 16:34:49] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2022-05-16 16:34:49] [INFO ] Deduced a trap composed of 7 places in 7 ms of which 0 ms to minimize.
[2022-05-16 16:34:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 59 ms
[2022-05-16 16:34:49] [INFO ] Computed and/alt/rep : 54/170/54 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:34:49] [INFO ] Added : 41 causal constraints over 9 iterations in 64 ms. Result :sat
Minimization took 18 ms.
[2022-05-16 16:34:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:49] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:49] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:34:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:49] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 88 ms returned sat
[2022-05-16 16:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:49] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2022-05-16 16:34:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-16 16:34:49] [INFO ] Computed and/alt/rep : 54/170/54 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 16:34:49] [INFO ] Added : 51 causal constraints over 11 iterations in 102 ms. Result :sat
Minimization took 25 ms.
[2022-05-16 16:34:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:49] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:49] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 16:34:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:49] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:49] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:34:49] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:34:49] [INFO ] Computed and/alt/rep : 54/170/54 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:34:49] [INFO ] Added : 51 causal constraints over 11 iterations in 81 ms. Result :sat
Minimization took 26 ms.
[2022-05-16 16:34:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:49] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:49] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:34:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:50] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:50] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:34:50] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-16 16:34:50] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2022-05-16 16:34:50] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 0 ms to minimize.
[2022-05-16 16:34:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 47 ms
[2022-05-16 16:34:50] [INFO ] Computed and/alt/rep : 54/170/54 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:34:50] [INFO ] Added : 47 causal constraints over 10 iterations in 79 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, -1, 1, 1, -1] Max seen :[4, 0, 4, 0, 0, 4]
Incomplete Parikh walk after 26600 steps, including 3641 resets, run finished after 28 ms. (steps per millisecond=950 ) properties (out of 6) seen :6 could not realise parikh vector
Incomplete Parikh walk after 11500 steps, including 1517 resets, run finished after 11 ms. (steps per millisecond=1045 ) properties (out of 6) seen :9 could not realise parikh vector
Incomplete Parikh walk after 14700 steps, including 1965 resets, run finished after 13 ms. (steps per millisecond=1130 ) properties (out of 6) seen :6 could not realise parikh vector
Incomplete Parikh walk after 17500 steps, including 2239 resets, run finished after 16 ms. (steps per millisecond=1093 ) properties (out of 6) seen :4 could not realise parikh vector
Incomplete Parikh walk after 18500 steps, including 2471 resets, run finished after 21 ms. (steps per millisecond=880 ) properties (out of 6) seen :8 could not realise parikh vector
Incomplete Parikh walk after 33000 steps, including 4456 resets, run finished after 27 ms. (steps per millisecond=1222 ) properties (out of 6) seen :4 could not realise parikh vector
Support contains 6 out of 62 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 62/62 places, 55/55 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 61 transition count 54
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 61 transition count 53
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 60 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 58 transition count 51
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 58 transition count 48
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 55 transition count 48
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 55 transition count 48
Applied a total of 15 rules in 10 ms. Remains 55 /62 variables (removed 7) and now considering 48/55 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 55/62 places, 48/55 transitions.
// Phase 1: matrix 48 rows 55 cols
[2022-05-16 16:34:50] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 112769 resets, run finished after 618 ms. (steps per millisecond=1618 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 77587 resets, run finished after 486 ms. (steps per millisecond=2057 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 77564 resets, run finished after 509 ms. (steps per millisecond=1964 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 77764 resets, run finished after 518 ms. (steps per millisecond=1930 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 77832 resets, run finished after 530 ms. (steps per millisecond=1886 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000001 steps, including 77756 resets, run finished after 491 ms. (steps per millisecond=2036 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 77658 resets, run finished after 453 ms. (steps per millisecond=2207 ) properties (out of 6) seen :12
// Phase 1: matrix 48 rows 55 cols
[2022-05-16 16:34:53] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-16 16:34:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:53] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:53] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 16:34:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:53] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-16 16:34:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 16:34:54] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 13 places in 14 ms of which 0 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 60 ms
[2022-05-16 16:34:54] [INFO ] Computed and/alt/rep : 47/179/47 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:34:54] [INFO ] Added : 45 causal constraints over 11 iterations in 80 ms. Result :sat
Minimization took 21 ms.
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 16:34:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 1 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 44 ms
[2022-05-16 16:34:54] [INFO ] Computed and/alt/rep : 47/179/47 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:34:54] [INFO ] Added : 46 causal constraints over 10 iterations in 72 ms. Result :sat
Minimization took 23 ms.
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:34:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-16 16:34:54] [INFO ] Computed and/alt/rep : 47/179/47 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2022-05-16 16:34:54] [INFO ] Added : 35 causal constraints over 8 iterations in 85 ms. Result :sat
Minimization took 21 ms.
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:34:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 44 ms
[2022-05-16 16:34:54] [INFO ] Computed and/alt/rep : 47/179/47 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-05-16 16:34:54] [INFO ] Added : 44 causal constraints over 9 iterations in 105 ms. Result :sat
Minimization took 21 ms.
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:54] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 16:34:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:54] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2022-05-16 16:34:54] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2022-05-16 16:34:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 45 ms
[2022-05-16 16:34:54] [INFO ] Computed and/alt/rep : 47/179/47 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 16:34:54] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2022-05-16 16:34:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2022-05-16 16:34:55] [INFO ] Added : 44 causal constraints over 9 iterations in 101 ms. Result :sat
Minimization took 19 ms.
[2022-05-16 16:34:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:55] [INFO ] [Real]Absence check using 2 positive and 9 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:55] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 16:34:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:55] [INFO ] [Nat]Absence check using 2 positive and 9 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:55] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2022-05-16 16:34:55] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:34:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:34:55] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2022-05-16 16:34:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 44 ms
[2022-05-16 16:34:55] [INFO ] Computed and/alt/rep : 47/179/47 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:34:55] [INFO ] Added : 27 causal constraints over 6 iterations in 50 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, -1, 1, 1, -1] Max seen :[4, 0, 4, 0, 0, 4]
Incomplete Parikh walk after 5800 steps, including 788 resets, run finished after 10 ms. (steps per millisecond=580 ) properties (out of 6) seen :4 could not realise parikh vector
Incomplete Parikh walk after 7800 steps, including 1045 resets, run finished after 7 ms. (steps per millisecond=1114 ) properties (out of 6) seen :8 could not realise parikh vector
Incomplete Parikh walk after 12400 steps, including 1671 resets, run finished after 10 ms. (steps per millisecond=1240 ) properties (out of 6) seen :4 could not realise parikh vector
Incomplete Parikh walk after 13400 steps, including 1735 resets, run finished after 11 ms. (steps per millisecond=1218 ) properties (out of 6) seen :6 could not realise parikh vector
Incomplete Parikh walk after 10500 steps, including 1416 resets, run finished after 12 ms. (steps per millisecond=875 ) properties (out of 6) seen :7 could not realise parikh vector
Incomplete Parikh walk after 14200 steps, including 1916 resets, run finished after 11 ms. (steps per millisecond=1290 ) properties (out of 6) seen :4 could not realise parikh vector
Support contains 6 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 55/55 places, 48/48 transitions.
Starting structural reductions, iteration 0 : 55/55 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 55 cols
[2022-05-16 16:34:55] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 16:34:55] [INFO ] Implicit Places using invariants in 33 ms returned [34, 35]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
[2022-05-16 16:34:55] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 53 cols
[2022-05-16 16:34:55] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 16:34:55] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Starting structural reductions, iteration 1 : 53/55 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 52 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 52 transition count 47
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 52 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 51 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 51 transition count 46
Applied a total of 5 rules in 8 ms. Remains 51 /53 variables (removed 2) and now considering 46/48 (removed 2) transitions.
// Phase 1: matrix 46 rows 51 cols
[2022-05-16 16:34:55] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 16:34:55] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 46 rows 51 cols
[2022-05-16 16:34:55] [INFO ] Computed 9 place invariants in 5 ms
[2022-05-16 16:34:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 16:34:55] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [17, 22]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 79 ms to find 2 implicit places.
Starting structural reductions, iteration 2 : 49/55 places, 46/48 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 49 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 45
Applied a total of 2 rules in 5 ms. Remains 48 /49 variables (removed 1) and now considering 45/46 (removed 1) transitions.
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:34:55] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-16 16:34:55] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:34:55] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:34:55] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 16:34:55] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 48/55 places, 45/48 transitions.
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:34:55] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 124678 resets, run finished after 596 ms. (steps per millisecond=1677 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 83079 resets, run finished after 421 ms. (steps per millisecond=2375 ) properties (out of 6) seen :11
Incomplete Best-First random walk after 1000001 steps, including 83494 resets, run finished after 421 ms. (steps per millisecond=2375 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 83158 resets, run finished after 421 ms. (steps per millisecond=2375 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 83385 resets, run finished after 427 ms. (steps per millisecond=2341 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000000 steps, including 83528 resets, run finished after 438 ms. (steps per millisecond=2283 ) properties (out of 6) seen :12
Incomplete Best-First random walk after 1000001 steps, including 83399 resets, run finished after 420 ms. (steps per millisecond=2380 ) properties (out of 6) seen :11
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:34:58] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:34:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:58] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:58] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-16 16:34:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:58] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:58] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-16 16:34:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 16:34:58] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:34:58] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:34:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2022-05-16 16:34:58] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:34:58] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2022-05-16 16:34:58] [INFO ] Deduced a trap composed of 13 places in 14 ms of which 0 ms to minimize.
[2022-05-16 16:34:58] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 1 ms to minimize.
[2022-05-16 16:34:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 72 ms
[2022-05-16 16:34:58] [INFO ] Added : 42 causal constraints over 9 iterations in 131 ms. Result :sat
Minimization took 21 ms.
[2022-05-16 16:34:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:58] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 6 ms returned sat
[2022-05-16 16:34:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:58] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 16:34:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:58] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:58] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-16 16:34:58] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-16 16:34:58] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:34:59] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2022-05-16 16:34:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2022-05-16 16:34:59] [INFO ] Added : 43 causal constraints over 9 iterations in 83 ms. Result :sat
Minimization took 20 ms.
[2022-05-16 16:34:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:59] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 16:34:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:59] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:34:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:34:59] [INFO ] Deduced a trap composed of 5 places in 8 ms of which 0 ms to minimize.
[2022-05-16 16:34:59] [INFO ] Deduced a trap composed of 13 places in 11 ms of which 0 ms to minimize.
[2022-05-16 16:34:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 51 ms
[2022-05-16 16:34:59] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:34:59] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2022-05-16 16:34:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-16 16:34:59] [INFO ] Added : 42 causal constraints over 9 iterations in 86 ms. Result :sat
Minimization took 32 ms.
[2022-05-16 16:34:59] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:59] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:34:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:59] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:34:59] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 16:34:59] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2022-05-16 16:34:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-16 16:34:59] [INFO ] Added : 38 causal constraints over 8 iterations in 84 ms. Result :sat
Minimization took 16 ms.
[2022-05-16 16:34:59] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:59] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:34:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:59] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-16 16:34:59] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 16:34:59] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2022-05-16 16:34:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2022-05-16 16:34:59] [INFO ] Added : 40 causal constraints over 8 iterations in 78 ms. Result :sat
Minimization took 19 ms.
[2022-05-16 16:34:59] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:59] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-16 16:34:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:34:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:34:59] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-16 16:34:59] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:34:59] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2022-05-16 16:34:59] [INFO ] Deduced a trap composed of 5 places in 8 ms of which 0 ms to minimize.
[2022-05-16 16:34:59] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 16:34:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 58 ms
[2022-05-16 16:34:59] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:34:59] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2022-05-16 16:34:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-16 16:34:59] [INFO ] Added : 36 causal constraints over 8 iterations in 81 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, -1, 1, 1, -1] Max seen :[4, 0, 4, 0, 0, 4]
Incomplete Parikh walk after 7000 steps, including 1066 resets, run finished after 11 ms. (steps per millisecond=636 ) properties (out of 6) seen :4 could not realise parikh vector
Incomplete Parikh walk after 9200 steps, including 1308 resets, run finished after 7 ms. (steps per millisecond=1314 ) properties (out of 6) seen :8 could not realise parikh vector
Incomplete Parikh walk after 9200 steps, including 1339 resets, run finished after 7 ms. (steps per millisecond=1314 ) properties (out of 6) seen :4 could not realise parikh vector
Incomplete Parikh walk after 5900 steps, including 881 resets, run finished after 5 ms. (steps per millisecond=1180 ) properties (out of 6) seen :4 could not realise parikh vector
Incomplete Parikh walk after 10900 steps, including 1571 resets, run finished after 7 ms. (steps per millisecond=1557 ) properties (out of 6) seen :5 could not realise parikh vector
Incomplete Parikh walk after 27300 steps, including 4063 resets, run finished after 17 ms. (steps per millisecond=1605 ) properties (out of 6) seen :7 could not realise parikh vector
Support contains 6 out of 48 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 48/48 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 45/45 transitions.
Starting structural reductions, iteration 0 : 48/48 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:34:59] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:34:59] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:34:59] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-16 16:35:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 16:35:00] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2022-05-16 16:35:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:35:00] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:00] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 45/45 transitions.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-01
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:35:00] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1255 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 859 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:35:00] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-16 16:35:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-16 16:35:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:00] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-16 16:35:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 16:35:00] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:00] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 0 ms to minimize.
[2022-05-16 16:35:00] [INFO ] Deduced a trap composed of 5 places in 6 ms of which 0 ms to minimize.
[2022-05-16 16:35:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 28 ms
[2022-05-16 16:35:00] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 16:35:00] [INFO ] Added : 39 causal constraints over 8 iterations in 49 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Incomplete Parikh walk after 1600 steps, including 235 resets, run finished after 3 ms. (steps per millisecond=533 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 48/48 places, 45/45 transitions.
Graph (complete) has 140 edges and 48 vertex of which 45 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 45 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 44 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 42 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 41 transition count 40
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 41 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 40 transition count 39
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 40 transition count 39
Applied a total of 13 rules in 11 ms. Remains 40 /48 variables (removed 8) and now considering 39/45 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/48 places, 39/45 transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:00] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 156193 resets, run finished after 533 ms. (steps per millisecond=1876 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 95911 resets, run finished after 389 ms. (steps per millisecond=2570 ) properties (out of 1) seen :4
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:01] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:01] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 16:35:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:01] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-16 16:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:01] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-16 16:35:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-16 16:35:01] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:01] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 0 ms to minimize.
[2022-05-16 16:35:01] [INFO ] Deduced a trap composed of 11 places in 14 ms of which 1 ms to minimize.
[2022-05-16 16:35:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 38 ms
[2022-05-16 16:35:01] [INFO ] Computed and/alt/rep : 37/179/37 causal constraints (skipped 1 transitions) in 3 ms.
[2022-05-16 16:35:01] [INFO ] Added : 30 causal constraints over 7 iterations in 39 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 11400 steps, including 2042 resets, run finished after 14 ms. (steps per millisecond=814 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
Starting structural reductions, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:01] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:01] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:01] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-16 16:35:01] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2022-05-16 16:35:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:01] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 16:35:01] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:01] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 156114 resets, run finished after 538 ms. (steps per millisecond=1858 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 95922 resets, run finished after 383 ms. (steps per millisecond=2610 ) properties (out of 1) seen :4
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:02] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:02] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:02] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 16:35:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:02] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:02] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-16 16:35:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-16 16:35:02] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:02] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2022-05-16 16:35:02] [INFO ] Deduced a trap composed of 11 places in 11 ms of which 1 ms to minimize.
[2022-05-16 16:35:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 37 ms
[2022-05-16 16:35:02] [INFO ] Computed and/alt/rep : 37/179/37 causal constraints (skipped 1 transitions) in 3 ms.
[2022-05-16 16:35:02] [INFO ] Added : 30 causal constraints over 7 iterations in 44 ms. Result :sat
Minimization took 30 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 11400 steps, including 2058 resets, run finished after 14 ms. (steps per millisecond=814 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
Starting structural reductions, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:02] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 16:35:02] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:02] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-16 16:35:02] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-05-16 16:35:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:02] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 16:35:02] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-01 in 2647 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-05
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:35:02] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1261 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 846 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:35:02] [INFO ] Computed 7 place invariants in 3 ms
[2022-05-16 16:35:02] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:02] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:35:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:02] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-16 16:35:02] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 16:35:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:02] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 16:35:02] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2022-05-16 16:35:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2022-05-16 16:35:02] [INFO ] Added : 43 causal constraints over 9 iterations in 82 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 10900 steps, including 1569 resets, run finished after 11 ms. (steps per millisecond=990 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 48/48 places, 45/45 transitions.
Graph (complete) has 140 edges and 48 vertex of which 47 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 47 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 46 transition count 44
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 11 place count 42 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 41 transition count 40
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 41 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 40 transition count 39
Applied a total of 15 rules in 8 ms. Remains 40 /48 variables (removed 8) and now considering 39/45 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/48 places, 39/45 transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:02] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 156337 resets, run finished after 637 ms. (steps per millisecond=1569 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96347 resets, run finished after 388 ms. (steps per millisecond=2577 ) properties (out of 1) seen :0
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:03] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:03] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:03] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:03] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-16 16:35:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:04] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:04] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-16 16:35:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 16:35:04] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:04] [INFO ] Computed and/alt/rep : 37/182/37 causal constraints (skipped 1 transitions) in 2 ms.
[2022-05-16 16:35:04] [INFO ] Added : 35 causal constraints over 7 iterations in 38 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 11100 steps, including 1509 resets, run finished after 13 ms. (steps per millisecond=853 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
Starting structural reductions, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:04] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:04] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:04] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 16:35:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 16:35:04] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2022-05-16 16:35:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:04] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:04] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-05 in 1460 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-06
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:35:04] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1224 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10000 steps, including 831 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :4
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:35:04] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:04] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:04] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:35:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:04] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:04] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:35:04] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 16:35:04] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-16 16:35:04] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 16:35:04] [INFO ] Deduced a trap composed of 5 places in 9 ms of which 0 ms to minimize.
[2022-05-16 16:35:04] [INFO ] Deduced a trap composed of 13 places in 11 ms of which 1 ms to minimize.
[2022-05-16 16:35:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 46 ms
[2022-05-16 16:35:04] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 16:35:04] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2022-05-16 16:35:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-05-16 16:35:04] [INFO ] Added : 42 causal constraints over 9 iterations in 81 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 5900 steps, including 874 resets, run finished after 8 ms. (steps per millisecond=737 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 48/48 places, 45/45 transitions.
Graph (complete) has 140 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 46 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 45 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 42 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 41 transition count 39
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 41 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 40 transition count 38
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 15 place count 40 transition count 38
Applied a total of 15 rules in 10 ms. Remains 40 /48 variables (removed 8) and now considering 38/45 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/48 places, 38/45 transitions.
// Phase 1: matrix 38 rows 40 cols
[2022-05-16 16:35:04] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 155912 resets, run finished after 532 ms. (steps per millisecond=1879 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000001 steps, including 96054 resets, run finished after 390 ms. (steps per millisecond=2564 ) properties (out of 1) seen :4
// Phase 1: matrix 38 rows 40 cols
[2022-05-16 16:35:05] [INFO ] Computed 7 place invariants in 5 ms
[2022-05-16 16:35:05] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:05] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-16 16:35:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 16:35:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:05] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:05] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:05] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:35:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 16:35:05] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2022-05-16 16:35:05] [INFO ] Computed and/alt/rep : 36/170/36 causal constraints (skipped 1 transitions) in 3 ms.
[2022-05-16 16:35:05] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2022-05-16 16:35:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2022-05-16 16:35:05] [INFO ] Added : 29 causal constraints over 6 iterations in 68 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 8300 steps, including 1422 resets, run finished after 10 ms. (steps per millisecond=830 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 40/40 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 38/38 transitions.
Starting structural reductions, iteration 0 : 40/40 places, 38/38 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 40 cols
[2022-05-16 16:35:05] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 16:35:05] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 38 rows 40 cols
[2022-05-16 16:35:05] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:05] [INFO ] State equation strengthened by 8 read => feed constraints.
[2022-05-16 16:35:05] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-16 16:35:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 38 rows 40 cols
[2022-05-16 16:35:05] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:05] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 38/38 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-06 in 1447 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-09
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:35:05] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1265 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 834 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:35:05] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 16:35:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:05] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:05] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:35:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-16 16:35:05] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 0 ms returned sat
[2022-05-16 16:35:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:05] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 16:35:05] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 16:35:05] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:05] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 16:35:05] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2022-05-16 16:35:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-16 16:35:05] [INFO ] Added : 38 causal constraints over 8 iterations in 77 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 9200 steps, including 1301 resets, run finished after 11 ms. (steps per millisecond=836 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 48/48 places, 45/45 transitions.
Graph (complete) has 140 edges and 48 vertex of which 45 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 45 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 44 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 41 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 40 transition count 39
Applied a total of 12 rules in 5 ms. Remains 40 /48 variables (removed 8) and now considering 39/45 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/48 places, 39/45 transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:05] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 155941 resets, run finished after 546 ms. (steps per millisecond=1831 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95835 resets, run finished after 393 ms. (steps per millisecond=2544 ) properties (out of 1) seen :0
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:06] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:06] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:06] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-16 16:35:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 16:35:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:06] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:06] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-05-16 16:35:06] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 16:35:06] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:06] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2022-05-16 16:35:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2022-05-16 16:35:06] [INFO ] Computed and/alt/rep : 37/178/37 causal constraints (skipped 1 transitions) in 3 ms.
[2022-05-16 16:35:06] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2022-05-16 16:35:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2022-05-16 16:35:06] [INFO ] Added : 35 causal constraints over 7 iterations in 71 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 7600 steps, including 1091 resets, run finished after 12 ms. (steps per millisecond=633 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
Starting structural reductions, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:06] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:06] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:07] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-16 16:35:07] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 16:35:07] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2022-05-16 16:35:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:07] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 16:35:07] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-09 in 1427 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-11
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:35:07] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 1254 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 808 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:35:07] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 16:35:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:07] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 17 ms returned sat
[2022-05-16 16:35:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:07] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 16:35:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:07] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-16 16:35:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:07] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-16 16:35:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 16:35:07] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2022-05-16 16:35:07] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 16:35:07] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2022-05-16 16:35:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2022-05-16 16:35:07] [INFO ] Added : 40 causal constraints over 8 iterations in 78 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 9200 steps, including 1321 resets, run finished after 6 ms. (steps per millisecond=1533 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 48/48 places, 45/45 transitions.
Graph (complete) has 140 edges and 48 vertex of which 45 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 45 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 44 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 41 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 40 transition count 39
Applied a total of 12 rules in 5 ms. Remains 40 /48 variables (removed 8) and now considering 39/45 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/48 places, 39/45 transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:07] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 156011 resets, run finished after 550 ms. (steps per millisecond=1818 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96299 resets, run finished after 367 ms. (steps per millisecond=2724 ) properties (out of 1) seen :0
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:08] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:08] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:08] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 16:35:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:08] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-16 16:35:08] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 16:35:08] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:08] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2022-05-16 16:35:08] [INFO ] Deduced a trap composed of 4 places in 10 ms of which 1 ms to minimize.
[2022-05-16 16:35:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 32 ms
[2022-05-16 16:35:08] [INFO ] Computed and/alt/rep : 37/174/37 causal constraints (skipped 1 transitions) in 3 ms.
[2022-05-16 16:35:08] [INFO ] Added : 34 causal constraints over 7 iterations in 42 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 10800 steps, including 2046 resets, run finished after 8 ms. (steps per millisecond=1350 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
Starting structural reductions, iteration 0 : 40/40 places, 39/39 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 39/39 (removed 0) transitions.
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:08] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:08] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:08] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:08] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-16 16:35:08] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2022-05-16 16:35:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 39 rows 40 cols
[2022-05-16 16:35:08] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:08] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 39/39 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-11 in 1410 ms.
Starting property specific reduction for DoubleExponent-PT-002-UpperBounds-13
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:35:08] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 1243 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10000 steps, including 830 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :4
// Phase 1: matrix 45 rows 48 cols
[2022-05-16 16:35:08] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Real]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:08] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:35:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:08] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:35:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-16 16:35:08] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:08] [INFO ] Deduced a trap composed of 7 places in 13 ms of which 0 ms to minimize.
[2022-05-16 16:35:08] [INFO ] Deduced a trap composed of 5 places in 7 ms of which 0 ms to minimize.
[2022-05-16 16:35:08] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-05-16 16:35:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 48 ms
[2022-05-16 16:35:08] [INFO ] Computed and/alt/rep : 44/160/44 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 16:35:08] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2022-05-16 16:35:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2022-05-16 16:35:08] [INFO ] Added : 36 causal constraints over 8 iterations in 80 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 7000 steps, including 1040 resets, run finished after 8 ms. (steps per millisecond=875 ) properties (out of 1) seen :4 could not realise parikh vector
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 48/48 places, 45/45 transitions.
Graph (complete) has 140 edges and 48 vertex of which 45 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 43
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 10 place count 41 transition count 39
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 41 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 40 transition count 38
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 40 transition count 38
Applied a total of 13 rules in 6 ms. Remains 40 /48 variables (removed 8) and now considering 38/45 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/48 places, 38/45 transitions.
// Phase 1: matrix 38 rows 40 cols
[2022-05-16 16:35:08] [INFO ] Computed 7 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 125229 resets, run finished after 496 ms. (steps per millisecond=2016 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 1000000 steps, including 83414 resets, run finished after 410 ms. (steps per millisecond=2439 ) properties (out of 1) seen :4
// Phase 1: matrix 38 rows 40 cols
[2022-05-16 16:35:09] [INFO ] Computed 7 place invariants in 2 ms
[2022-05-16 16:35:09] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 16:35:09] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 16:35:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:09] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 16:35:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 16:35:09] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-16 16:35:09] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-16 16:35:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 16:35:09] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-16 16:35:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-16 16:35:09] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2022-05-16 16:35:09] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2022-05-16 16:35:09] [INFO ] Deduced a trap composed of 15 places in 14 ms of which 1 ms to minimize.
[2022-05-16 16:35:09] [INFO ] Deduced a trap composed of 13 places in 12 ms of which 0 ms to minimize.
[2022-05-16 16:35:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 55 ms
[2022-05-16 16:35:09] [INFO ] Computed and/alt/rep : 37/166/37 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 16:35:09] [INFO ] Added : 31 causal constraints over 7 iterations in 37 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 4400 steps, including 740 resets, run finished after 6 ms. (steps per millisecond=733 ) properties (out of 1) seen :3 could not realise parikh vector
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 40/40 places, 38/38 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 38/38 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 38/38 transitions.
Starting structural reductions, iteration 0 : 40/40 places, 38/38 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 38/38 (removed 0) transitions.
// Phase 1: matrix 38 rows 40 cols
[2022-05-16 16:35:09] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:09] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 38 rows 40 cols
[2022-05-16 16:35:09] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 16:35:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2022-05-16 16:35:09] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2022-05-16 16:35:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 38 rows 40 cols
[2022-05-16 16:35:09] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 16:35:09] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 38/38 transitions.
Ending property specific reduction for DoubleExponent-PT-002-UpperBounds-13 in 1436 ms.
[2022-05-16 16:35:10] [INFO ] Flatten gal took : 30 ms
[2022-05-16 16:35:10] [INFO ] Applying decomposition
[2022-05-16 16:35:10] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8432974037959710909.txt, -o, /tmp/graph8432974037959710909.bin, -w, /tmp/graph8432974037959710909.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8432974037959710909.bin, -l, -1, -v, -w, /tmp/graph8432974037959710909.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 16:35:10] [INFO ] Decomposing Gal with order
[2022-05-16 16:35:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 16:35:10] [INFO ] Removed a total of 17 redundant transitions.
[2022-05-16 16:35:10] [INFO ] Flatten gal took : 71 ms
[2022-05-16 16:35:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2022-05-16 16:35:10] [INFO ] Time to serialize gal into /tmp/UpperBounds12650001253009381357.gal : 7 ms
[2022-05-16 16:35:10] [INFO ] Time to serialize properties into /tmp/UpperBounds14283270165715293253.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds12650001253009381357.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14283270165715293253.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds12650001253009381357.gal -t CGAL -reachable-file /tmp/UpperBounds14283270165715293253.prop --nowitness
Loading property file /tmp/UpperBounds14283270165715293253.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,1265,0.095159,7252,406,234,7030,1469,214,8059,86,5574,0
Total reachable state count : 1265

Verifying 6 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DoubleExponent-PT-002-UpperBounds-01 :0 <= i6.u10.p60 <= 4
FORMULA DoubleExponent-PT-002-UpperBounds-01 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-002-UpperBounds-01,0,0.100113,7252,1,0,7030,1469,285,8059,106,5574,504
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-002-UpperBounds-05 :0 <= i1.u1.p96 <= 1
FORMULA DoubleExponent-PT-002-UpperBounds-05 1 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
DoubleExponent-PT-002-UpperBounds-05,0,0.102101,7252,1,0,7030,1469,309,8059,106,5574,629
Min sum of variable value : 0
Maximum sum along a path : 16
Bounds property DoubleExponent-PT-002-UpperBounds-06 :0 <= i4.u6.p108 <= 16
FORMULA DoubleExponent-PT-002-UpperBounds-06 16 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
DoubleExponent-PT-002-UpperBounds-06,0,0.103773,7252,1,0,7030,1469,329,8059,128,5574,833
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-002-UpperBounds-09 :0 <= i6.u10.p93 <= 1
FORMULA DoubleExponent-PT-002-UpperBounds-09 1 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
DoubleExponent-PT-002-UpperBounds-09,0,0.104508,7252,1,0,7030,1469,347,8059,128,5574,915
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DoubleExponent-PT-002-UpperBounds-11 :0 <= i6.u9.p94 <= 1
FORMULA DoubleExponent-PT-002-UpperBounds-11 1 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
DoubleExponent-PT-002-UpperBounds-11,0,0.10516,7252,1,0,7030,1469,365,8059,130,5574,1000
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DoubleExponent-PT-002-UpperBounds-13 :0 <= u5.p55 <= 4
FORMULA DoubleExponent-PT-002-UpperBounds-13 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DoubleExponent-PT-002-UpperBounds-13,0,0.105802,7252,1,0,7030,1469,378,8059,144,5574,1039
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1652718911459

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-002"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is DoubleExponent-PT-002, 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 r089-tall-165260117600064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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