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.r143-tall-165271830200067.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 JoinFreeModules-PT-0050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-tall-165271830200067
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 8.0K Apr 30 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 30 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Apr 30 02:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 02:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 152K May 10 09:34 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 JoinFreeModules-PT-0050-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652739545932

Running Version 0
[2022-05-16 22:19:07] [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 22:19:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 22:19:07] [INFO ] Load time of PNML (sax parser for PT used): 191 ms
[2022-05-16 22:19:07] [INFO ] Transformed 251 places.
[2022-05-16 22:19:07] [INFO ] Transformed 401 transitions.
[2022-05-16 22:19:07] [INFO ] Parsed PT model containing 251 places and 401 transitions in 231 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 401 rows 250 cols
[2022-05-16 22:19:07] [INFO ] Computed 50 place invariants in 21 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 16) seen :563
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :169
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 16) seen :168
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :172
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :190
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :197
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :213
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :173
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 16) seen :169
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :197
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :170
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :213
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :214
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 16) seen :197
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 16) seen :172
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :197
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :171
// Phase 1: matrix 401 rows 250 cols
[2022-05-16 22:19:08] [INFO ] Computed 50 place invariants in 14 ms
[2022-05-16 22:19:08] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2022-05-16 22:19:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:08] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2022-05-16 22:19:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:08] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2022-05-16 22:19:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:09] [INFO ] [Nat]Absence check using state equation in 267 ms returned sat
[2022-05-16 22:19:09] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 3 ms to minimize.
[2022-05-16 22:19:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-16 22:19:09] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 3 ms to minimize.
[2022-05-16 22:19:09] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-16 22:19:09] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-05-16 22:19:09] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 258 ms
[2022-05-16 22:19:09] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 24 ms.
[2022-05-16 22:19:10] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2022-05-16 22:19:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-05-16 22:19:10] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:19:10] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:19:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 233 ms
[2022-05-16 22:19:10] [INFO ] Added : 154 causal constraints over 32 iterations in 1432 ms. Result :sat
Minimization took 158 ms.
[2022-05-16 22:19:10] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-16 22:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:11] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2022-05-16 22:19:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-16 22:19:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:11] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2022-05-16 22:19:11] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:19:11] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:19:11] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:19:11] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:19:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 159 ms
[2022-05-16 22:19:11] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-16 22:19:12] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-16 22:19:12] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:19:12] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:19:12] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:19:12] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-05-16 22:19:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 231 ms
[2022-05-16 22:19:12] [INFO ] Added : 152 causal constraints over 31 iterations in 1445 ms. Result :sat
Minimization took 144 ms.
[2022-05-16 22:19:13] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2022-05-16 22:19:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:13] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2022-05-16 22:19:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:13] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-16 22:19:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:13] [INFO ] [Nat]Absence check using state equation in 232 ms returned sat
[2022-05-16 22:19:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-16 22:19:13] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:19:13] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2022-05-16 22:19:13] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:19:13] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2022-05-16 22:19:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 184 ms
[2022-05-16 22:19:13] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-16 22:19:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2022-05-16 22:19:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2022-05-16 22:19:14] [INFO ] Added : 157 causal constraints over 33 iterations in 1099 ms. Result :sat
Minimization took 152 ms.
[2022-05-16 22:19:14] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2022-05-16 22:19:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:15] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2022-05-16 22:19:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:15] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-16 22:19:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:15] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2022-05-16 22:19:15] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-16 22:19:15] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-05-16 22:19:15] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2022-05-16 22:19:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 116 ms
[2022-05-16 22:19:15] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-16 22:19:16] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-16 22:19:16] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2022-05-16 22:19:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2022-05-16 22:19:16] [INFO ] Added : 140 causal constraints over 29 iterations in 1075 ms. Result :sat
Minimization took 216 ms.
[2022-05-16 22:19:16] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-16 22:19:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:16] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2022-05-16 22:19:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:16] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-16 22:19:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:17] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2022-05-16 22:19:17] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-16 22:19:17] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:19:17] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:19:17] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:19:17] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:19:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 203 ms
[2022-05-16 22:19:17] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 24 ms.
[2022-05-16 22:19:18] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:19:18] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2022-05-16 22:19:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 107 ms
[2022-05-16 22:19:18] [INFO ] Added : 129 causal constraints over 27 iterations in 923 ms. Result :sat
Minimization took 84 ms.
[2022-05-16 22:19:18] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-16 22:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:18] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2022-05-16 22:19:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:18] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-16 22:19:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:18] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2022-05-16 22:19:18] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:19:18] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2022-05-16 22:19:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2022-05-16 22:19:18] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 22 ms.
[2022-05-16 22:19:19] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:19:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2022-05-16 22:19:19] [INFO ] Added : 137 causal constraints over 29 iterations in 1038 ms. Result :sat
Minimization took 103 ms.
[2022-05-16 22:19:20] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-16 22:19:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:20] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2022-05-16 22:19:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:20] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-16 22:19:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:20] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2022-05-16 22:19:20] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:19:20] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:19:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 73 ms
[2022-05-16 22:19:20] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 24 ms.
[2022-05-16 22:19:21] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:19:21] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:19:21] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:19:21] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:19:21] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:19:21] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 228 ms
[2022-05-16 22:19:21] [INFO ] Added : 130 causal constraints over 28 iterations in 1147 ms. Result :sat
Minimization took 237 ms.
[2022-05-16 22:19:21] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-16 22:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:22] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2022-05-16 22:19:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:22] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-16 22:19:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:22] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2022-05-16 22:19:22] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-16 22:19:22] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-16 22:19:22] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2022-05-16 22:19:22] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-16 22:19:22] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-16 22:19:22] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-16 22:19:22] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:19:22] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:19:22] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2022-05-16 22:19:22] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:19:22] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 4 ms to minimize.
[2022-05-16 22:19:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 427 ms
[2022-05-16 22:19:22] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-16 22:19:23] [INFO ] Added : 117 causal constraints over 25 iterations in 806 ms. Result :sat
Minimization took 109 ms.
[2022-05-16 22:19:23] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-16 22:19:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:23] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2022-05-16 22:19:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:23] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2022-05-16 22:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:24] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2022-05-16 22:19:24] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2022-05-16 22:19:24] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-05-16 22:19:24] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-05-16 22:19:24] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-05-16 22:19:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 138 ms
[2022-05-16 22:19:24] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 31 ms.
[2022-05-16 22:19:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-05-16 22:19:25] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:19:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2022-05-16 22:19:26] [INFO ] Added : 153 causal constraints over 33 iterations in 1673 ms. Result :sat
Minimization took 122 ms.
[2022-05-16 22:19:26] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-16 22:19:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:26] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2022-05-16 22:19:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-16 22:19:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:26] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2022-05-16 22:19:26] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-16 22:19:26] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:19:26] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:19:26] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:19:26] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2022-05-16 22:19:26] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2022-05-16 22:19:26] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 203 ms
[2022-05-16 22:19:26] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 31 ms.
[2022-05-16 22:19:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 9 ms to minimize.
[2022-05-16 22:19:27] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:19:28] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2022-05-16 22:19:28] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:19:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 191 ms
[2022-05-16 22:19:28] [INFO ] Added : 154 causal constraints over 32 iterations in 1349 ms. Result :sat
Minimization took 138 ms.
[2022-05-16 22:19:28] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-16 22:19:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:28] [INFO ] [Real]Absence check using state equation in 75 ms returned sat
[2022-05-16 22:19:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:28] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2022-05-16 22:19:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:28] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2022-05-16 22:19:28] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:19:28] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:19:28] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:19:28] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2022-05-16 22:19:28] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-05-16 22:19:28] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2022-05-16 22:19:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 206 ms
[2022-05-16 22:19:28] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-16 22:19:29] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-05-16 22:19:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2022-05-16 22:19:29] [INFO ] Added : 127 causal constraints over 26 iterations in 909 ms. Result :sat
Minimization took 125 ms.
[2022-05-16 22:19:29] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-16 22:19:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:30] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2022-05-16 22:19:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:30] [INFO ] [Nat]Absence check using 50 positive place invariants in 6 ms returned sat
[2022-05-16 22:19:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:30] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2022-05-16 22:19:30] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-05-16 22:19:30] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:19:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2022-05-16 22:19:30] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-16 22:19:31] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:19:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2022-05-16 22:19:31] [INFO ] Added : 102 causal constraints over 21 iterations in 769 ms. Result :sat
Minimization took 122 ms.
[2022-05-16 22:19:31] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-16 22:19:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:31] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2022-05-16 22:19:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:31] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-16 22:19:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:31] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2022-05-16 22:19:31] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2022-05-16 22:19:31] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2022-05-16 22:19:31] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:19:31] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:19:31] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-05-16 22:19:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 154 ms
[2022-05-16 22:19:31] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 17 ms.
[2022-05-16 22:19:32] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-05-16 22:19:32] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:19:32] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2022-05-16 22:19:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 131 ms
[2022-05-16 22:19:33] [INFO ] Added : 152 causal constraints over 32 iterations in 1205 ms. Result :sat
Minimization took 106 ms.
[2022-05-16 22:19:33] [INFO ] [Real]Absence check using 50 positive place invariants in 20 ms returned sat
[2022-05-16 22:19:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:33] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2022-05-16 22:19:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:33] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-16 22:19:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:33] [INFO ] [Nat]Absence check using state equation in 242 ms returned sat
[2022-05-16 22:19:33] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:19:33] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2022-05-16 22:19:33] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:19:33] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-05-16 22:19:33] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:19:33] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:19:33] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 189 ms
[2022-05-16 22:19:33] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 21 ms.
[2022-05-16 22:19:34] [INFO ] Added : 133 causal constraints over 28 iterations in 859 ms. Result :sat
Minimization took 208 ms.
[2022-05-16 22:19:34] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-16 22:19:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:34] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2022-05-16 22:19:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:35] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-16 22:19:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:35] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2022-05-16 22:19:35] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2022-05-16 22:19:35] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:19:35] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-05-16 22:19:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 116 ms
[2022-05-16 22:19:35] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-16 22:19:35] [INFO ] Added : 76 causal constraints over 17 iterations in 496 ms. Result :sat
Minimization took 198 ms.
[2022-05-16 22:19:36] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2022-05-16 22:19:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:36] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2022-05-16 22:19:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:36] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2022-05-16 22:19:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:37] [INFO ] [Nat]Absence check using state equation in 1308 ms returned sat
[2022-05-16 22:19:37] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:19:37] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:19:37] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:19:37] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:19:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 156 ms
[2022-05-16 22:19:37] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-16 22:19:39] [INFO ] Added : 178 causal constraints over 37 iterations in 1653 ms. Result :sat
Minimization took 174 ms.
Current structural bounds on expressions (after SMT) : [53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53] Max seen :[50, 50, 27, 42, 51, 49, 12, 50, 51, 27, 49, 49, 51, 27, 34, 26]
Incomplete Parikh walk after 50800 steps, including 119 resets, run finished after 337 ms. (steps per millisecond=150 ) properties (out of 16) seen :236 could not realise parikh vector
Incomplete Parikh walk after 38000 steps, including 114 resets, run finished after 150 ms. (steps per millisecond=253 ) properties (out of 16) seen :225 could not realise parikh vector
Incomplete Parikh walk after 53900 steps, including 111 resets, run finished after 280 ms. (steps per millisecond=192 ) properties (out of 16) seen :248 could not realise parikh vector
Incomplete Parikh walk after 46700 steps, including 136 resets, run finished after 290 ms. (steps per millisecond=161 ) properties (out of 16) seen :244 could not realise parikh vector
Incomplete Parikh walk after 57300 steps, including 115 resets, run finished after 267 ms. (steps per millisecond=214 ) properties (out of 16) seen :237 could not realise parikh vector
Incomplete Parikh walk after 36000 steps, including 130 resets, run finished after 199 ms. (steps per millisecond=180 ) properties (out of 16) seen :246 could not realise parikh vector
Incomplete Parikh walk after 56600 steps, including 121 resets, run finished after 308 ms. (steps per millisecond=183 ) properties (out of 16) seen :294 could not realise parikh vector
Incomplete Parikh walk after 39500 steps, including 110 resets, run finished after 220 ms. (steps per millisecond=179 ) properties (out of 16) seen :243 could not realise parikh vector
Incomplete Parikh walk after 30200 steps, including 135 resets, run finished after 166 ms. (steps per millisecond=181 ) properties (out of 16) seen :194 could not realise parikh vector
Incomplete Parikh walk after 78500 steps, including 119 resets, run finished after 359 ms. (steps per millisecond=218 ) properties (out of 16) seen :243 could not realise parikh vector
Incomplete Parikh walk after 34200 steps, including 114 resets, run finished after 186 ms. (steps per millisecond=183 ) properties (out of 16) seen :237 could not realise parikh vector
FORMULA JoinFreeModules-PT-0050-UpperBounds-05 53 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 32600 steps, including 127 resets, run finished after 180 ms. (steps per millisecond=181 ) properties (out of 15) seen :230 could not realise parikh vector
Incomplete Parikh walk after 61700 steps, including 112 resets, run finished after 286 ms. (steps per millisecond=215 ) properties (out of 15) seen :279 could not realise parikh vector
Incomplete Parikh walk after 46400 steps, including 117 resets, run finished after 236 ms. (steps per millisecond=196 ) properties (out of 15) seen :226 could not realise parikh vector
Incomplete Parikh walk after 30600 steps, including 150 resets, run finished after 182 ms. (steps per millisecond=168 ) properties (out of 15) seen :190 could not realise parikh vector
Incomplete Parikh walk after 32600 steps, including 132 resets, run finished after 193 ms. (steps per millisecond=168 ) properties (out of 15) seen :184 could not realise parikh vector
Support contains 15 out of 250 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 250/250 places, 401/401 transitions.
Graph (complete) has 600 edges and 250 vertex of which 65 are kept as prefixes of interest. Removing 185 places using SCC suffix rule.6 ms
Discarding 185 places :
Also discarding 296 output transitions
Drop transitions removed 296 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 65 transition count 104
Applied a total of 2 rules in 21 ms. Remains 65 /250 variables (removed 185) and now considering 104/401 (removed 297) transitions.
// Phase 1: matrix 104 rows 65 cols
[2022-05-16 22:19:43] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 22:19:43] [INFO ] Dead Transitions using invariants and state equation in 71 ms returned []
Finished structural reductions, in 1 iterations. Remains : 65/250 places, 104/401 transitions.
// Phase 1: matrix 104 rows 65 cols
[2022-05-16 22:19:43] [INFO ] Computed 13 place invariants in 0 ms
Incomplete random walk after 1000011 steps, including 2 resets, run finished after 1304 ms. (steps per millisecond=766 ) properties (out of 15) seen :764
FORMULA JoinFreeModules-PT-0050-UpperBounds-11 53 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-10 53 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1009 ms. (steps per millisecond=991 ) properties (out of 13) seen :438
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1008 ms. (steps per millisecond=992 ) properties (out of 13) seen :444
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1014 ms. (steps per millisecond=986 ) properties (out of 13) seen :480
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1008 ms. (steps per millisecond=992 ) properties (out of 13) seen :489
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 995 ms. (steps per millisecond=1005 ) properties (out of 13) seen :456
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1006 ms. (steps per millisecond=994 ) properties (out of 13) seen :499
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1006 ms. (steps per millisecond=994 ) properties (out of 13) seen :413
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 997 ms. (steps per millisecond=1003 ) properties (out of 13) seen :445
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1018 ms. (steps per millisecond=982 ) properties (out of 13) seen :501
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 992 ms. (steps per millisecond=1008 ) properties (out of 13) seen :452
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1025 ms. (steps per millisecond=975 ) properties (out of 13) seen :485
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 995 ms. (steps per millisecond=1005 ) properties (out of 13) seen :459
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1006 ms. (steps per millisecond=994 ) properties (out of 13) seen :493
// Phase 1: matrix 104 rows 65 cols
[2022-05-16 22:19:57] [INFO ] Computed 13 place invariants in 4 ms
[2022-05-16 22:19:57] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-16 22:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:57] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:19:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-16 22:19:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:57] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2022-05-16 22:19:57] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:19:58] [INFO ] Added : 33 causal constraints over 9 iterations in 124 ms. Result :sat
Minimization took 37 ms.
[2022-05-16 22:19:58] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-16 22:19:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:19:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-16 22:19:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:58] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2022-05-16 22:19:58] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 22:19:58] [INFO ] Added : 20 causal constraints over 4 iterations in 53 ms. Result :sat
Minimization took 20 ms.
[2022-05-16 22:19:58] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-16 22:19:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:58] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:19:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-16 22:19:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:58] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2022-05-16 22:19:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2022-05-16 22:19:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
[2022-05-16 22:19:58] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-16 22:19:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:58] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:19:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-16 22:19:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:58] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2022-05-16 22:19:58] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2022-05-16 22:19:58] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-05-16 22:19:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 36 ms
[2022-05-16 22:19:58] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:19:58] [INFO ] Added : 38 causal constraints over 8 iterations in 103 ms. Result :sat
Minimization took 38 ms.
[2022-05-16 22:19:58] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-16 22:19:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:58] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2022-05-16 22:19:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-16 22:19:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:58] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2022-05-16 22:19:59] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:19:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2022-05-16 22:19:59] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:19:59] [INFO ] Added : 18 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 24 ms.
[2022-05-16 22:19:59] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-16 22:19:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:59] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-05-16 22:19:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-16 22:19:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:59] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2022-05-16 22:19:59] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:19:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 13 ms
[2022-05-16 22:19:59] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-16 22:19:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:59] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 22:19:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-16 22:19:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:59] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2022-05-16 22:19:59] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:19:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2022-05-16 22:19:59] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:19:59] [INFO ] Added : 18 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 18 ms.
[2022-05-16 22:19:59] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-16 22:19:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:59] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:19:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-16 22:19:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:59] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2022-05-16 22:19:59] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 22:19:59] [INFO ] Added : 32 causal constraints over 9 iterations in 204 ms. Result :sat
Minimization took 32 ms.
[2022-05-16 22:19:59] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-16 22:19:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:59] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:20:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-16 22:20:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:00] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2022-05-16 22:20:00] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:20:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2022-05-16 22:20:00] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-16 22:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:00] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:20:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-16 22:20:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:00] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2022-05-16 22:20:00] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2022-05-16 22:20:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2022-05-16 22:20:00] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:20:00] [INFO ] Added : 32 causal constraints over 8 iterations in 98 ms. Result :sat
Minimization took 24 ms.
[2022-05-16 22:20:00] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-16 22:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:00] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:20:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-16 22:20:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:00] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2022-05-16 22:20:00] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:20:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 12 ms
[2022-05-16 22:20:00] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-16 22:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:00] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 22:20:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-16 22:20:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:00] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-16 22:20:00] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:20:00] [INFO ] Added : 24 causal constraints over 6 iterations in 66 ms. Result :sat
Minimization took 25 ms.
[2022-05-16 22:20:00] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2022-05-16 22:20:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:00] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 22:20:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2022-05-16 22:20:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:00] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2022-05-16 22:20:00] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2022-05-16 22:20:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 11 ms
Current structural bounds on expressions (after SMT) : [53, 53, 52, 53, 53, 52, 53, 53, 52, 53, 52, 53, 52] Max seen :[50, 50, 52, 51, 51, 52, 50, 51, 52, 51, 52, 51, 52]
FORMULA JoinFreeModules-PT-0050-UpperBounds-15 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-13 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-09 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-06 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-02 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 9800 steps, including 108 resets, run finished after 18 ms. (steps per millisecond=544 ) properties (out of 8) seen :206 could not realise parikh vector
Incomplete Parikh walk after 20900 steps, including 113 resets, run finished after 38 ms. (steps per millisecond=550 ) properties (out of 8) seen :210 could not realise parikh vector
Incomplete Parikh walk after 12800 steps, including 110 resets, run finished after 23 ms. (steps per millisecond=556 ) properties (out of 8) seen :215 could not realise parikh vector
Incomplete Parikh walk after 12200 steps, including 128 resets, run finished after 30 ms. (steps per millisecond=406 ) properties (out of 8) seen :172 could not realise parikh vector
Incomplete Parikh walk after 9700 steps, including 109 resets, run finished after 15 ms. (steps per millisecond=646 ) properties (out of 8) seen :206 could not realise parikh vector
Incomplete Parikh walk after 25100 steps, including 117 resets, run finished after 42 ms. (steps per millisecond=597 ) properties (out of 8) seen :215 could not realise parikh vector
Incomplete Parikh walk after 13400 steps, including 128 resets, run finished after 23 ms. (steps per millisecond=582 ) properties (out of 8) seen :159 could not realise parikh vector
Incomplete Parikh walk after 14400 steps, including 121 resets, run finished after 29 ms. (steps per millisecond=496 ) properties (out of 8) seen :158 could not realise parikh vector
Support contains 8 out of 65 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 35 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 5 ms. Remains 35 /65 variables (removed 30) and now considering 56/104 (removed 48) transitions.
Finished structural reductions, in 1 iterations. Remains : 35/65 places, 56/104 transitions.
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:01] [INFO ] Computed 7 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 732 ms. (steps per millisecond=1366 ) properties (out of 8) seen :405
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 558 ms. (steps per millisecond=1792 ) properties (out of 8) seen :375
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 550 ms. (steps per millisecond=1818 ) properties (out of 8) seen :377
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 553 ms. (steps per millisecond=1808 ) properties (out of 8) seen :402
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 543 ms. (steps per millisecond=1841 ) properties (out of 8) seen :371
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 561 ms. (steps per millisecond=1782 ) properties (out of 8) seen :315
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 542 ms. (steps per millisecond=1845 ) properties (out of 8) seen :366
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 568 ms. (steps per millisecond=1760 ) properties (out of 8) seen :366
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 543 ms. (steps per millisecond=1841 ) properties (out of 8) seen :372
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:06] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 22:20:06] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 22:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:20:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:06] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:20:06] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:20:06] [INFO ] Added : 36 causal constraints over 8 iterations in 54 ms. Result :sat
Minimization took 29 ms.
[2022-05-16 22:20:06] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 22:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:06] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 22:20:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:06] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 22:20:06] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:20:06] [INFO ] Added : 24 causal constraints over 5 iterations in 62 ms. Result :sat
Minimization took 19 ms.
[2022-05-16 22:20:06] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 22:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:20:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:06] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:20:06] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:20:06] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:20:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2022-05-16 22:20:06] [INFO ] Added : 18 causal constraints over 5 iterations in 99 ms. Result :sat
Minimization took 26 ms.
[2022-05-16 22:20:06] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 22:20:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:06] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-16 22:20:06] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:20:06] [INFO ] Added : 23 causal constraints over 5 iterations in 28 ms. Result :sat
Minimization took 24 ms.
[2022-05-16 22:20:06] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 22:20:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:20:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:06] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-05-16 22:20:06] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:20:07] [INFO ] Added : 22 causal constraints over 6 iterations in 104 ms. Result :sat
Minimization took 16 ms.
[2022-05-16 22:20:07] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:07] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 22:20:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:07] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-05-16 22:20:07] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:20:07] [INFO ] Added : 18 causal constraints over 4 iterations in 23 ms. Result :sat
Minimization took 13 ms.
[2022-05-16 22:20:07] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:07] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 22:20:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:07] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 22:20:07] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:20:07] [INFO ] Added : 28 causal constraints over 6 iterations in 96 ms. Result :sat
Minimization took 18 ms.
[2022-05-16 22:20:07] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:07] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 22:20:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:07] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-05-16 22:20:07] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:20:07] [INFO ] Added : 20 causal constraints over 4 iterations in 25 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [53, 53, 53, 53, 53, 53, 53, 53] Max seen :[50, 50, 51, 51, 50, 51, 51, 51]
Incomplete Parikh walk after 9100 steps, including 109 resets, run finished after 17 ms. (steps per millisecond=535 ) properties (out of 8) seen :210 could not realise parikh vector
Incomplete Parikh walk after 13400 steps, including 105 resets, run finished after 17 ms. (steps per millisecond=788 ) properties (out of 8) seen :214 could not realise parikh vector
Incomplete Parikh walk after 35300 steps, including 110 resets, run finished after 42 ms. (steps per millisecond=840 ) properties (out of 8) seen :209 could not realise parikh vector
Incomplete Parikh walk after 5300 steps, including 120 resets, run finished after 9 ms. (steps per millisecond=588 ) properties (out of 8) seen :160 could not realise parikh vector
Incomplete Parikh walk after 10300 steps, including 112 resets, run finished after 13 ms. (steps per millisecond=792 ) properties (out of 8) seen :215 could not realise parikh vector
Incomplete Parikh walk after 15200 steps, including 119 resets, run finished after 21 ms. (steps per millisecond=723 ) properties (out of 8) seen :216 could not realise parikh vector
Incomplete Parikh walk after 4600 steps, including 140 resets, run finished after 7 ms. (steps per millisecond=657 ) properties (out of 8) seen :165 could not realise parikh vector
Incomplete Parikh walk after 10100 steps, including 144 resets, run finished after 19 ms. (steps per millisecond=531 ) properties (out of 8) seen :172 could not realise parikh vector
Support contains 8 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 56/56 transitions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:07] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 22:20:07] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:07] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 22:20:07] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2022-05-16 22:20:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:07] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 22:20:07] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 56/56 transitions.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-00
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:07] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :50
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:07] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 22:20:07] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:07] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 22:20:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 22:20:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:07] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:20:07] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:20:07] [INFO ] Added : 36 causal constraints over 8 iterations in 55 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[50]
Incomplete Parikh walk after 10100 steps, including 145 resets, run finished after 24 ms. (steps per millisecond=420 ) properties (out of 1) seen :50 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:07] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:07] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:07] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000008 steps, including 2 resets, run finished after 195 ms. (steps per millisecond=5128 ) properties (out of 1) seen :50
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=6329 ) properties (out of 1) seen :50
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:08] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:20:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:20:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:08] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:20:08] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2022-05-16 22:20:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6 ms
[2022-05-16 22:20:08] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:20:08] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[50]
Incomplete Parikh walk after 1200 steps, including 146 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :50 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:08] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:08] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2022-05-16 22:20:08] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:08] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:20:08] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-00 in 639 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-01
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:08] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10006 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :50
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:08] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 22:20:08] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:08] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 22:20:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:08] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 22:20:08] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:20:08] [INFO ] Added : 24 causal constraints over 5 iterations in 47 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[50]
Incomplete Parikh walk after 4600 steps, including 140 resets, run finished after 7 ms. (steps per millisecond=657 ) properties (out of 1) seen :50 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:08] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:08] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=5154 ) properties (out of 1) seen :50
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=6578 ) properties (out of 1) seen :50
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:08] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:20:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:20:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:08] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:20:08] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:20:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2022-05-16 22:20:08] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:20:08] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[50]
Incomplete Parikh walk after 1200 steps, including 146 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :50 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:08] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:08] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2022-05-16 22:20:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:08] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:08] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-01 in 613 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-03
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:08] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10010 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1001 ) properties (out of 1) seen :49
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :49
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:08] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 22:20:08] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 22:20:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:08] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 22:20:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:09] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-16 22:20:09] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:20:09] [INFO ] Added : 17 causal constraints over 4 iterations in 23 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[49]
Incomplete Parikh walk after 9100 steps, including 103 resets, run finished after 16 ms. (steps per millisecond=568 ) properties (out of 1) seen :50 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:09] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:09] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=5291 ) properties (out of 1) seen :52
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=7575 ) properties (out of 1) seen :50
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:09] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:20:09] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:09] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2022-05-16 22:20:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:09] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:20:09] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:20:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 9 ms
Current structural bounds on expressions (after SMT) : [52] Max seen :[52]
FORMULA JoinFreeModules-PT-0050-UpperBounds-03 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-03 in 515 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-04
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:09] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :51
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :51
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:09] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 22:20:09] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-16 22:20:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:09] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 22:20:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:09] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-05-16 22:20:09] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:20:09] [INFO ] Added : 23 causal constraints over 5 iterations in 27 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[51]
Incomplete Parikh walk after 10300 steps, including 112 resets, run finished after 17 ms. (steps per millisecond=605 ) properties (out of 1) seen :50 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:09] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:09] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:09] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 186 ms. (steps per millisecond=5376 ) properties (out of 1) seen :51
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=3937 ) properties (out of 1) seen :51
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:10] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2022-05-16 22:20:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:20:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:10] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:20:10] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 22:20:10] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[51]
Incomplete Parikh walk after 6100 steps, including 98 resets, run finished after 4 ms. (steps per millisecond=1525 ) properties (out of 1) seen :51 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:10] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:10] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2022-05-16 22:20:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:10] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-04 in 673 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-07
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:10] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :50
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:10] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 22:20:10] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-16 22:20:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 22:20:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:10] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-05-16 22:20:10] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:20:10] [INFO ] Added : 22 causal constraints over 6 iterations in 98 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[50]
Incomplete Parikh walk after 5300 steps, including 120 resets, run finished after 7 ms. (steps per millisecond=757 ) properties (out of 1) seen :50 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:10] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:10] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=5263 ) properties (out of 1) seen :50
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=4566 ) properties (out of 1) seen :50
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:10] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:20:10] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:20:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:10] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2022-05-16 22:20:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:20:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:10] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2022-05-16 22:20:10] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:20:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2022-05-16 22:20:10] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 22:20:10] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[50]
Incomplete Parikh walk after 1200 steps, including 144 resets, run finished after 1 ms. (steps per millisecond=1200 ) properties (out of 1) seen :50 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:10] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:20:10] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:10] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
[2022-05-16 22:20:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:10] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:10] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-07 in 744 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-08
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:10] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10007 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :46
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :51
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:10] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 22:20:10] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:10] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-16 22:20:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:10] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-05-16 22:20:10] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:20:10] [INFO ] Added : 18 causal constraints over 4 iterations in 28 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[51]
Incomplete Parikh walk after 35300 steps, including 109 resets, run finished after 41 ms. (steps per millisecond=860 ) properties (out of 1) seen :49 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:20:11] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:11] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=5263 ) properties (out of 1) seen :51
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=6578 ) properties (out of 1) seen :51
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:20:11] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:20:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:11] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:20:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:11] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-16 22:20:11] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:20:11] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[51]
Incomplete Parikh walk after 6100 steps, including 97 resets, run finished after 3 ms. (steps per millisecond=2033 ) properties (out of 1) seen :51 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:11] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:20:11] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:11] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2022-05-16 22:20:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:11] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-08 in 620 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-12
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:11] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10006 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :49
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :51
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:11] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-16 22:20:11] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:11] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:20:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:11] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:11] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-05-16 22:20:11] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:20:11] [INFO ] Added : 28 causal constraints over 6 iterations in 94 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[51]
Incomplete Parikh walk after 13400 steps, including 105 resets, run finished after 22 ms. (steps per millisecond=609 ) properties (out of 1) seen :50 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:11] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:11] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:11] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000009 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=5154 ) properties (out of 1) seen :51
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=6451 ) properties (out of 1) seen :51
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:12] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:20:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:12] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:20:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:20:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:12] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:20:12] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 22:20:12] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[51]
Incomplete Parikh walk after 6100 steps, including 98 resets, run finished after 4 ms. (steps per millisecond=1525 ) properties (out of 1) seen :51 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:12] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:12] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2022-05-16 22:20:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:12] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-12 in 654 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-14
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:12] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10003 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :51
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :51
// Phase 1: matrix 56 rows 35 cols
[2022-05-16 22:20:12] [INFO ] Computed 7 place invariants in 1 ms
[2022-05-16 22:20:12] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 22:20:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:12] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-16 22:20:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:12] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 22:20:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:12] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2022-05-16 22:20:12] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:20:12] [INFO ] Added : 20 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[51]
Incomplete Parikh walk after 9100 steps, including 109 resets, run finished after 9 ms. (steps per millisecond=1011 ) properties (out of 1) seen :51 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:12] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:12] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=5263 ) properties (out of 1) seen :51
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=6410 ) properties (out of 1) seen :51
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:12] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:20:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:12] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:20:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:20:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:20:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:20:12] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:20:12] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 22:20:12] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[51]
Incomplete Parikh walk after 6100 steps, including 98 resets, run finished after 4 ms. (steps per millisecond=1525 ) properties (out of 1) seen :51 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:12] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:12] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:20:12] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2022-05-16 22:20:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:20:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:20:12] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-14 in 612 ms.
[2022-05-16 22:20:12] [INFO ] Flatten gal took : 30 ms
[2022-05-16 22:20:12] [INFO ] Applying decomposition
[2022-05-16 22:20:12] [INFO ] Flatten gal took : 6 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/graph11252021772998279805.txt, -o, /tmp/graph11252021772998279805.bin, -w, /tmp/graph11252021772998279805.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/graph11252021772998279805.bin, -l, -1, -v, -w, /tmp/graph11252021772998279805.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 22:20:12] [INFO ] Decomposing Gal with order
[2022-05-16 22:20:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 22:20:12] [INFO ] Flatten gal took : 5 ms
[2022-05-16 22:20:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 22:20:13] [INFO ] Time to serialize gal into /tmp/UpperBounds1563074715720375118.gal : 2 ms
[2022-05-16 22:20:13] [INFO ] Time to serialize properties into /tmp/UpperBounds17444768078220383507.prop : 1 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/UpperBounds1563074715720375118.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17444768078220383507.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/UpperBounds1563074715720375118.gal -t CGAL -reachable-file /tmp/UpperBounds17444768078220383507.prop --nowitness
Loading property file /tmp/UpperBounds17444768078220383507.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.4666e+39,0.279633,9884,9,369,25,27126,31,0,56,30768,0
Total reachable state count : 1466602209811025824260771141498647347200

