Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 244K
-rw-r--r-- 1 mcc users 6.3K Apr 30 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 30 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 02:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 02:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 31K May 10 09:34 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652739479902

Running Version 0
[2022-05-16 22:18:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 22:18:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 22:18:01] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2022-05-16 22:18:01] [INFO ] Transformed 51 places.
[2022-05-16 22:18:01] [INFO ] Transformed 81 transitions.
[2022-05-16 22:18:01] [INFO ] Parsed PT model containing 51 places and 81 transitions in 69 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 81 rows 50 cols
[2022-05-16 22:18:01] [INFO ] Computed 10 place invariants in 10 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 16) seen :167
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 16) seen :112
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :107
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :118
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :100
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :94
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :100
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :118
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :112
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :107
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :109
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :101
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :116
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :114
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 16) seen :123
FORMULA JoinFreeModules-PT-0010-UpperBounds-12 13 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 15) seen :96
// Phase 1: matrix 81 rows 50 cols
[2022-05-16 22:18:01] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-16 22:18:01] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2022-05-16 22:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:01] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-05-16 22:18:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:02] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-05-16 22:18:02] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 3 ms to minimize.
[2022-05-16 22:18:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-05-16 22:18:02] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-16 22:18:02] [INFO ] Added : 29 causal constraints over 6 iterations in 197 ms. Result :sat
Minimization took 34 ms.
[2022-05-16 22:18:02] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:02] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-16 22:18:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:02] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2022-05-16 22:18:02] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-16 22:18:02] [INFO ] Added : 12 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 19 ms.
[2022-05-16 22:18:02] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:02] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:18:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:02] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-16 22:18:02] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:18:02] [INFO ] Added : 24 causal constraints over 6 iterations in 77 ms. Result :sat
Minimization took 26 ms.
[2022-05-16 22:18:02] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:02] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 22:18:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:02] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-05-16 22:18:02] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 22:18:02] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-05-16 22:18:02] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2022-05-16 22:18:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
[2022-05-16 22:18:03] [INFO ] Added : 26 causal constraints over 6 iterations in 142 ms. Result :sat
Minimization took 28 ms.
[2022-05-16 22:18:03] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:03] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-16 22:18:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:03] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2022-05-16 22:18:03] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-05-16 22:18:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-16 22:18:03] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 17 ms.
[2022-05-16 22:18:03] [INFO ] Added : 28 causal constraints over 6 iterations in 91 ms. Result :sat
Minimization took 28 ms.
[2022-05-16 22:18:03] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:03] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:18:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:03] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-16 22:18:03] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:18:03] [INFO ] Added : 42 causal constraints over 9 iterations in 124 ms. Result :sat
Minimization took 32 ms.
[2022-05-16 22:18:03] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:03] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-05-16 22:18:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:03] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-16 22:18:03] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:18:03] [INFO ] Added : 42 causal constraints over 10 iterations in 127 ms. Result :sat
Minimization took 32 ms.
[2022-05-16 22:18:03] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:03] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:18:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:03] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2022-05-16 22:18:04] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:18:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2022-05-16 22:18:04] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:18:04] [INFO ] Added : 39 causal constraints over 9 iterations in 115 ms. Result :sat
Minimization took 34 ms.
[2022-05-16 22:18:04] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:04] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:18:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:04] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-16 22:18:04] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:18:04] [INFO ] Added : 39 causal constraints over 8 iterations in 139 ms. Result :sat
Minimization took 34 ms.
[2022-05-16 22:18:04] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:04] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 22:18:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:04] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2022-05-16 22:18:04] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:18:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2022-05-16 22:18:04] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:18:04] [INFO ] Added : 36 causal constraints over 8 iterations in 132 ms. Result :sat
Minimization took 25 ms.
[2022-05-16 22:18:04] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:04] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 22:18:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:04] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-05-16 22:18:04] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 22:18:04] [INFO ] Added : 42 causal constraints over 9 iterations in 168 ms. Result :sat
Minimization took 33 ms.
[2022-05-16 22:18:05] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:05] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:18:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:05] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2022-05-16 22:18:05] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 22:18:05] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:18:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-16 22:18:05] [INFO ] Added : 35 causal constraints over 7 iterations in 107 ms. Result :sat
Minimization took 52 ms.
[2022-05-16 22:18:05] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:05] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:18:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:05] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2022-05-16 22:18:05] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 22:18:05] [INFO ] Added : 35 causal constraints over 7 iterations in 77 ms. Result :sat
Minimization took 42 ms.
[2022-05-16 22:18:05] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:05] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-05-16 22:18:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:05] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2022-05-16 22:18:05] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2022-05-16 22:18:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2022-05-16 22:18:05] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:18:05] [INFO ] Added : 35 causal constraints over 8 iterations in 91 ms. Result :sat
Minimization took 38 ms.
[2022-05-16 22:18:05] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:05] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 22:18:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:05] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-05-16 22:18:05] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 22:18:06] [INFO ] Added : 38 causal constraints over 8 iterations in 73 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13] Max seen :[11, 12, 11, 10, 10, 10, 10, 10, 11, 10, 10, 10, 10, 11, 12]
Incomplete Parikh walk after 16000 steps, including 127 resets, run finished after 49 ms. (steps per millisecond=326 ) properties (out of 15) seen :102 could not realise parikh vector
FORMULA JoinFreeModules-PT-0010-UpperBounds-01 13 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 11800 steps, including 122 resets, run finished after 27 ms. (steps per millisecond=437 ) properties (out of 14) seen :82 could not realise parikh vector
Incomplete Parikh walk after 9300 steps, including 138 resets, run finished after 22 ms. (steps per millisecond=422 ) properties (out of 14) seen :75 could not realise parikh vector
Incomplete Parikh walk after 29200 steps, including 138 resets, run finished after 52 ms. (steps per millisecond=561 ) properties (out of 14) seen :82 could not realise parikh vector
Incomplete Parikh walk after 9400 steps, including 114 resets, run finished after 20 ms. (steps per millisecond=470 ) properties (out of 14) seen :82 could not realise parikh vector
Incomplete Parikh walk after 8500 steps, including 147 resets, run finished after 17 ms. (steps per millisecond=500 ) properties (out of 14) seen :72 could not realise parikh vector
Incomplete Parikh walk after 8200 steps, including 143 resets, run finished after 19 ms. (steps per millisecond=431 ) properties (out of 14) seen :85 could not realise parikh vector
Incomplete Parikh walk after 13700 steps, including 114 resets, run finished after 26 ms. (steps per millisecond=526 ) properties (out of 14) seen :85 could not realise parikh vector
Incomplete Parikh walk after 14100 steps, including 117 resets, run finished after 28 ms. (steps per millisecond=503 ) properties (out of 14) seen :85 could not realise parikh vector
Incomplete Parikh walk after 11200 steps, including 119 resets, run finished after 21 ms. (steps per millisecond=533 ) properties (out of 14) seen :87 could not realise parikh vector
Incomplete Parikh walk after 6000 steps, including 130 resets, run finished after 12 ms. (steps per millisecond=500 ) properties (out of 14) seen :81 could not realise parikh vector
Incomplete Parikh walk after 7000 steps, including 126 resets, run finished after 18 ms. (steps per millisecond=388 ) properties (out of 14) seen :76 could not realise parikh vector
Incomplete Parikh walk after 5200 steps, including 114 resets, run finished after 9 ms. (steps per millisecond=577 ) properties (out of 14) seen :66 could not realise parikh vector
Incomplete Parikh walk after 4100 steps, including 140 resets, run finished after 6 ms. (steps per millisecond=683 ) properties (out of 14) seen :53 could not realise parikh vector
Incomplete Parikh walk after 10400 steps, including 120 resets, run finished after 20 ms. (steps per millisecond=520 ) properties (out of 14) seen :80 could not realise parikh vector
Support contains 14 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 81/81 transitions.
Graph (complete) has 120 edges and 50 vertex of which 45 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
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 72
Applied a total of 2 rules in 13 ms. Remains 45 /50 variables (removed 5) and now considering 72/81 (removed 9) transitions.
// Phase 1: matrix 72 rows 45 cols
[2022-05-16 22:18:06] [INFO ] Computed 9 place invariants in 5 ms
[2022-05-16 22:18:06] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 45/50 places, 72/81 transitions.
// Phase 1: matrix 72 rows 45 cols
[2022-05-16 22:18:06] [INFO ] Computed 9 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1749 ms. (steps per millisecond=571 ) properties (out of 14) seen :158
FORMULA JoinFreeModules-PT-0010-UpperBounds-15 13 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties (out of 13) seen :133
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 690 ms. (steps per millisecond=1449 ) properties (out of 13) seen :135
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties (out of 13) seen :135
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 681 ms. (steps per millisecond=1468 ) properties (out of 13) seen :126
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 682 ms. (steps per millisecond=1466 ) properties (out of 13) seen :134
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 667 ms. (steps per millisecond=1499 ) properties (out of 13) seen :124
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 676 ms. (steps per millisecond=1479 ) properties (out of 13) seen :135
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 653 ms. (steps per millisecond=1531 ) properties (out of 13) seen :134
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 664 ms. (steps per millisecond=1506 ) properties (out of 13) seen :124
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 679 ms. (steps per millisecond=1472 ) properties (out of 13) seen :119
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 676 ms. (steps per millisecond=1479 ) properties (out of 13) seen :129
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 685 ms. (steps per millisecond=1459 ) properties (out of 13) seen :132
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 673 ms. (steps per millisecond=1485 ) properties (out of 13) seen :135
// Phase 1: matrix 72 rows 45 cols
[2022-05-16 22:18:16] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 22:18:16] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:17] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-05-16 22:18:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:17] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-16 22:18:17] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:18:17] [INFO ] Added : 34 causal constraints over 7 iterations in 108 ms. Result :sat
Minimization took 21 ms.
[2022-05-16 22:18:17] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:17] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:18:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:17] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-05-16 22:18:17] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:18:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2022-05-16 22:18:17] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:18:17] [INFO ] Added : 23 causal constraints over 6 iterations in 142 ms. Result :sat
Minimization took 19 ms.
[2022-05-16 22:18:17] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:17] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 22:18:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:17] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-05-16 22:18:17] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:18:17] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:18:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2022-05-16 22:18:17] [INFO ] Added : 30 causal constraints over 8 iterations in 116 ms. Result :sat
Minimization took 40 ms.
[2022-05-16 22:18:17] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:17] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 22:18:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:17] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-05-16 22:18:17] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:18:18] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:18:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-16 22:18:18] [INFO ] Added : 35 causal constraints over 8 iterations in 178 ms. Result :sat
Minimization took 23 ms.
[2022-05-16 22:18:18] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 22:18:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:18] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-16 22:18:18] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-05-16 22:18:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-16 22:18:18] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:18] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-16 22:18:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-16 22:18:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:18] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-05-16 22:18:18] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:18:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2022-05-16 22:18:18] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:18] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 22:18:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:18] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2022-05-16 22:18:18] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2022-05-16 22:18:18] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:18:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 36 ms
[2022-05-16 22:18:18] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:18] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:18:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:18] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2022-05-16 22:18:18] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:18:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2022-05-16 22:18:18] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:18:18] [INFO ] Added : 18 causal constraints over 5 iterations in 54 ms. Result :sat
Minimization took 17 ms.
[2022-05-16 22:18:18] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:18] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-16 22:18:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:18] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2022-05-16 22:18:18] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:18:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2022-05-16 22:18:18] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:18:18] [INFO ] Added : 34 causal constraints over 8 iterations in 105 ms. Result :sat
Minimization took 23 ms.
[2022-05-16 22:18:18] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 22:18:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:18] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2022-05-16 22:18:18] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:18:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2022-05-16 22:18:18] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:18:19] [INFO ] Added : 30 causal constraints over 8 iterations in 91 ms. Result :sat
Minimization took 20 ms.
[2022-05-16 22:18:19] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:19] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-16 22:18:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:19] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-05-16 22:18:19] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:18:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 12 ms
[2022-05-16 22:18:19] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:19] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 22:18:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:19] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-05-16 22:18:19] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-05-16 22:18:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 14 ms
[2022-05-16 22:18:19] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:19] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-16 22:18:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:19] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:19] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-05-16 22:18:19] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:18:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 17 ms
Current structural bounds on expressions (after SMT) : [13, 13, 13, 13, 12, 12, 12, 13, 13, 13, 12, 12, 12] Max seen :[11, 11, 10, 10, 12, 12, 12, 11, 10, 10, 12, 12, 12]
FORMULA JoinFreeModules-PT-0010-UpperBounds-14 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0010-UpperBounds-13 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0010-UpperBounds-11 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0010-UpperBounds-07 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0010-UpperBounds-06 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0010-UpperBounds-05 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 6300 steps, including 115 resets, run finished after 18 ms. (steps per millisecond=350 ) properties (out of 7) seen :52 could not realise parikh vector
Incomplete Parikh walk after 7500 steps, including 111 resets, run finished after 14 ms. (steps per millisecond=535 ) properties (out of 7) seen :51 could not realise parikh vector
Incomplete Parikh walk after 6800 steps, including 114 resets, run finished after 11 ms. (steps per millisecond=618 ) properties (out of 7) seen :53 could not realise parikh vector
Incomplete Parikh walk after 7300 steps, including 122 resets, run finished after 12 ms. (steps per millisecond=608 ) properties (out of 7) seen :47 could not realise parikh vector
Incomplete Parikh walk after 6200 steps, including 114 resets, run finished after 10 ms. (steps per millisecond=620 ) properties (out of 7) seen :49 could not realise parikh vector
Incomplete Parikh walk after 7600 steps, including 120 resets, run finished after 12 ms. (steps per millisecond=633 ) properties (out of 7) seen :60 could not realise parikh vector
Incomplete Parikh walk after 8000 steps, including 112 resets, run finished after 15 ms. (steps per millisecond=533 ) properties (out of 7) seen :60 could not realise parikh vector
Support contains 7 out of 45 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 30 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions removed 24 transitions
Applied a total of 1 rules in 2 ms. Remains 30 /45 variables (removed 15) and now considering 48/72 (removed 24) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/45 places, 48/72 transitions.
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:19] [INFO ] Computed 6 place invariants in 2 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1212 ms. (steps per millisecond=825 ) properties (out of 7) seen :73
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 :72
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 480 ms. (steps per millisecond=2083 ) properties (out of 7) seen :73
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 491 ms. (steps per millisecond=2036 ) properties (out of 7) seen :72
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 489 ms. (steps per millisecond=2044 ) properties (out of 7) seen :73
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 :73
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 :63
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 491 ms. (steps per millisecond=2036 ) properties (out of 7) seen :73
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:24] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 22:18:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:18:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:24] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-16 22:18:24] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:18:24] [INFO ] Added : 24 causal constraints over 5 iterations in 66 ms. Result :sat
Minimization took 20 ms.
[2022-05-16 22:18:24] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:24] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 22:18:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:24] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 22:18:24] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:18:24] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-05-16 22:18:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-16 22:18:24] [INFO ] Added : 29 causal constraints over 6 iterations in 195 ms. Result :sat
Minimization took 20 ms.
[2022-05-16 22:18:24] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:18:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:24] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-05-16 22:18:24] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2022-05-16 22:18:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2022-05-16 22:18:24] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:18:24] [INFO ] Added : 17 causal constraints over 5 iterations in 27 ms. Result :sat
Minimization took 12 ms.
[2022-05-16 22:18:24] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:24] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 22:18:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:24] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-16 22:18:24] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:18:24] [INFO ] Added : 27 causal constraints over 8 iterations in 62 ms. Result :sat
Minimization took 18 ms.
[2022-05-16 22:18:24] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:18:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:24] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2022-05-16 22:18:24] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:18:24] [INFO ] Added : 23 causal constraints over 6 iterations in 34 ms. Result :sat
Minimization took 20 ms.
[2022-05-16 22:18:24] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:24] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:18:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:24] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:24] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-16 22:18:24] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:18:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-16 22:18:24] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:18:25] [INFO ] Added : 24 causal constraints over 5 iterations in 94 ms. Result :sat
Minimization took 16 ms.
[2022-05-16 22:18:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:25] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 22:18:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:25] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-05-16 22:18:25] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:18:25] [INFO ] Added : 23 causal constraints over 5 iterations in 45 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [13, 13, 13, 13, 13, 13, 13] Max seen :[11, 11, 10, 10, 11, 10, 10]
Incomplete Parikh walk after 6000 steps, including 133 resets, run finished after 16 ms. (steps per millisecond=375 ) properties (out of 7) seen :47 could not realise parikh vector
Incomplete Parikh walk after 6400 steps, including 128 resets, run finished after 10 ms. (steps per millisecond=640 ) properties (out of 7) seen :50 could not realise parikh vector
Incomplete Parikh walk after 6700 steps, including 109 resets, run finished after 9 ms. (steps per millisecond=744 ) properties (out of 7) seen :60 could not realise parikh vector
Incomplete Parikh walk after 7200 steps, including 115 resets, run finished after 11 ms. (steps per millisecond=654 ) properties (out of 7) seen :55 could not realise parikh vector
Incomplete Parikh walk after 3500 steps, including 160 resets, run finished after 5 ms. (steps per millisecond=700 ) properties (out of 7) seen :48 could not realise parikh vector
Incomplete Parikh walk after 7000 steps, including 108 resets, run finished after 11 ms. (steps per millisecond=636 ) properties (out of 7) seen :58 could not realise parikh vector
Incomplete Parikh walk after 7000 steps, including 110 resets, run finished after 10 ms. (steps per millisecond=700 ) properties (out of 7) seen :58 could not realise parikh vector
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 48/48 transitions.
Starting structural reductions, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:25] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 22:18:25] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:25] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 22:18:25] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-16 22:18:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:25] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 22:18:25] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 48/48 transitions.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-00
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:25] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :11
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 :11
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:25] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 22:18:25] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:25] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:18:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:25] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:25] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-16 22:18:25] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:18:25] [INFO ] Added : 24 causal constraints over 5 iterations in 66 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Incomplete Parikh walk after 7000 steps, including 110 resets, run finished after 15 ms. (steps per millisecond=466 ) properties (out of 1) seen :11 could not realise parikh vector
Support contains 1 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 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:25] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:25] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/30 places, 8/48 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:25] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 373 ms. (steps per millisecond=2680 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 180 ms. (steps per millisecond=5555 ) properties (out of 1) seen :11
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:26] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:18:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:18:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:26] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:18:26] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:18:26] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Incomplete Parikh walk after 2100 steps, including 99 resets, run finished after 2 ms. (steps per millisecond=1050 ) properties (out of 1) seen :11 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:26] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:18:26] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:26] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2022-05-16 22:18:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:26] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:26] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-00 in 821 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-02
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:26] [INFO ] Computed 6 place invariants in 2 ms
Incomplete random walk after 10004 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :11
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 :11
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:26] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 22:18:26] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:18:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:26] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 22:18:26] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:18:26] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:18:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2022-05-16 22:18:26] [INFO ] Added : 29 causal constraints over 6 iterations in 192 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Incomplete Parikh walk after 7000 steps, including 108 resets, run finished after 10 ms. (steps per millisecond=700 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 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 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:26] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-16 22:18:26] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/30 places, 8/48 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:26] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=2724 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=6172 ) properties (out of 1) seen :11
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:27] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:18:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:27] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-16 22:18:27] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:18:27] [INFO ] Added : 6 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Incomplete Parikh walk after 2100 steps, including 99 resets, run finished after 3 ms. (steps per millisecond=700 ) properties (out of 1) seen :11 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:27] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:27] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2022-05-16 22:18:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:27] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:18:27] [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-0010-UpperBounds-02 in 925 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-03
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:27] [INFO ] Computed 6 place invariants in 0 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :10
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 :10
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:27] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 22:18:27] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:27] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:18:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:27] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:27] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-05-16 22:18:27] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2022-05-16 22:18:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-05-16 22:18:27] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 5 ms.
[2022-05-16 22:18:27] [INFO ] Added : 17 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Incomplete Parikh walk after 3500 steps, including 158 resets, run finished after 8 ms. (steps per millisecond=437 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 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 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:27] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/30 places, 8/48 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:27] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=2724 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 150 ms. (steps per millisecond=6666 ) properties (out of 1) seen :10
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:27] [INFO ] Computed 1 place invariants in 9 ms
[2022-05-16 22:18:27] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:27] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:18:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:18:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:27] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:18:27] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:18:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 8 ms
[2022-05-16 22:18:27] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:18:27] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Incomplete Parikh walk after 1200 steps, including 146 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:27] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:27] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:18:27] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2022-05-16 22:18:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:27] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 22:18:27] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-03 in 819 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-04
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:27] [INFO ] Computed 6 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :10
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 :10
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:27] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 22:18:27] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:28] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:18:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:28] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-16 22:18:28] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:18:28] [INFO ] Added : 27 causal constraints over 8 iterations in 56 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Incomplete Parikh walk after 7200 steps, including 115 resets, run finished after 14 ms. (steps per millisecond=514 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 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 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:28] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/30 places, 8/48 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:28] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 367 ms. (steps per millisecond=2724 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=6711 ) properties (out of 1) seen :10
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:28] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:18:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:28] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:18:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:18:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:28] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:18:28] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2022-05-16 22:18:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 8 ms
[2022-05-16 22:18:28] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:18:28] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Incomplete Parikh walk after 1200 steps, including 146 resets, run finished after 1 ms. (steps per millisecond=1200 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:28] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:18:28] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:28] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:18:28] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2022-05-16 22:18:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:28] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:18:28] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-04 in 804 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-08
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:28] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :11
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 :11
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:28] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 22:18:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:28] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:18:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:28] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2022-05-16 22:18:28] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:18:28] [INFO ] Added : 23 causal constraints over 6 iterations in 65 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Incomplete Parikh walk after 6700 steps, including 110 resets, run finished after 17 ms. (steps per millisecond=394 ) properties (out of 1) seen :11 could not realise parikh vector
Support contains 1 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 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:28] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/30 places, 8/48 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:28] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=2610 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 155 ms. (steps per millisecond=6451 ) properties (out of 1) seen :11
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:18:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:29] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:18:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:29] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:18:29] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:18:29] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Incomplete Parikh walk after 2100 steps, including 99 resets, run finished after 3 ms. (steps per millisecond=700 ) properties (out of 1) seen :11 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:29] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:18:29] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:29] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:29] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
[2022-05-16 22:18:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:29] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:29] [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-0010-UpperBounds-08 in 834 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-09
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:29] [INFO ] Computed 6 place invariants in 0 ms
Incomplete random walk after 10002 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :10
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 :10
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:29] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 22:18:29] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:29] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:18:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:29] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:29] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-16 22:18:29] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-05-16 22:18:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2022-05-16 22:18:29] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:18:29] [INFO ] Added : 24 causal constraints over 5 iterations in 89 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Incomplete Parikh walk after 6400 steps, including 129 resets, run finished after 12 ms. (steps per millisecond=533 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 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 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:29] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:29] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/30 places, 8/48 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:29] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=2666 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=7092 ) properties (out of 1) seen :10
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:30] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:30] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:18:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:30] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:18:30] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:18:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2022-05-16 22:18:30] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:18:30] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Incomplete Parikh walk after 1200 steps, including 145 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:30] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:18:30] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:30] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2022-05-16 22:18:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:30] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-09 in 857 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-10
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:30] [INFO ] Computed 6 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :10
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 :10
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:30] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 22:18:30] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:30] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:18:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:30] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-05-16 22:18:30] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:18:30] [INFO ] Added : 23 causal constraints over 5 iterations in 45 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Incomplete Parikh walk after 6000 steps, including 133 resets, run finished after 14 ms. (steps per millisecond=428 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 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 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:30] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:30] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/30 places, 8/48 transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:30] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 372 ms. (steps per millisecond=2688 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=6622 ) properties (out of 1) seen :10
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:31] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:18:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:31] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:18:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:31] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:18:31] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:18:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2022-05-16 22:18:31] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:18:31] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Incomplete Parikh walk after 1200 steps, including 146 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:31] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:31] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:31] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2022-05-16 22:18:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:18:31] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:18:31] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-10 in 824 ms.
[2022-05-16 22:18:31] [INFO ] Flatten gal took : 25 ms
[2022-05-16 22:18:31] [INFO ] Applying decomposition
[2022-05-16 22:18:31] [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/graph6107250068126761736.txt, -o, /tmp/graph6107250068126761736.bin, -w, /tmp/graph6107250068126761736.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/graph6107250068126761736.bin, -l, -1, -v, -w, /tmp/graph6107250068126761736.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 22:18:31] [INFO ] Decomposing Gal with order
[2022-05-16 22:18:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 22:18:31] [INFO ] Flatten gal took : 4 ms
[2022-05-16 22:18:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 22:18:31] [INFO ] Time to serialize gal into /tmp/UpperBounds17745393715161744952.gal : 1 ms
[2022-05-16 22:18:31] [INFO ] Time to serialize properties into /tmp/UpperBounds10611253558209218016.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/UpperBounds17745393715161744952.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds10611253558209218016.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/UpperBounds17745393715161744952.gal -t CGAL -reachable-file /tmp/UpperBounds10611253558209218016.prop --nowitness
Loading property file /tmp/UpperBounds10611253558209218016.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,8.33446e+19,0.030625,4288,8,89,22,2679,26,0,52,2738,0
Total reachable state count : 83344647990241000000

