fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r121-tall-162075406900427
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for JoinFreeModules-PT-0050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
594.424 77141.00 99100.00 419.60 53 52 50 52 52 53 50 53 52 52 52 52 51 51 52 53 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 10K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 26 06:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 26 06:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 24 10:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 24 10:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 282K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME 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 1620842347018

Running Version 0
[2021-05-12 17:59:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 17:59:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 17:59:08] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2021-05-12 17:59:08] [INFO ] Transformed 251 places.
[2021-05-12 17:59:08] [INFO ] Transformed 401 transitions.
[2021-05-12 17:59:08] [INFO ] Parsed PT model containing 251 places and 401 transitions in 123 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
[2021-05-12 17:59:08] [INFO ] Computed 50 place invariants in 22 ms
Incomplete random walk after 10018 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 16) seen :575
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 :157
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 16) seen :162
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 :115
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :138
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 :136
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 :158
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 :119
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 :158
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 :118
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :118
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 16) seen :115
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 :160
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 :141
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :141
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 :137
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 :158
// Phase 1: matrix 401 rows 250 cols
[2021-05-12 17:59:09] [INFO ] Computed 50 place invariants in 3 ms
[2021-05-12 17:59:09] [INFO ] [Real]Absence check using 50 positive place invariants in 13 ms returned sat
[2021-05-12 17:59:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:09] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2021-05-12 17:59:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:09] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-12 17:59:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:09] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2021-05-12 17:59:10] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 3 ms to minimize.
[2021-05-12 17:59:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2021-05-12 17:59:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2021-05-12 17:59:10] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 17:59:10] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 17:59:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 251 ms
[2021-05-12 17:59:10] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 32 ms.
[2021-05-12 17:59:10] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 17:59:11] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:59:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2021-05-12 17:59:11] [INFO ] Added : 142 causal constraints over 30 iterations in 874 ms. Result :sat
Minimization took 139 ms.
[2021-05-12 17:59:11] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-12 17:59:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:11] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2021-05-12 17:59:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:11] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2021-05-12 17:59:11] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 17:59:11] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 17:59:11] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:59:11] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 17:59:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 97 ms
[2021-05-12 17:59:11] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 25 ms.
[2021-05-12 17:59:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2021-05-12 17:59:12] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 17:59:12] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2021-05-12 17:59:12] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:59:12] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 17:59:12] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:59:12] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 253 ms
[2021-05-12 17:59:12] [INFO ] Added : 165 causal constraints over 34 iterations in 1282 ms. Result :sat
Minimization took 220 ms.
[2021-05-12 17:59:13] [INFO ] [Real]Absence check using 50 positive place invariants in 11 ms returned sat
[2021-05-12 17:59:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:13] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2021-05-12 17:59:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:13] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:13] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2021-05-12 17:59:13] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 17:59:13] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 17:59:13] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2021-05-12 17:59:13] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 17:59:13] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 17:59:13] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 17:59:13] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:59:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 186 ms
[2021-05-12 17:59:13] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 23 ms.
[2021-05-12 17:59:14] [INFO ] Added : 142 causal constraints over 31 iterations in 879 ms. Result :sat
Minimization took 141 ms.
[2021-05-12 17:59:14] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:14] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-12 17:59:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:15] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:15] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2021-05-12 17:59:15] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2021-05-12 17:59:15] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 17:59:15] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:59:15] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2021-05-12 17:59:15] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:59:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 126 ms
[2021-05-12 17:59:15] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 17 ms.
[2021-05-12 17:59:16] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 17:59:16] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:59:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 71 ms
[2021-05-12 17:59:16] [INFO ] Added : 140 causal constraints over 29 iterations in 751 ms. Result :sat
Minimization took 219 ms.
[2021-05-12 17:59:16] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-12 17:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:16] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2021-05-12 17:59:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:16] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2021-05-12 17:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:16] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2021-05-12 17:59:16] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2021-05-12 17:59:16] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:59:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 60 ms
[2021-05-12 17:59:16] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 21 ms.
[2021-05-12 17:59:17] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2021-05-12 17:59:17] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 5 ms to minimize.
[2021-05-12 17:59:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2021-05-12 17:59:17] [INFO ] Added : 110 causal constraints over 24 iterations in 682 ms. Result :sat
Minimization took 201 ms.
[2021-05-12 17:59:17] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:17] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2021-05-12 17:59:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:17] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:18] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2021-05-12 17:59:18] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 17:59:18] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 17:59:18] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:59:18] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:59:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 97 ms
[2021-05-12 17:59:18] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 20 ms.
[2021-05-12 17:59:18] [INFO ] Added : 104 causal constraints over 21 iterations in 575 ms. Result :sat
Minimization took 123 ms.
[2021-05-12 17:59:18] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2021-05-12 17:59:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:19] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2021-05-12 17:59:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:19] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:19] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2021-05-12 17:59:19] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 17:59:19] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 17:59:19] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 17:59:19] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:59:19] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:59:19] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 124 ms
[2021-05-12 17:59:19] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-12 17:59:20] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 17:59:20] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 17:59:20] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:59:20] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:59:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 133 ms
[2021-05-12 17:59:20] [INFO ] Added : 142 causal constraints over 29 iterations in 896 ms. Result :sat
Minimization took 136 ms.
[2021-05-12 17:59:20] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:20] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2021-05-12 17:59:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:20] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-12 17:59:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:21] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2021-05-12 17:59:21] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2021-05-12 17:59:21] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:59:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2021-05-12 17:59:21] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 18 ms.
[2021-05-12 17:59:21] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2021-05-12 17:59:21] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 17:59:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2021-05-12 17:59:21] [INFO ] Added : 111 causal constraints over 23 iterations in 632 ms. Result :sat
Minimization took 153 ms.
[2021-05-12 17:59:22] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:22] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2021-05-12 17:59:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:22] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-12 17:59:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:22] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2021-05-12 17:59:22] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2021-05-12 17:59:22] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 17:59:22] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2021-05-12 17:59:22] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:59:22] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 111 ms
[2021-05-12 17:59:22] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 29 ms.
[2021-05-12 17:59:23] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 20 ms to minimize.
[2021-05-12 17:59:23] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2021-05-12 17:59:23] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 17:59:23] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 17:59:23] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:59:23] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:59:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 215 ms
[2021-05-12 17:59:23] [INFO ] Added : 162 causal constraints over 33 iterations in 1085 ms. Result :sat
Minimization took 162 ms.
[2021-05-12 17:59:23] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2021-05-12 17:59:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:23] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2021-05-12 17:59:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:23] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:24] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2021-05-12 17:59:24] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 17:59:24] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 17:59:24] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 17:59:24] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:59:24] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:59:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 133 ms
[2021-05-12 17:59:24] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 20 ms.
[2021-05-12 17:59:25] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 2 ms to minimize.
[2021-05-12 17:59:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2021-05-12 17:59:25] [INFO ] Added : 166 causal constraints over 34 iterations in 932 ms. Result :sat
Minimization took 161 ms.
[2021-05-12 17:59:25] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:25] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2021-05-12 17:59:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:25] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:25] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2021-05-12 17:59:25] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 17:59:25] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:59:25] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:59:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2021-05-12 17:59:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 122 ms
[2021-05-12 17:59:25] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 23 ms.
[2021-05-12 17:59:26] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 17:59:26] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:59:26] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:59:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 100 ms
[2021-05-12 17:59:26] [INFO ] Added : 118 causal constraints over 24 iterations in 747 ms. Result :sat
Minimization took 230 ms.
[2021-05-12 17:59:26] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:27] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2021-05-12 17:59:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:27] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2021-05-12 17:59:27] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2021-05-12 17:59:27] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2021-05-12 17:59:27] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:59:27] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 17:59:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 91 ms
[2021-05-12 17:59:27] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-12 17:59:28] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2021-05-12 17:59:28] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 17:59:28] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 17:59:28] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:59:28] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2021-05-12 17:59:28] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:59:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 231 ms
[2021-05-12 17:59:28] [INFO ] Added : 165 causal constraints over 34 iterations in 1200 ms. Result :sat
Minimization took 226 ms.
[2021-05-12 17:59:28] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:28] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2021-05-12 17:59:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:29] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:29] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2021-05-12 17:59:29] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 17:59:29] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 17:59:29] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:59:29] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:59:29] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 17:59:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 105 ms
[2021-05-12 17:59:29] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-12 17:59:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2021-05-12 17:59:30] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:59:30] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 17:59:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 124 ms
[2021-05-12 17:59:30] [INFO ] Added : 152 causal constraints over 32 iterations in 977 ms. Result :sat
Minimization took 110 ms.
[2021-05-12 17:59:30] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:30] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2021-05-12 17:59:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:30] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:30] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2021-05-12 17:59:30] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 17:59:30] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:59:30] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:59:30] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:59:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 103 ms
[2021-05-12 17:59:30] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-12 17:59:31] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2021-05-12 17:59:31] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:59:31] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:59:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 127 ms
[2021-05-12 17:59:31] [INFO ] Added : 153 causal constraints over 32 iterations in 938 ms. Result :sat
Minimization took 147 ms.
[2021-05-12 17:59:32] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:32] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-12 17:59:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:32] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:32] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2021-05-12 17:59:32] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 17:59:32] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 17:59:32] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:59:32] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:59:32] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2021-05-12 17:59:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 176 ms
[2021-05-12 17:59:32] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 15 ms.
[2021-05-12 17:59:33] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2021-05-12 17:59:33] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:59:33] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:59:33] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:59:33] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:59:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 211 ms
[2021-05-12 17:59:33] [INFO ] Added : 157 causal constraints over 32 iterations in 1056 ms. Result :sat
Minimization took 328 ms.
[2021-05-12 17:59:34] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2021-05-12 17:59:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:34] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2021-05-12 17:59:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2021-05-12 17:59:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:34] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2021-05-12 17:59:34] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 17:59:34] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2021-05-12 17:59:34] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:59:34] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:59:34] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:59:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 157 ms
[2021-05-12 17:59:34] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 23 ms.
[2021-05-12 17:59:35] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 17:59:35] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:59:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 99 ms
[2021-05-12 17:59:35] [INFO ] Added : 116 causal constraints over 24 iterations in 916 ms. Result :sat
Minimization took 154 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 :[49, 27, 50, 25, 25, 49, 50, 49, 26, 27, 20, 27, 51, 51, 25, 49]
Incomplete Parikh walk after 45000 steps, including 119 resets, run finished after 303 ms. (steps per millisecond=148 ) properties (out of 16) seen :157 could not realise parikh vector
Incomplete Parikh walk after 55800 steps, including 123 resets, run finished after 354 ms. (steps per millisecond=157 ) properties (out of 16) seen :173 could not realise parikh vector
Incomplete Parikh walk after 43000 steps, including 126 resets, run finished after 294 ms. (steps per millisecond=146 ) properties (out of 16) seen :180 could not realise parikh vector
Incomplete Parikh walk after 46700 steps, including 136 resets, run finished after 313 ms. (steps per millisecond=149 ) properties (out of 16) seen :202 could not realise parikh vector
Incomplete Parikh walk after 49200 steps, including 118 resets, run finished after 333 ms. (steps per millisecond=147 ) properties (out of 16) seen :326 could not realise parikh vector
Incomplete Parikh walk after 78000 steps, including 118 resets, run finished after 434 ms. (steps per millisecond=179 ) properties (out of 16) seen :179 could not realise parikh vector
Incomplete Parikh walk after 52200 steps, including 120 resets, run finished after 342 ms. (steps per millisecond=152 ) properties (out of 16) seen :255 could not realise parikh vector
Incomplete Parikh walk after 52900 steps, including 119 resets, run finished after 346 ms. (steps per millisecond=152 ) properties (out of 16) seen :180 could not realise parikh vector
Incomplete Parikh walk after 55900 steps, including 114 resets, run finished after 299 ms. (steps per millisecond=186 ) properties (out of 16) seen :168 could not realise parikh vector
Incomplete Parikh walk after 30100 steps, including 127 resets, run finished after 207 ms. (steps per millisecond=145 ) properties (out of 16) seen :127 could not realise parikh vector
Incomplete Parikh walk after 28400 steps, including 129 resets, run finished after 171 ms. (steps per millisecond=166 ) properties (out of 16) seen :182 could not realise parikh vector
FORMULA JoinFreeModules-PT-0050-UpperBounds-05 53 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 36700 steps, including 111 resets, run finished after 208 ms. (steps per millisecond=176 ) properties (out of 15) seen :185 could not realise parikh vector
Incomplete Parikh walk after 61500 steps, including 115 resets, run finished after 377 ms. (steps per millisecond=163 ) properties (out of 15) seen :180 could not realise parikh vector
Incomplete Parikh walk after 30500 steps, including 133 resets, run finished after 211 ms. (steps per millisecond=144 ) properties (out of 15) seen :127 could not realise parikh vector
Incomplete Parikh walk after 49200 steps, including 118 resets, run finished after 343 ms. (steps per millisecond=143 ) properties (out of 15) seen :324 could not realise parikh vector
Incomplete Parikh walk after 38900 steps, including 133 resets, run finished after 271 ms. (steps per millisecond=143 ) properties (out of 15) seen :178 could not realise parikh vector
FORMULA JoinFreeModules-PT-0050-UpperBounds-00 53 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 13 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 55 are kept as prefixes of interest. Removing 195 places using SCC suffix rule.4 ms
Discarding 195 places :
Also discarding 312 output transitions
Drop transitions removed 312 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 55 transition count 88
Applied a total of 2 rules in 19 ms. Remains 55 /250 variables (removed 195) and now considering 88/401 (removed 313) transitions.
// Phase 1: matrix 88 rows 55 cols
[2021-05-12 17:59:40] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-12 17:59:40] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/250 places, 88/401 transitions.
// Phase 1: matrix 88 rows 55 cols
[2021-05-12 17:59:40] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1287 ms. (steps per millisecond=777 ) properties (out of 14) seen :713
FORMULA JoinFreeModules-PT-0050-UpperBounds-15 53 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-07 53 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 862 ms. (steps per millisecond=1160 ) properties (out of 12) seen :340
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 12) seen :328
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 854 ms. (steps per millisecond=1170 ) properties (out of 12) seen :381
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 875 ms. (steps per millisecond=1142 ) properties (out of 12) seen :370
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 852 ms. (steps per millisecond=1173 ) properties (out of 12) seen :342
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 872 ms. (steps per millisecond=1146 ) properties (out of 12) seen :370
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 868 ms. (steps per millisecond=1152 ) properties (out of 12) seen :286
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 871 ms. (steps per millisecond=1148 ) properties (out of 12) seen :367
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 864 ms. (steps per millisecond=1157 ) properties (out of 12) seen :345
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 863 ms. (steps per millisecond=1158 ) properties (out of 12) seen :292
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 856 ms. (steps per millisecond=1168 ) properties (out of 12) seen :359
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 876 ms. (steps per millisecond=1141 ) properties (out of 12) seen :359
// Phase 1: matrix 88 rows 55 cols
[2021-05-12 17:59:52] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-12 17:59:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-12 17:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:52] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-12 17:59:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2021-05-12 17:59:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:52] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2021-05-12 17:59:52] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:59:52] [INFO ] Added : 28 causal constraints over 6 iterations in 75 ms. Result :sat
Minimization took 33 ms.
[2021-05-12 17:59:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-12 17:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:52] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-12 17:59:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2021-05-12 17:59:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:52] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2021-05-12 17:59:52] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 17:59:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2021-05-12 17:59:52] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:59:52] [INFO ] Added : 24 causal constraints over 8 iterations in 49 ms. Result :sat
Minimization took 27 ms.
[2021-05-12 17:59:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-12 17:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:52] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-12 17:59:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2021-05-12 17:59:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:52] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-12 17:59:52] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2021-05-12 17:59:52] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:59:52] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 9 ms to minimize.
[2021-05-12 17:59:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 48 ms
[2021-05-12 17:59:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-12 17:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-12 17:59:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2021-05-12 17:59:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:53] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2021-05-12 17:59:53] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 17:59:53] [INFO ] Added : 33 causal constraints over 8 iterations in 89 ms. Result :sat
Minimization took 34 ms.
[2021-05-12 17:59:53] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-12 17:59:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-12 17:59:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-12 17:59:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:53] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2021-05-12 17:59:53] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 17:59:53] [INFO ] Added : 34 causal constraints over 8 iterations in 86 ms. Result :sat
Minimization took 30 ms.
[2021-05-12 17:59:53] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-12 17:59:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-12 17:59:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-12 17:59:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:53] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2021-05-12 17:59:53] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 17:59:53] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2021-05-12 17:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 29 ms
[2021-05-12 17:59:53] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned sat
[2021-05-12 17:59:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:53] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-12 17:59:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-12 17:59:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:53] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2021-05-12 17:59:53] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 17:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2021-05-12 17:59:53] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned sat
[2021-05-12 17:59:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-12 17:59:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-12 17:59:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:53] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2021-05-12 17:59:53] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:59:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 9 ms
[2021-05-12 17:59:53] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-12 17:59:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:54] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 17:59:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-12 17:59:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:54] [INFO ] [Nat]Absence check using state equation in 139 ms returned sat
[2021-05-12 17:59:54] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:59:54] [INFO ] Added : 28 causal constraints over 6 iterations in 73 ms. Result :sat
Minimization took 31 ms.
[2021-05-12 17:59:54] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-12 17:59:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:54] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-12 17:59:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-12 17:59:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:54] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2021-05-12 17:59:54] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 17:59:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2021-05-12 17:59:54] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:59:54] [INFO ] Added : 29 causal constraints over 7 iterations in 97 ms. Result :sat
Minimization took 26 ms.
[2021-05-12 17:59:54] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-12 17:59:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:54] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-12 17:59:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-12 17:59:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:54] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-12 17:59:54] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:59:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2021-05-12 17:59:54] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 17:59:54] [INFO ] Added : 26 causal constraints over 6 iterations in 43 ms. Result :sat
Minimization took 26 ms.
[2021-05-12 17:59:54] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-12 17:59:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:54] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 17:59:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:59:54] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2021-05-12 17:59:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:59:55] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2021-05-12 17:59:55] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 17:59:55] [INFO ] Added : 35 causal constraints over 8 iterations in 225 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [53, 53, 52, 53, 53, 52, 52, 52, 53, 53, 53, 53] Max seen :[51, 50, 52, 51, 50, 52, 52, 52, 51, 51, 51, 51]
FORMULA JoinFreeModules-PT-0050-UpperBounds-10 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-08 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-03 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 32300 steps, including 106 resets, run finished after 126 ms. (steps per millisecond=256 ) properties (out of 8) seen :185 could not realise parikh vector
Incomplete Parikh walk after 12500 steps, including 116 resets, run finished after 49 ms. (steps per millisecond=255 ) properties (out of 8) seen :177 could not realise parikh vector
Incomplete Parikh walk after 12400 steps, including 119 resets, run finished after 47 ms. (steps per millisecond=263 ) properties (out of 8) seen :173 could not realise parikh vector
Incomplete Parikh walk after 27300 steps, including 109 resets, run finished after 65 ms. (steps per millisecond=420 ) properties (out of 8) seen :232 could not realise parikh vector
Incomplete Parikh walk after 8200 steps, including 128 resets, run finished after 28 ms. (steps per millisecond=292 ) properties (out of 8) seen :121 could not realise parikh vector
Incomplete Parikh walk after 11500 steps, including 112 resets, run finished after 30 ms. (steps per millisecond=383 ) properties (out of 8) seen :152 could not realise parikh vector
Incomplete Parikh walk after 7400 steps, including 135 resets, run finished after 23 ms. (steps per millisecond=321 ) properties (out of 8) seen :136 could not realise parikh vector
Incomplete Parikh walk after 27300 steps, including 109 resets, run finished after 71 ms. (steps per millisecond=384 ) properties (out of 8) seen :234 could not realise parikh vector
Support contains 7 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 30 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Applied a total of 1 rules in 2 ms. Remains 30 /55 variables (removed 25) and now considering 48/88 (removed 40) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/55 places, 48/88 transitions.
// Phase 1: matrix 48 rows 30 cols
[2021-05-12 17:59:55] [INFO ] Computed 6 place invariants in 0 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 900 ms. (steps per millisecond=1111 ) properties (out of 8) seen :407
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 537 ms. (steps per millisecond=1862 ) properties (out of 8) seen :287
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 :283
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 545 ms. (steps per millisecond=1834 ) properties (out of 8) seen :319
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 539 ms. (steps per millisecond=1855 ) properties (out of 8) seen :267
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 538 ms. (steps per millisecond=1858 ) properties (out of 8) seen :296
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 521 ms. (steps per millisecond=1919 ) properties (out of 8) seen :245
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 526 ms. (steps per millisecond=1901 ) properties (out of 8) seen :270
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 532 ms. (steps per millisecond=1879 ) properties (out of 8) seen :306
// Phase 1: matrix 48 rows 30 cols
[2021-05-12 18:00:00] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-12 18:00:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:01] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 18:00:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:01] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2021-05-12 18:00:01] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 18:00:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2021-05-12 18:00:01] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:01] [INFO ] Added : 23 causal constraints over 7 iterations in 51 ms. Result :sat
Minimization took 16 ms.
[2021-05-12 18:00:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 18:00:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-12 18:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:01] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-12 18:00:01] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:01] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 18:00:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2021-05-12 18:00:01] [INFO ] Added : 21 causal constraints over 5 iterations in 61 ms. Result :sat
Minimization took 19 ms.
[2021-05-12 18:00:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:01] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 18:00:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:01] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-12 18:00:01] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 18:00:01] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 9 ms
[2021-05-12 18:00:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 18:00:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:01] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-12 18:00:01] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:01] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 18:00:01] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 18:00:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 31 ms
[2021-05-12 18:00:01] [INFO ] Added : 30 causal constraints over 7 iterations in 229 ms. Result :sat
Minimization took 26 ms.
[2021-05-12 18:00:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 18:00:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:01] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-12 18:00:01] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 18:00:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-12 18:00:01] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:01] [INFO ] Added : 23 causal constraints over 7 iterations in 52 ms. Result :sat
Minimization took 16 ms.
[2021-05-12 18:00:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-12 18:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:01] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 18:00:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:01] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-12 18:00:01] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 18:00:01] [INFO ] Added : 17 causal constraints over 4 iterations in 47 ms. Result :sat
Minimization took 16 ms.
[2021-05-12 18:00:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-12 18:00:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 18:00:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:02] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-12 18:00:02] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 18:00:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 9 ms
[2021-05-12 18:00:02] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:02] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 18:00:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 10 ms
[2021-05-12 18:00:02] [INFO ] Added : 24 causal constraints over 6 iterations in 46 ms. Result :sat
Minimization took 10 ms.
[2021-05-12 18:00:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-12 18:00:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:02] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 18:00:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:02] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-12 18:00:02] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 18:00:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2021-05-12 18:00:02] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:02] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 18:00:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 10 ms
[2021-05-12 18:00:02] [INFO ] Added : 23 causal constraints over 6 iterations in 45 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [53, 53, 52, 53, 53, 53, 53, 53] Max seen :[51, 50, 52, 50, 51, 51, 51, 51]
FORMULA JoinFreeModules-PT-0050-UpperBounds-04 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 18100 steps, including 117 resets, run finished after 41 ms. (steps per millisecond=441 ) properties (out of 7) seen :167 could not realise parikh vector
Incomplete Parikh walk after 9800 steps, including 105 resets, run finished after 21 ms. (steps per millisecond=466 ) properties (out of 7) seen :158 could not realise parikh vector
Incomplete Parikh walk after 9200 steps, including 105 resets, run finished after 19 ms. (steps per millisecond=484 ) properties (out of 7) seen :164 could not realise parikh vector
Incomplete Parikh walk after 17300 steps, including 111 resets, run finished after 38 ms. (steps per millisecond=455 ) properties (out of 7) seen :232 could not realise parikh vector
Incomplete Parikh walk after 9500 steps, including 122 resets, run finished after 22 ms. (steps per millisecond=431 ) properties (out of 7) seen :128 could not realise parikh vector
Incomplete Parikh walk after 4600 steps, including 141 resets, run finished after 12 ms. (steps per millisecond=383 ) properties (out of 7) seen :104 could not realise parikh vector
Incomplete Parikh walk after 17300 steps, including 114 resets, run finished after 37 ms. (steps per millisecond=467 ) properties (out of 7) seen :234 could not realise parikh vector
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 25 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Applied a total of 1 rules in 3 ms. Remains 25 /30 variables (removed 5) and now considering 40/48 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/30 places, 40/48 transitions.
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:02] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 1000008 steps, including 2 resets, run finished after 777 ms. (steps per millisecond=1287 ) properties (out of 7) seen :356
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 472 ms. (steps per millisecond=2118 ) properties (out of 7) seen :272
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 482 ms. (steps per millisecond=2074 ) properties (out of 7) seen :258
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 482 ms. (steps per millisecond=2074 ) properties (out of 7) seen :266
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 481 ms. (steps per millisecond=2079 ) properties (out of 7) seen :272
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=2136 ) properties (out of 7) seen :220
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 465 ms. (steps per millisecond=2150 ) properties (out of 7) seen :249
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 475 ms. (steps per millisecond=2105 ) properties (out of 7) seen :304
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:06] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 18:00:06] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:06] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 18:00:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:06] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-12 18:00:06] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:06] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2021-05-12 18:00:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2021-05-12 18:00:06] [INFO ] Added : 18 causal constraints over 4 iterations in 35 ms. Result :sat
Minimization took 13 ms.
[2021-05-12 18:00:06] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:06] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-12 18:00:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-12 18:00:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:06] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-12 18:00:06] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 18:00:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2021-05-12 18:00:06] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 18:00:06] [INFO ] Added : 18 causal constraints over 4 iterations in 38 ms. Result :sat
Minimization took 11 ms.
[2021-05-12 18:00:06] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:06] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 18:00:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:06] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-12 18:00:06] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:06] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2021-05-12 18:00:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2021-05-12 18:00:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 44 ms
[2021-05-12 18:00:06] [INFO ] Added : 22 causal constraints over 6 iterations in 114 ms. Result :sat
Minimization took 16 ms.
[2021-05-12 18:00:06] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:07] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 18:00:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:07] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-12 18:00:07] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:07] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2021-05-12 18:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2021-05-12 18:00:07] [INFO ] Added : 18 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 12 ms.
[2021-05-12 18:00:07] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:07] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 18:00:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:07] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-12 18:00:07] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:07] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2021-05-12 18:00:07] [INFO ] Added : 18 causal constraints over 4 iterations in 157 ms. Result :sat
Minimization took 13 ms.
[2021-05-12 18:00:07] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:07] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 18:00:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:07] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2021-05-12 18:00:07] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:07] [INFO ] Added : 18 causal constraints over 6 iterations in 26 ms. Result :sat
Minimization took 12 ms.
[2021-05-12 18:00:07] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:07] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-12 18:00:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:07] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:07] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-12 18:00:07] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:07] [INFO ] Added : 23 causal constraints over 5 iterations in 46 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [53, 53, 53, 53, 53, 53, 53] Max seen :[51, 50, 50, 51, 51, 51, 52]
Incomplete Parikh walk after 22200 steps, including 108 resets, run finished after 46 ms. (steps per millisecond=482 ) properties (out of 7) seen :176 could not realise parikh vector
Incomplete Parikh walk after 8500 steps, including 101 resets, run finished after 18 ms. (steps per millisecond=472 ) properties (out of 7) seen :164 could not realise parikh vector
Incomplete Parikh walk after 9400 steps, including 111 resets, run finished after 19 ms. (steps per millisecond=494 ) properties (out of 7) seen :166 could not realise parikh vector
Incomplete Parikh walk after 14000 steps, including 110 resets, run finished after 31 ms. (steps per millisecond=451 ) properties (out of 7) seen :240 could not realise parikh vector
Incomplete Parikh walk after 4300 steps, including 128 resets, run finished after 11 ms. (steps per millisecond=390 ) properties (out of 7) seen :121 could not realise parikh vector
Incomplete Parikh walk after 3200 steps, including 113 resets, run finished after 8 ms. (steps per millisecond=400 ) properties (out of 7) seen :113 could not realise parikh vector
Incomplete Parikh walk after 14000 steps, including 109 resets, run finished after 31 ms. (steps per millisecond=451 ) properties (out of 7) seen :237 could not realise parikh vector
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 40/40 transitions.
Starting structural reductions, iteration 0 : 25/25 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:07] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 18:00:07] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:07] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 18:00:07] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2021-05-12 18:00:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:07] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 18:00:07] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 40/40 transitions.
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:07] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 793 ms. (steps per millisecond=1261 ) properties (out of 7) seen :355
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 508 ms. (steps per millisecond=1968 ) properties (out of 7) seen :275
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 494 ms. (steps per millisecond=2024 ) properties (out of 7) seen :268
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 493 ms. (steps per millisecond=2028 ) properties (out of 7) seen :275
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 492 ms. (steps per millisecond=2032 ) properties (out of 7) seen :273
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=2061 ) properties (out of 7) seen :219
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 478 ms. (steps per millisecond=2092 ) properties (out of 7) seen :253
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=2087 ) properties (out of 7) seen :290
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:12] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 18:00:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 18:00:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:12] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-12 18:00:12] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:12] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:00:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2021-05-12 18:00:12] [INFO ] Added : 18 causal constraints over 4 iterations in 34 ms. Result :sat
Minimization took 13 ms.
[2021-05-12 18:00:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 18:00:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:12] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-12 18:00:12] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:00:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2021-05-12 18:00:12] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:12] [INFO ] Added : 18 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 11 ms.
[2021-05-12 18:00:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:12] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 18:00:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:12] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2021-05-12 18:00:12] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:12] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2021-05-12 18:00:12] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2021-05-12 18:00:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 48 ms
[2021-05-12 18:00:12] [INFO ] Added : 22 causal constraints over 6 iterations in 119 ms. Result :sat
Minimization took 16 ms.
[2021-05-12 18:00:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:12] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 18:00:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:12] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-12 18:00:12] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:12] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2021-05-12 18:00:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2021-05-12 18:00:12] [INFO ] Added : 18 causal constraints over 4 iterations in 37 ms. Result :sat
Minimization took 13 ms.
[2021-05-12 18:00:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 18:00:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:12] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-12 18:00:12] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:12] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 18:00:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2021-05-12 18:00:12] [INFO ] Added : 18 causal constraints over 4 iterations in 158 ms. Result :sat
Minimization took 13 ms.
[2021-05-12 18:00:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 18:00:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:12] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2021-05-12 18:00:12] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 18:00:12] [INFO ] Added : 18 causal constraints over 6 iterations in 47 ms. Result :sat
Minimization took 13 ms.
[2021-05-12 18:00:12] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 18:00:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:12] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:13] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-12 18:00:13] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:13] [INFO ] Added : 23 causal constraints over 5 iterations in 45 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [53, 53, 53, 53, 53, 53, 53] Max seen :[51, 50, 50, 51, 51, 51, 52]
Incomplete Parikh walk after 22200 steps, including 107 resets, run finished after 42 ms. (steps per millisecond=528 ) properties (out of 7) seen :177 could not realise parikh vector
Incomplete Parikh walk after 8500 steps, including 102 resets, run finished after 16 ms. (steps per millisecond=531 ) properties (out of 7) seen :165 could not realise parikh vector
Incomplete Parikh walk after 9400 steps, including 112 resets, run finished after 18 ms. (steps per millisecond=522 ) properties (out of 7) seen :168 could not realise parikh vector
Incomplete Parikh walk after 14000 steps, including 110 resets, run finished after 28 ms. (steps per millisecond=500 ) properties (out of 7) seen :233 could not realise parikh vector
Incomplete Parikh walk after 4300 steps, including 128 resets, run finished after 11 ms. (steps per millisecond=390 ) properties (out of 7) seen :118 could not realise parikh vector
Incomplete Parikh walk after 3200 steps, including 112 resets, run finished after 8 ms. (steps per millisecond=400 ) properties (out of 7) seen :114 could not realise parikh vector
Incomplete Parikh walk after 14000 steps, including 111 resets, run finished after 28 ms. (steps per millisecond=500 ) properties (out of 7) seen :237 could not realise parikh vector
Support contains 6 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 40/40 transitions.
Starting structural reductions, iteration 0 : 25/25 places, 40/40 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:13] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 18:00:13] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:13] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 18:00:13] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2021-05-12 18:00:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:13] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 18:00:13] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 40/40 transitions.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-01
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:13] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 10012 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1112 ) 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 :50
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:13] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 18:00:13] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:13] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 18:00:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:13] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:13] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2021-05-12 18:00:13] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:13] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 18:00:13] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 18:00:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 78 ms
[2021-05-12 18:00:13] [INFO ] Added : 17 causal constraints over 4 iterations in 96 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[50]
Incomplete Parikh walk after 16700 steps, including 113 resets, run finished after 31 ms. (steps per millisecond=538 ) properties (out of 1) seen :49 could not realise parikh vector
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 40/40 transitions.
Graph (complete) has 60 edges and 25 vertex of which 5 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /25 variables (removed 20) and now considering 8/40 (removed 32) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:13] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/25 places, 8/40 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:13] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 389 ms. (steps per millisecond=2570 ) properties (out of 1) seen :52
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 438 ms. (steps per millisecond=2283 ) properties (out of 1) seen :50
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:14] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:14] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 18:00:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:14] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 18:00:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 18:00:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:14] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-12 18:00:14] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 18:00:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
Current structural bounds on expressions (after SMT) : [52] Max seen :[52]
FORMULA JoinFreeModules-PT-0050-UpperBounds-01 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-01 in 1094 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-02
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:14] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 10002 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 40 rows 25 cols
[2021-05-12 18:00:14] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 18:00:14] [INFO ] [Real]Absence check using 5 positive place invariants in 0 ms returned sat
[2021-05-12 18:00:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:14] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 18:00:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:14] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2021-05-12 18:00:14] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2021-05-12 18:00:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2021-05-12 18:00:14] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:14] [INFO ] Added : 18 causal constraints over 4 iterations in 39 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[50]
Incomplete Parikh walk after 3200 steps, including 113 resets, run finished after 8 ms. (steps per millisecond=400 ) properties (out of 1) seen :50 could not realise parikh vector
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 40/40 transitions.
Graph (complete) has 60 edges and 25 vertex of which 5 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /25 variables (removed 20) and now considering 8/40 (removed 32) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:14] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:14] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/25 places, 8/40 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:14] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=2304 ) properties (out of 1) seen :50
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 437 ms. (steps per millisecond=2288 ) properties (out of 1) seen :50
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:15] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:15] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 18:00:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 18:00:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:15] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-12 18:00:15] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 2 ms to minimize.
[2021-05-12 18:00:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-12 18:00:15] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 18:00:15] [INFO ] Added : 6 causal constraints over 2 iterations in 7 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 145 resets, run finished after 3 ms. (steps per millisecond=400 ) 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
[2021-05-12 18:00:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:15] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:15] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-12 18:00:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:15] [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-02 in 1140 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-06
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:15] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 10002 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 40 rows 25 cols
[2021-05-12 18:00:15] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 18:00:15] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:15] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 18:00:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:15] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:15] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-12 18:00:15] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:15] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2021-05-12 18:00:15] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 18:00:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 42 ms
[2021-05-12 18:00:15] [INFO ] Added : 22 causal constraints over 6 iterations in 118 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[50]
Incomplete Parikh walk after 4300 steps, including 128 resets, run finished after 10 ms. (steps per millisecond=430 ) properties (out of 1) seen :50 could not realise parikh vector
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 40/40 transitions.
Graph (complete) has 60 edges and 25 vertex of which 5 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /25 variables (removed 20) and now considering 8/40 (removed 32) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:15] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:15] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/25 places, 8/40 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:15] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 426 ms. (steps per millisecond=2347 ) properties (out of 1) seen :50
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 452 ms. (steps per millisecond=2212 ) properties (out of 1) seen :50
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:16] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 18:00:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:16] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 18:00:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 18:00:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:16] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-12 18:00:16] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2021-05-12 18:00:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-12 18:00:16] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 18:00:16] [INFO ] Added : 6 causal constraints over 2 iterations in 7 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 3 ms. (steps per millisecond=400 ) 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 3 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
[2021-05-12 18:00:16] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-12 18:00:16] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:16] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:16] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-12 18:00:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:16] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:16] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-06 in 1237 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-11
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:16] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 10002 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 :46
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:16] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 18:00:16] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:16] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 18:00:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:16] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:16] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-05-12 18:00:16] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:16] [INFO ] Added : 18 causal constraints over 5 iterations in 18 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[46]
Incomplete Parikh walk after 8600 steps, including 108 resets, run finished after 17 ms. (steps per millisecond=505 ) properties (out of 1) seen :50 could not realise parikh vector
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 40/40 transitions.
Graph (complete) has 60 edges and 25 vertex of which 5 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /25 variables (removed 20) and now considering 8/40 (removed 32) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:16] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:16] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/25 places, 8/40 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:16] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties (out of 1) seen :51
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 403 ms. (steps per millisecond=2481 ) properties (out of 1) seen :50
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:17] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:17] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 18:00:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:17] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 18:00:17] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 18:00:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6 ms
[2021-05-12 18:00:17] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 18:00:17] [INFO ] Added : 6 causal constraints over 2 iterations in 21 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[51]
Incomplete Parikh walk after 13500 steps, including 113 resets, run finished after 23 ms. (steps per millisecond=586 ) properties (out of 1) seen :48 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
[2021-05-12 18:00:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:17] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:17] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-12 18:00:17] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:17] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:17] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:17] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=2577 ) properties (out of 1) seen :51
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 402 ms. (steps per millisecond=2487 ) properties (out of 1) seen :50
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:18] [INFO ] Computed 1 place invariants in 15 ms
[2021-05-12 18:00:18] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 18:00:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:18] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 18:00:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:18] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 18:00:18] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 18:00:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-12 18:00:18] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 18:00:18] [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 13500 steps, including 112 resets, run finished after 22 ms. (steps per millisecond=613 ) properties (out of 1) seen :49 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
[2021-05-12 18:00:18] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:18] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:18] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 18:00:18] [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.
[2021-05-12 18:00:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:18] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 18:00:18] [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-11 in 2021 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-12
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:18] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 10001 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 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :51
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:18] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 18:00:18] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:18] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-12 18:00:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:18] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:18] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-12 18:00:18] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:18] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2021-05-12 18:00:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2021-05-12 18:00:19] [INFO ] Added : 18 causal constraints over 4 iterations in 157 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[51]
Incomplete Parikh walk after 9400 steps, including 111 resets, run finished after 18 ms. (steps per millisecond=522 ) properties (out of 1) seen :50 could not realise parikh vector
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 40/40 transitions.
Graph (complete) has 60 edges and 25 vertex of which 5 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /25 variables (removed 20) and now considering 8/40 (removed 32) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:19] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:19] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/25 places, 8/40 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:19] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 407 ms. (steps per millisecond=2457 ) properties (out of 1) seen :51
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 643 ms. (steps per millisecond=1555 ) properties (out of 1) seen :51
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:20] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 18:00:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 18:00:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:20] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2021-05-12 18:00:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 18:00:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:20] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-12 18:00:20] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 18:00:20] [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 97 resets, run finished after 8 ms. (steps per millisecond=762 ) 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 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
[2021-05-12 18:00:20] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:20] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:20] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:20] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2021-05-12 18:00:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:20] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:20] [INFO ] Dead Transitions using invariants and state equation in 27 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 1426 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-13
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:20] [INFO ] Computed 5 place invariants in 0 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) 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 40 rows 25 cols
[2021-05-12 18:00:20] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-12 18:00:20] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:20] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-12 18:00:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:20] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2021-05-12 18:00:20] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 18:00:20] [INFO ] Added : 18 causal constraints over 6 iterations in 25 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[51]
Incomplete Parikh walk after 8500 steps, including 101 resets, run finished after 16 ms. (steps per millisecond=531 ) properties (out of 1) seen :50 could not realise parikh vector
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 40/40 transitions.
Graph (complete) has 60 edges and 25 vertex of which 5 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /25 variables (removed 20) and now considering 8/40 (removed 32) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:20] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:20] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/25 places, 8/40 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:20] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000006 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=2398 ) properties (out of 1) seen :51
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=1886 ) properties (out of 1) seen :51
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:21] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 18:00:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:21] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 18:00:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:21] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 18:00:21] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 18:00:21] [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 10 ms. (steps per millisecond=610 ) 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
[2021-05-12 18:00:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:21] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:21] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 18:00:21] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-12 18:00:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:21] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-13 in 1218 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-14
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:21] [INFO ] Computed 5 place invariants in 4 ms
Incomplete random walk after 10022 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1113 ) properties (out of 1) seen :45
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :47
// Phase 1: matrix 40 rows 25 cols
[2021-05-12 18:00:21] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-12 18:00:21] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:21] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-12 18:00:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:21] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2021-05-12 18:00:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:21] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-12 18:00:21] [INFO ] Computed and/alt/rep : 30/75/30 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 18:00:21] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 18:00:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 10 ms
[2021-05-12 18:00:21] [INFO ] Added : 18 causal constraints over 4 iterations in 62 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [53] Max seen :[47]
Incomplete Parikh walk after 19600 steps, including 112 resets, run finished after 40 ms. (steps per millisecond=490 ) properties (out of 1) seen :48 could not realise parikh vector
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 40/40 transitions.
Graph (complete) has 60 edges and 25 vertex of which 5 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /25 variables (removed 20) and now considering 8/40 (removed 32) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:21] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:21] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/25 places, 8/40 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:21] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000013 steps, including 2 resets, run finished after 417 ms. (steps per millisecond=2398 ) properties (out of 1) seen :52
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 463 ms. (steps per millisecond=2159 ) properties (out of 1) seen :50
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 18:00:22] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 18:00:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 18:00:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:22] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 18:00:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 18:00:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 18:00:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 18:00:22] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2021-05-12 18:00:22] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 18:00:22] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 6 ms
Current structural bounds on expressions (after SMT) : [52] Max seen :[52]
FORMULA JoinFreeModules-PT-0050-UpperBounds-14 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-14 in 1171 ms.
[2021-05-12 18:00:22] [INFO ] Flatten gal took : 25 ms
[2021-05-12 18:00:22] [INFO ] Applying decomposition
[2021-05-12 18:00:22] [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/graph17294814359109006052.txt, -o, /tmp/graph17294814359109006052.bin, -w, /tmp/graph17294814359109006052.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/graph17294814359109006052.bin, -l, -1, -v, -w, /tmp/graph17294814359109006052.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 18:00:22] [INFO ] Decomposing Gal with order
[2021-05-12 18:00:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 18:00:22] [INFO ] Flatten gal took : 7 ms
[2021-05-12 18:00:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 18:00:22] [INFO ] Time to serialize gal into /tmp/UpperBounds2110025674101956482.gal : 1 ms
[2021-05-12 18:00:22] [INFO ] Time to serialize properties into /tmp/UpperBounds8351180391536745317.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds2110025674101956482.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds8351180391536745317.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/UpperBounds2110025674101956482.gal -t CGAL -reachable-file /tmp/UpperBounds8351180391536745317.prop --nowitness
Loading property file /tmp/UpperBounds8351180391536745317.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,9.46101e+27,0.296764,9788,7,369,19,27126,30,0,58,30768,0
Total reachable state count : 9461007399963756282421182464