Verifying 7 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 50
Bounds property JoinFreeModules-PT-0050-UpperBounds-00 :0 <= u6.p188 <= 50
FORMULA JoinFreeModules-PT-0050-UpperBounds-00 50 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
JoinFreeModules-PT-0050-UpperBounds-00,0,0.28884,9884,1,0,41,27126,73,8,121,30768,65
Min sum of variable value : 0
Maximum sum along a path : 50
Bounds property JoinFreeModules-PT-0050-UpperBounds-01 :0 <= u4.p143 <= 50
FORMULA JoinFreeModules-PT-0050-UpperBounds-01 50 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
JoinFreeModules-PT-0050-UpperBounds-01,0,0.289049,9884,1,0,46,27126,89,8,121,30768,73
Min sum of variable value : 0
Maximum sum along a path : 51
Bounds property JoinFreeModules-PT-0050-UpperBounds-04 :0 <= u3.p112 <= 51
FORMULA JoinFreeModules-PT-0050-UpperBounds-04 51 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
JoinFreeModules-PT-0050-UpperBounds-04,0,0.307291,9884,1,0,52,27126,104,8,183,30768,83
Min sum of variable value : 0
Maximum sum along a path : 50
Bounds property JoinFreeModules-PT-0050-UpperBounds-07 :0 <= u0.p18 <= 50
FORMULA JoinFreeModules-PT-0050-UpperBounds-07 50 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
JoinFreeModules-PT-0050-UpperBounds-07,0,0.307453,9884,1,0,59,27126,118,8,183,30768,96
Min sum of variable value : 0
Maximum sum along a path : 51
Bounds property JoinFreeModules-PT-0050-UpperBounds-08 :0 <= u2.p102 <= 51
FORMULA JoinFreeModules-PT-0050-UpperBounds-08 51 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
JoinFreeModules-PT-0050-UpperBounds-08,0,0.307553,9884,1,0,65,27126,129,8,183,30768,107
Min sum of variable value : 0
Maximum sum along a path : 51
Bounds property JoinFreeModules-PT-0050-UpperBounds-12 :0 <= u5.p182 <= 51
FORMULA JoinFreeModules-PT-0050-UpperBounds-12 51 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
JoinFreeModules-PT-0050-UpperBounds-12,0,0.307624,9884,1,0,68,27126,143,8,183,30768,112
Min sum of variable value : 0
Maximum sum along a path : 51
Bounds property JoinFreeModules-PT-0050-UpperBounds-14 :0 <= u0.p17 <= 51
FORMULA JoinFreeModules-PT-0050-UpperBounds-14 51 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
JoinFreeModules-PT-0050-UpperBounds-14,0,0.307701,9884,1,0,75,27126,151,8,183,30768,125

BK_STOP 1652739614384

--------------------
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="JoinFreeModules-PT-0050"
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 JoinFreeModules-PT-0050, 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 r143-tall-165271830200067"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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