Verifying 7 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 11
Bounds property JoinFreeModules-PT-0010-UpperBounds-00 :0 <= u5.p47 <= 11
FORMULA JoinFreeModules-PT-0010-UpperBounds-00 11 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-0010-UpperBounds-00,0,0.031697,4288,1,0,36,2679,62,7,81,2738,53
Min sum of variable value : 0
Maximum sum along a path : 11
Bounds property JoinFreeModules-PT-0010-UpperBounds-02 :0 <= u2.p22 <= 11
FORMULA JoinFreeModules-PT-0010-UpperBounds-02 11 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-0010-UpperBounds-02,0,0.031847,4288,1,0,42,2679,77,7,81,2738,63
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property JoinFreeModules-PT-0010-UpperBounds-03 :0 <= u0.p3 <= 10
FORMULA JoinFreeModules-PT-0010-UpperBounds-03 10 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-0010-UpperBounds-03,0,0.032413,4288,1,0,49,2679,89,7,99,2738,75
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property JoinFreeModules-PT-0010-UpperBounds-04 :0 <= u3.p28 <= 10
FORMULA JoinFreeModules-PT-0010-UpperBounds-04 10 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-0010-UpperBounds-04,0,0.03257,4288,1,0,53,2679,100,7,99,2738,82
Min sum of variable value : 0
Maximum sum along a path : 11
Bounds property JoinFreeModules-PT-0010-UpperBounds-08 :0 <= u1.p7 <= 11
FORMULA JoinFreeModules-PT-0010-UpperBounds-08 11 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-0010-UpperBounds-08,0,0.032714,4288,1,0,59,2679,109,7,99,2738,93
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property JoinFreeModules-PT-0010-UpperBounds-09 :0 <= u5.p48 <= 10
FORMULA JoinFreeModules-PT-0010-UpperBounds-09 10 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-0010-UpperBounds-09,0,0.032785,4288,1,0,61,2679,120,7,99,2738,96
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property JoinFreeModules-PT-0010-UpperBounds-10 :0 <= u4.p43 <= 10
FORMULA JoinFreeModules-PT-0010-UpperBounds-10 10 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-0010-UpperBounds-10,0,0.032852,4288,1,0,64,2679,132,7,99,2738,101

BK_STOP 1652739512704

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is JoinFreeModules-PT-0010, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r143-tall-165271830200061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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