Verifying 5 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 50
Bounds property JoinFreeModules-PT-0050-UpperBounds-02 :0 <= u0.p48 <= 50
FORMULA JoinFreeModules-PT-0050-UpperBounds-02 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-02,0,0.301321,9788,1,0,35,27126,60,6,123,30768,42
Min sum of variable value : 0
Maximum sum along a path : 50
Bounds property JoinFreeModules-PT-0050-UpperBounds-06 :0 <= u1.p88 <= 50
FORMULA JoinFreeModules-PT-0050-UpperBounds-06 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-06,0,0.301709,9788,1,0,40,27126,69,6,123,30768,52
Min sum of variable value : 0
Maximum sum along a path : 52
Bounds property JoinFreeModules-PT-0050-UpperBounds-11 :0 <= u3.p184 <= 52
FORMULA JoinFreeModules-PT-0050-UpperBounds-11 52 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-11,0,0.305095,9788,1,0,44,27126,82,6,181,30768,62
Min sum of variable value : 0
Maximum sum along a path : 51
Bounds property JoinFreeModules-PT-0050-UpperBounds-12 :0 <= u3.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.315268,9788,1,0,48,27126,93,6,243,30768,68
Min sum of variable value : 0
Maximum sum along a path : 51
Bounds property JoinFreeModules-PT-0050-UpperBounds-13 :0 <= u2.p147 <= 51
FORMULA JoinFreeModules-PT-0050-UpperBounds-13 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-13,0,0.315972,9788,1,0,52,27126,102,6,243,30768,75

BK_STOP 1620842424159

--------------------
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="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is 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 r121-tall-162075406900427"
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 ;