About the Execution of 2021-gold for JoinFreeModules-PT-0020
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-165271830200064.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-0020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-tall-165271830200064
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 248K
-rw-r--r-- 1 mcc users 5.3K Apr 30 02:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Apr 30 02:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 30 02:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Apr 30 02:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 9 08:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 08:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 61K 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-0020-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652739505936
Running Version 0
[2022-05-16 22:18:27] [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:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 22:18:27] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2022-05-16 22:18:27] [INFO ] Transformed 101 places.
[2022-05-16 22:18:27] [INFO ] Transformed 161 transitions.
[2022-05-16 22:18:27] [INFO ] Parsed PT model containing 101 places and 161 transitions in 183 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 161 rows 100 cols
[2022-05-16 22:18:27] [INFO ] Computed 20 place invariants in 20 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 16) seen :301
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 16) seen :109
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :122
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :113
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :117
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :139
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 16) seen :114
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :113
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 :127
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :118
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :128
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 :113
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :129
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 :127
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 16) seen :114
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :115
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 :123
// Phase 1: matrix 161 rows 100 cols
[2022-05-16 22:18:28] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-16 22:18:28] [INFO ] [Real]Absence check using 20 positive place invariants in 13 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 73 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 20 positive place invariants in 4 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 192 ms returned sat
[2022-05-16 22:18:28] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 4 ms to minimize.
[2022-05-16 22:18:28] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2022-05-16 22:18:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2022-05-16 22:18:28] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 26 ms.
[2022-05-16 22:18:28] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-05-16 22:18:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2022-05-16 22:18:28] [INFO ] Added : 58 causal constraints over 12 iterations in 370 ms. Result :sat
Minimization took 52 ms.
[2022-05-16 22:18:29] [INFO ] [Real]Absence check using 20 positive place invariants in 3 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 37 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 20 positive place invariants in 4 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 130 ms returned sat
[2022-05-16 22:18:29] [INFO ] Deduced a trap composed of 3 places in 10 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 : 120/300/120 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-16 22:18:29] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-05-16 22:18:29] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:18:29] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:18:29] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:18:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 148 ms
[2022-05-16 22:18:29] [INFO ] Added : 57 causal constraints over 12 iterations in 324 ms. Result :sat
Minimization took 65 ms.
[2022-05-16 22:18:29] [INFO ] [Real]Absence check using 20 positive place invariants in 3 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 32 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 20 positive place invariants in 4 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 114 ms returned sat
[2022-05-16 22:18:29] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:18:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-16 22:18:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 92 ms
[2022-05-16 22:18:30] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-16 22:18:30] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-05-16 22:18:30] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:18:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 72 ms
[2022-05-16 22:18:30] [INFO ] Added : 68 causal constraints over 15 iterations in 360 ms. Result :sat
Minimization took 36 ms.
[2022-05-16 22:18:30] [INFO ] [Real]Absence check using 20 positive place invariants in 3 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 34 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 20 positive place invariants in 3 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 164 ms returned sat
[2022-05-16 22:18:30] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-05-16 22:18:30] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-05-16 22:18:30] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:18:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 95 ms
[2022-05-16 22:18:30] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-16 22:18:30] [INFO ] Added : 61 causal constraints over 14 iterations in 229 ms. Result :sat
Minimization took 59 ms.
[2022-05-16 22:18:31] [INFO ] [Real]Absence check using 20 positive place invariants in 3 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 30 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 20 positive place invariants in 4 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 139 ms returned sat
[2022-05-16 22:18:31] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:18:31] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2022-05-16 22:18:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2022-05-16 22:18:31] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-16 22:18:31] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:18:31] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:18:31] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2022-05-16 22:18:31] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2022-05-16 22:18:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 106 ms
[2022-05-16 22:18:31] [INFO ] Added : 60 causal constraints over 13 iterations in 410 ms. Result :sat
Minimization took 54 ms.
[2022-05-16 22:18:31] [INFO ] [Real]Absence check using 20 positive place invariants in 3 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 31 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 20 positive place invariants in 3 ms returned sat
[2022-05-16 22:18:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:32] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2022-05-16 22:18:32] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:18:32] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:18:32] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2022-05-16 22:18:32] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 65 ms
[2022-05-16 22:18:32] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 22:18:32] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2022-05-16 22:18:32] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:18:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 55 ms
[2022-05-16 22:18:32] [INFO ] Added : 56 causal constraints over 12 iterations in 313 ms. Result :sat
Minimization took 59 ms.
[2022-05-16 22:18:32] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2022-05-16 22:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:32] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2022-05-16 22:18:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:32] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2022-05-16 22:18:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:32] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2022-05-16 22:18:32] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:18:32] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2022-05-16 22:18:32] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:18:32] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2022-05-16 22:18:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 85 ms
[2022-05-16 22:18:32] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-16 22:18:33] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:18:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2022-05-16 22:18:33] [INFO ] Added : 77 causal constraints over 17 iterations in 360 ms. Result :sat
Minimization took 42 ms.
[2022-05-16 22:18:33] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2022-05-16 22:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:33] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2022-05-16 22:18:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:33] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2022-05-16 22:18:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:33] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2022-05-16 22:18:33] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2022-05-16 22:18:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-16 22:18:33] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-16 22:18:33] [INFO ] Added : 53 causal constraints over 11 iterations in 167 ms. Result :sat
Minimization took 50 ms.
[2022-05-16 22:18:33] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2022-05-16 22:18:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:33] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-05-16 22:18:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:33] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2022-05-16 22:18:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:33] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2022-05-16 22:18:33] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2022-05-16 22:18:33] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2022-05-16 22:18:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 40 ms
[2022-05-16 22:18:33] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 22:18:34] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 5 ms to minimize.
[2022-05-16 22:18:34] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:18:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 53 ms
[2022-05-16 22:18:34] [INFO ] Added : 63 causal constraints over 13 iterations in 305 ms. Result :sat
Minimization took 45 ms.
[2022-05-16 22:18:34] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2022-05-16 22:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:34] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-05-16 22:18:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2022-05-16 22:18:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:34] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2022-05-16 22:18:34] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:18:34] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2022-05-16 22:18:34] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2022-05-16 22:18:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 56 ms
[2022-05-16 22:18:34] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 22:18:34] [INFO ] Added : 62 causal constraints over 13 iterations in 248 ms. Result :sat
Minimization took 46 ms.
[2022-05-16 22:18:34] [INFO ] [Real]Absence check using 20 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:34] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-05-16 22:18:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2022-05-16 22:18:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:35] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2022-05-16 22:18:35] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2022-05-16 22:18:35] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2022-05-16 22:18:35] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2022-05-16 22:18:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 54 ms
[2022-05-16 22:18:35] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 22:18:35] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:18:35] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2022-05-16 22:18:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 58 ms
[2022-05-16 22:18:35] [INFO ] Added : 57 causal constraints over 12 iterations in 315 ms. Result :sat
Minimization took 38 ms.
[2022-05-16 22:18:35] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2022-05-16 22:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:35] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-05-16 22:18:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:35] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2022-05-16 22:18:35] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2022-05-16 22:18:35] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:18:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 36 ms
[2022-05-16 22:18:35] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 22:18:35] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:18:35] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:18:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2022-05-16 22:18:36] [INFO ] Added : 66 causal constraints over 14 iterations in 299 ms. Result :sat
Minimization took 54 ms.
[2022-05-16 22:18:36] [INFO ] [Real]Absence check using 20 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:36] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-16 22:18:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:36] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2022-05-16 22:18:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:36] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2022-05-16 22:18:36] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-05-16 22:18:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-16 22:18:36] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 22:18:36] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:18:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-16 22:18:36] [INFO ] Added : 31 causal constraints over 7 iterations in 145 ms. Result :sat
Minimization took 41 ms.
[2022-05-16 22:18:36] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2022-05-16 22:18:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:36] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-05-16 22:18:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:36] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2022-05-16 22:18:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:36] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2022-05-16 22:18:36] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-05-16 22:18:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2022-05-16 22:18:36] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-16 22:18:36] [INFO ] Added : 41 causal constraints over 10 iterations in 164 ms. Result :sat
Minimization took 65 ms.
[2022-05-16 22:18:37] [INFO ] [Real]Absence check using 20 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:37] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-16 22:18:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:37] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2022-05-16 22:18:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:37] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2022-05-16 22:18:37] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-16 22:18:37] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 1 ms to minimize.
[2022-05-16 22:18:37] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2022-05-16 22:18:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 73 ms
[2022-05-16 22:18:37] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-16 22:18:37] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-05-16 22:18:37] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:18:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2022-05-16 22:18:37] [INFO ] Added : 60 causal constraints over 13 iterations in 311 ms. Result :sat
Minimization took 33 ms.
[2022-05-16 22:18:37] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2022-05-16 22:18:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:37] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2022-05-16 22:18:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:37] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2022-05-16 22:18:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:37] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2022-05-16 22:18:37] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2022-05-16 22:18:37] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2022-05-16 22:18:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 47 ms
[2022-05-16 22:18:37] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-16 22:18:38] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:18:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2022-05-16 22:18:38] [INFO ] Added : 53 causal constraints over 12 iterations in 237 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23] Max seen :[20, 21, 17, 20, 18, 12, 18, 21, 18, 21, 20, 18, 21, 20, 20, 20]
Incomplete Parikh walk after 19000 steps, including 122 resets, run finished after 59 ms. (steps per millisecond=322 ) properties (out of 16) seen :141 could not realise parikh vector
Incomplete Parikh walk after 12600 steps, including 127 resets, run finished after 48 ms. (steps per millisecond=262 ) properties (out of 16) seen :130 could not realise parikh vector
Incomplete Parikh walk after 12500 steps, including 114 resets, run finished after 38 ms. (steps per millisecond=328 ) properties (out of 16) seen :133 could not realise parikh vector
Incomplete Parikh walk after 12400 steps, including 115 resets, run finished after 36 ms. (steps per millisecond=344 ) properties (out of 16) seen :128 could not realise parikh vector
Incomplete Parikh walk after 19600 steps, including 116 resets, run finished after 72 ms. (steps per millisecond=272 ) properties (out of 16) seen :163 could not realise parikh vector
Incomplete Parikh walk after 12800 steps, including 140 resets, run finished after 52 ms. (steps per millisecond=246 ) properties (out of 16) seen :115 could not realise parikh vector
Incomplete Parikh walk after 18100 steps, including 124 resets, run finished after 49 ms. (steps per millisecond=369 ) properties (out of 16) seen :166 could not realise parikh vector
Incomplete Parikh walk after 18400 steps, including 122 resets, run finished after 51 ms. (steps per millisecond=360 ) properties (out of 16) seen :138 could not realise parikh vector
Incomplete Parikh walk after 16000 steps, including 112 resets, run finished after 42 ms. (steps per millisecond=380 ) properties (out of 16) seen :136 could not realise parikh vector
Incomplete Parikh walk after 22400 steps, including 107 resets, run finished after 61 ms. (steps per millisecond=367 ) properties (out of 16) seen :165 could not realise parikh vector
Incomplete Parikh walk after 20000 steps, including 110 resets, run finished after 52 ms. (steps per millisecond=384 ) properties (out of 16) seen :160 could not realise parikh vector
Incomplete Parikh walk after 16500 steps, including 125 resets, run finished after 47 ms. (steps per millisecond=351 ) properties (out of 16) seen :145 could not realise parikh vector
FORMULA JoinFreeModules-PT-0020-UpperBounds-04 23 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 13900 steps, including 111 resets, run finished after 41 ms. (steps per millisecond=339 ) properties (out of 15) seen :142 could not realise parikh vector
Incomplete Parikh walk after 17700 steps, including 122 resets, run finished after 49 ms. (steps per millisecond=361 ) properties (out of 15) seen :152 could not realise parikh vector
Incomplete Parikh walk after 28500 steps, including 117 resets, run finished after 72 ms. (steps per millisecond=395 ) properties (out of 15) seen :129 could not realise parikh vector
Incomplete Parikh walk after 24700 steps, including 126 resets, run finished after 60 ms. (steps per millisecond=411 ) properties (out of 15) seen :146 could not realise parikh vector
Support contains 15 out of 100 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 100/100 places, 161/161 transitions.
Graph (complete) has 240 edges and 100 vertex of which 55 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.2 ms
Discarding 45 places :
Also discarding 72 output transitions
Drop transitions removed 72 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 55 transition count 88
Applied a total of 2 rules in 18 ms. Remains 55 /100 variables (removed 45) and now considering 88/161 (removed 73) transitions.
// Phase 1: matrix 88 rows 55 cols
[2022-05-16 22:18:39] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 22:18:39] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/100 places, 88/161 transitions.
// Phase 1: matrix 88 rows 55 cols
[2022-05-16 22:18:39] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1506 ms. (steps per millisecond=664 ) properties (out of 15) seen :320
FORMULA JoinFreeModules-PT-0020-UpperBounds-12 23 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-11 23 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 818 ms. (steps per millisecond=1222 ) properties (out of 13) seen :242
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 827 ms. (steps per millisecond=1209 ) properties (out of 13) seen :237
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 820 ms. (steps per millisecond=1219 ) properties (out of 13) seen :228
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 865 ms. (steps per millisecond=1156 ) properties (out of 13) seen :220
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 837 ms. (steps per millisecond=1194 ) properties (out of 13) seen :226
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 800 ms. (steps per millisecond=1250 ) properties (out of 13) seen :234
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 757 ms. (steps per millisecond=1321 ) properties (out of 13) seen :234
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 777 ms. (steps per millisecond=1287 ) properties (out of 13) seen :232
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 777 ms. (steps per millisecond=1287 ) properties (out of 13) seen :231
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 794 ms. (steps per millisecond=1259 ) properties (out of 13) seen :226
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties (out of 13) seen :216
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties (out of 13) seen :217
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 793 ms. (steps per millisecond=1261 ) properties (out of 13) seen :230
// Phase 1: matrix 88 rows 55 cols
[2022-05-16 22:18:51] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-16 22:18:51] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:51] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:18:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:51] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-05-16 22:18:51] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2022-05-16 22:18:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 12 ms
[2022-05-16 22:18:51] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:18:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:51] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2022-05-16 22:18:51] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-16 22:18:51] [INFO ] Added : 45 causal constraints over 9 iterations in 117 ms. Result :sat
Minimization took 35 ms.
[2022-05-16 22:18:51] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:18:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:51] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-16 22:18:51] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:18:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 12 ms
[2022-05-16 22:18:51] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:51] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 22:18:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:51] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2022-05-16 22:18:51] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:18:51] [INFO ] Added : 17 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 29 ms.
[2022-05-16 22:18:51] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:51] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 22:18:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:51] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2022-05-16 22:18:51] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 1 ms to minimize.
[2022-05-16 22:18:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 16 ms
[2022-05-16 22:18:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:52] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:18:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:52] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2022-05-16 22:18:52] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:18:52] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:18:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 28 ms
[2022-05-16 22:18:52] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 22:18:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:52] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-05-16 22:18:52] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:18:52] [INFO ] Added : 23 causal constraints over 7 iterations in 114 ms. Result :sat
Minimization took 25 ms.
[2022-05-16 22:18:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 22:18:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:52] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2022-05-16 22:18:52] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:18:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 13 ms
[2022-05-16 22:18:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:52] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:18:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:52] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2022-05-16 22:18:52] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 1 ms to minimize.
[2022-05-16 22:18:52] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2022-05-16 22:18:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 35 ms
[2022-05-16 22:18:52] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-16 22:18:52] [INFO ] Added : 20 causal constraints over 5 iterations in 78 ms. Result :sat
Minimization took 32 ms.
[2022-05-16 22:18:52] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 22:18:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:52] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2022-05-16 22:18:52] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2022-05-16 22:18:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-16 22:18:52] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:18:53] [INFO ] Added : 29 causal constraints over 7 iterations in 407 ms. Result :sat
Minimization took 31 ms.
[2022-05-16 22:18:53] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-16 22:18:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:18:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:53] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2022-05-16 22:18:53] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2022-05-16 22:18:53] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 3 ms to minimize.
[2022-05-16 22:18:53] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2022-05-16 22:18:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 84 ms
[2022-05-16 22:18:53] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:18:53] [INFO ] Added : 23 causal constraints over 6 iterations in 60 ms. Result :sat
Minimization took 32 ms.
[2022-05-16 22:18:53] [INFO ] [Real]Absence check using 11 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:53] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2022-05-16 22:18:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:53] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2022-05-16 22:18:53] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2022-05-16 22:18:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-16 22:18:53] [INFO ] Computed and/alt/rep : 66/165/66 causal constraints (skipped 0 transitions) in 6 ms.
[2022-05-16 22:18:53] [INFO ] Added : 21 causal constraints over 5 iterations in 40 ms. Result :sat
Minimization took 24 ms.
[2022-05-16 22:18:53] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:53] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:18:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:54] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2022-05-16 22:18:54] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2022-05-16 22:18:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 14 ms
Current structural bounds on expressions (after SMT) : [22, 23, 22, 23, 22, 22, 23, 22, 23, 23, 23, 23, 22] Max seen :[22, 21, 22, 20, 22, 22, 21, 22, 21, 20, 20, 20, 22]
FORMULA JoinFreeModules-PT-0020-UpperBounds-15 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-08 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-06 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-05 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-02 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-00 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 32900 steps, including 106 resets, run finished after 64 ms. (steps per millisecond=514 ) properties (out of 7) seen :102 could not realise parikh vector
Incomplete Parikh walk after 8300 steps, including 122 resets, run finished after 19 ms. (steps per millisecond=436 ) properties (out of 7) seen :97 could not realise parikh vector
Incomplete Parikh walk after 5800 steps, including 120 resets, run finished after 14 ms. (steps per millisecond=414 ) properties (out of 7) seen :91 could not realise parikh vector
Incomplete Parikh walk after 28700 steps, including 109 resets, run finished after 47 ms. (steps per millisecond=610 ) properties (out of 7) seen :116 could not realise parikh vector
Incomplete Parikh walk after 7400 steps, including 126 resets, run finished after 11 ms. (steps per millisecond=672 ) properties (out of 7) seen :102 could not realise parikh vector
Incomplete Parikh walk after 8800 steps, including 112 resets, run finished after 12 ms. (steps per millisecond=733 ) properties (out of 7) seen :104 could not realise parikh vector
Incomplete Parikh walk after 15200 steps, including 115 resets, run finished after 28 ms. (steps per millisecond=542 ) properties (out of 7) seen :122 could not realise parikh vector
Support contains 7 out of 55 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 55/55 places, 88/88 transitions.
Graph (complete) has 132 edges and 55 vertex of which 30 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Applied a total of 1 rules in 3 ms. Remains 30 /55 variables (removed 25) and now considering 48/88 (removed 40) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/55 places, 48/88 transitions.
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:54] [INFO ] Computed 6 place invariants in 2 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 906 ms. (steps per millisecond=1103 ) properties (out of 7) seen :143
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 467 ms. (steps per millisecond=2141 ) properties (out of 7) seen :139
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 458 ms. (steps per millisecond=2183 ) properties (out of 7) seen :138
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=2188 ) properties (out of 7) seen :137
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 456 ms. (steps per millisecond=2192 ) properties (out of 7) seen :139
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 458 ms. (steps per millisecond=2183 ) properties (out of 7) seen :137
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=2155 ) properties (out of 7) seen :121
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 465 ms. (steps per millisecond=2150 ) properties (out of 7) seen :139
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:58] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 22:18:58] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:58] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:18:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:58] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-05-16 22:18:58] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2022-05-16 22:18:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2022-05-16 22:18:58] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:18:58] [INFO ] Added : 30 causal constraints over 7 iterations in 41 ms. Result :sat
Minimization took 21 ms.
[2022-05-16 22:18:58] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:58] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:18:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:58] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2022-05-16 22:18:58] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:18:58] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:18:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 10 ms
[2022-05-16 22:18:58] [INFO ] Added : 24 causal constraints over 5 iterations in 56 ms. Result :sat
Minimization took 16 ms.
[2022-05-16 22:18:58] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:58] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:18:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:58] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:18:58] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:18:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 10 ms
[2022-05-16 22:18:58] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:18:58] [INFO ] Added : 20 causal constraints over 5 iterations in 65 ms. Result :sat
Minimization took 19 ms.
[2022-05-16 22:18:58] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:58] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:18:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 22:18:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:58] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:18:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2022-05-16 22:18:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-16 22:18:58] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:18:58] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2022-05-16 22:18:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 10 ms
[2022-05-16 22:18:58] [INFO ] Added : 28 causal constraints over 6 iterations in 53 ms. Result :sat
Minimization took 14 ms.
[2022-05-16 22:18:58] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:59] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:18:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:59] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-05-16 22:18:59] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:18:59] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2022-05-16 22:18:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2022-05-16 22:18:59] [INFO ] Added : 27 causal constraints over 7 iterations in 108 ms. Result :sat
Minimization took 24 ms.
[2022-05-16 22:18:59] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:59] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:18:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:59] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-05-16 22:18:59] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:18:59] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2022-05-16 22:18:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2022-05-16 22:18:59] [INFO ] Added : 21 causal constraints over 5 iterations in 60 ms. Result :sat
Minimization took 16 ms.
[2022-05-16 22:18:59] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:59] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:18:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:59] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:18:59] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:18:59] [INFO ] Added : 30 causal constraints over 6 iterations in 145 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [23, 23, 23, 23, 23, 23, 23] Max seen :[21, 20, 21, 21, 20, 20, 20]
Incomplete Parikh walk after 5800 steps, including 112 resets, run finished after 16 ms. (steps per millisecond=362 ) properties (out of 7) seen :95 could not realise parikh vector
Incomplete Parikh walk after 10200 steps, including 121 resets, run finished after 13 ms. (steps per millisecond=784 ) properties (out of 7) seen :101 could not realise parikh vector
Incomplete Parikh walk after 5900 steps, including 116 resets, run finished after 10 ms. (steps per millisecond=590 ) properties (out of 7) seen :92 could not realise parikh vector
Incomplete Parikh walk after 8300 steps, including 107 resets, run finished after 11 ms. (steps per millisecond=754 ) properties (out of 7) seen :110 could not realise parikh vector
Incomplete Parikh walk after 7600 steps, including 109 resets, run finished after 10 ms. (steps per millisecond=760 ) properties (out of 7) seen :106 could not realise parikh vector
Incomplete Parikh walk after 4600 steps, including 124 resets, run finished after 8 ms. (steps per millisecond=575 ) properties (out of 7) seen :90 could not realise parikh vector
Incomplete Parikh walk after 15600 steps, including 123 resets, run finished after 19 ms. (steps per millisecond=821 ) properties (out of 7) seen :113 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 1 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:59] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 22:18:59] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:59] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 22:18:59] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-16 22:18:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:59] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 22:18:59] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 48/48 transitions.
Starting property specific reduction for JoinFreeModules-PT-0020-UpperBounds-01
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:59] [INFO ] Computed 6 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :19
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 :18
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:18:59] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 22:18:59] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:59] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2022-05-16 22:18:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:18:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:18:59] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2022-05-16 22:18:59] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:18:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2022-05-16 22:18:59] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:18:59] [INFO ] Added : 18 causal constraints over 4 iterations in 36 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[19]
Incomplete Parikh walk after 38700 steps, including 101 resets, run finished after 41 ms. (steps per millisecond=943 ) properties (out of 1) seen :20 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:59] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:18:59] [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:59] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 284 ms. (steps per millisecond=3521 ) properties (out of 1) seen :22
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 :18
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:19:00] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:19:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:00] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:19:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:19:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:00] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:19:00] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2022-05-16 22:19:00] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 6 ms
Current structural bounds on expressions (after SMT) : [22] Max seen :[22]
FORMULA JoinFreeModules-PT-0020-UpperBounds-01 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for JoinFreeModules-PT-0020-UpperBounds-01 in 705 ms.
Starting property specific reduction for JoinFreeModules-PT-0020-UpperBounds-03
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:19:00] [INFO ] Computed 6 place invariants in 0 ms
Incomplete random walk after 10005 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :20
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 :20
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:19:00] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 22:19:00] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2022-05-16 22:19:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:00] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:19:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:19:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:00] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 22:19:00] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:19:00] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2022-05-16 22:19:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2022-05-16 22:19:00] [INFO ] Added : 24 causal constraints over 5 iterations in 51 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[20]
Incomplete Parikh walk after 4600 steps, including 123 resets, run finished after 12 ms. (steps per millisecond=383 ) properties (out of 1) seen :20 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:19:00] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:19:00] [INFO ] Dead Transitions using invariants and state equation in 14 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:19:00] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=3663 ) properties (out of 1) seen :20
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 :20
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:19:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:19:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:01] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:19:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:19:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:01] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:19:01] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:19:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 10 ms
[2022-05-16 22:19:01] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:19:01] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[20]
Incomplete Parikh walk after 1200 steps, including 145 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :20 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:19:01] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:19:01] [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:19:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:19:01] [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-0020-UpperBounds-03 in 707 ms.
Starting property specific reduction for JoinFreeModules-PT-0020-UpperBounds-07
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:19:01] [INFO ] Computed 6 place invariants in 1 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :21
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :21
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:19:01] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 22:19:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 22:19:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:19:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:19:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:01] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 22:19:01] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2022-05-16 22:19:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2022-05-16 22:19:01] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 4 ms.
[2022-05-16 22:19:01] [INFO ] Added : 20 causal constraints over 5 iterations in 71 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[21]
Incomplete Parikh walk after 7600 steps, including 110 resets, run finished after 11 ms. (steps per millisecond=690 ) properties (out of 1) seen :18 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:19:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:19:01] [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:19:01] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=3703 ) properties (out of 1) seen :21
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 247 ms. (steps per millisecond=4048 ) properties (out of 1) seen :21
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:19:01] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:19:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:01] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:19:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:19:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:01] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2022-05-16 22:19:01] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 22:19:01] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[21]
Incomplete Parikh walk after 3100 steps, including 98 resets, run finished after 2 ms. (steps per millisecond=1550 ) properties (out of 1) seen :21 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:19:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:19:01] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:01] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:19:01] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2022-05-16 22:19:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:01] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:19:01] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0020-UpperBounds-07 in 811 ms.
Starting property specific reduction for JoinFreeModules-PT-0020-UpperBounds-09
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:19:01] [INFO ] Computed 6 place invariants in 0 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :21
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 :21
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:19:01] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 22:19:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:19:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:01] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:19:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:19:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:02] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-16 22:19:02] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2022-05-16 22:19:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2022-05-16 22:19:02] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-16 22:19:02] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2022-05-16 22:19:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2022-05-16 22:19:02] [INFO ] Added : 28 causal constraints over 6 iterations in 57 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[21]
Incomplete Parikh walk after 8300 steps, including 108 resets, run finished after 13 ms. (steps per millisecond=638 ) properties (out of 1) seen :20 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:19:02] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:19:02] [INFO ] Dead Transitions using invariants and state equation in 8 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:19:02] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=3663 ) properties (out of 1) seen :21
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=6993 ) properties (out of 1) seen :21
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:19:02] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:19:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:02] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:19:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:19:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:02] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:19:02] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:19:02] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[21]
Incomplete Parikh walk after 3100 steps, including 98 resets, run finished after 2 ms. (steps per millisecond=1550 ) properties (out of 1) seen :21 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:19:02] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 22:19:02] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:19:02] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2022-05-16 22:19:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:19:02] [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-0020-UpperBounds-09 in 673 ms.
Starting property specific reduction for JoinFreeModules-PT-0020-UpperBounds-10
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:19:02] [INFO ] Computed 6 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :20
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 :20
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:19:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 22:19:02] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 22:19:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:02] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2022-05-16 22:19:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:19:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:02] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-16 22:19:02] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:19:02] [INFO ] Deduced a trap composed of 3 places in 10 ms of which 0 ms to minimize.
[2022-05-16 22:19:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2022-05-16 22:19:02] [INFO ] Added : 27 causal constraints over 7 iterations in 98 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[20]
Incomplete Parikh walk after 5900 steps, including 116 resets, run finished after 16 ms. (steps per millisecond=368 ) properties (out of 1) seen :20 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:19:02] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:19:02] [INFO ] Dead Transitions using invariants and state equation in 12 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:19:02] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=3663 ) properties (out of 1) seen :20
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=7142 ) properties (out of 1) seen :20
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:03] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:19:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:03] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:19:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-05-16 22:19:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:03] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:19:03] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2022-05-16 22:19:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2022-05-16 22:19:03] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 22:19:03] [INFO ] Added : 6 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[20]
Incomplete Parikh walk after 1200 steps, including 147 resets, run finished after 1 ms. (steps per millisecond=1200 ) properties (out of 1) seen :20 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:19:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:19:03] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:19:03] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2022-05-16 22:19:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:19:03] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0020-UpperBounds-10 in 728 ms.
Starting property specific reduction for JoinFreeModules-PT-0020-UpperBounds-13
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:19:03] [INFO ] Computed 6 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :20
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 :20
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:19:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 22:19:03] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:03] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-16 22:19:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:19:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:03] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2022-05-16 22:19:03] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:19:03] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2022-05-16 22:19:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2022-05-16 22:19:03] [INFO ] Added : 21 causal constraints over 5 iterations in 58 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[20]
Incomplete Parikh walk after 10200 steps, including 122 resets, run finished after 18 ms. (steps per millisecond=566 ) properties (out of 1) seen :20 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:19:03] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:19:03] [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:19:03] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=3571 ) properties (out of 1) seen :20
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7194 ) properties (out of 1) seen :20
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:03] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:19:03] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:19:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:03] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-16 22:19:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:19:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:03] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:19:03] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2022-05-16 22:19:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 8 ms
[2022-05-16 22:19:03] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:19:03] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[20]
Incomplete Parikh walk after 1200 steps, including 144 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :20 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:19:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:19:04] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:19:04] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2022-05-16 22:19:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:19:04] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0020-UpperBounds-13 in 699 ms.
Starting property specific reduction for JoinFreeModules-PT-0020-UpperBounds-14
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:19:04] [INFO ] Computed 6 place invariants in 0 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :20
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 :20
// Phase 1: matrix 48 rows 30 cols
[2022-05-16 22:19:04] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 22:19:04] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:19:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:04] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-16 22:19:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 22:19:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:04] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2022-05-16 22:19:04] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-16 22:19:04] [INFO ] Added : 30 causal constraints over 6 iterations in 131 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[20]
Incomplete Parikh walk after 5800 steps, including 112 resets, run finished after 13 ms. (steps per millisecond=446 ) properties (out of 1) seen :20 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:19:04] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:19:04] [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:19:04] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 275 ms. (steps per millisecond=3636 ) properties (out of 1) seen :20
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=7246 ) properties (out of 1) seen :20
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:19:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:19:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:04] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 22:19:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 22:19:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-16 22:19:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 22:19:04] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2022-05-16 22:19:04] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2022-05-16 22:19:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2022-05-16 22:19:04] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 22:19:04] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [23] Max seen :[20]
Incomplete Parikh walk after 1200 steps, including 145 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :20 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:04] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:19:04] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 22:19:04] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 18 ms to find 0 implicit places.
[2022-05-16 22:19:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-16 22:19:04] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 22:19:04] [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-0020-UpperBounds-14 in 787 ms.
[2022-05-16 22:19:05] [INFO ] Flatten gal took : 32 ms
[2022-05-16 22:19:05] [INFO ] Applying decomposition
[2022-05-16 22:19:05] [INFO ] Flatten gal took : 5 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/graph16911026424191493657.txt, -o, /tmp/graph16911026424191493657.bin, -w, /tmp/graph16911026424191493657.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/graph16911026424191493657.bin, -l, -1, -v, -w, /tmp/graph16911026424191493657.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-16 22:19:05] [INFO ] Decomposing Gal with order
[2022-05-16 22:19:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 22:19:05] [INFO ] Flatten gal took : 4 ms
[2022-05-16 22:19:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 22:19:05] [INFO ] Time to serialize gal into /tmp/UpperBounds18190815074198483290.gal : 1 ms
[2022-05-16 22:19:05] [INFO ] Time to serialize properties into /tmp/UpperBounds10079693697173378287.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds18190815074198483290.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds10079693697173378287.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/UpperBounds18190815074198483290.gal -t CGAL -reachable-file /tmp/UpperBounds10079693697173378287.prop --nowitness
Loading property file /tmp/UpperBounds10079693697173378287.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,2.42229e+25,0.053673,5028,8,159,22,6484,29,0,55,6993,0
Total reachable state count : 24222885799803360200622080
Verifying 6 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 20
Bounds property JoinFreeModules-PT-0020-UpperBounds-03 :0 <= u4.p73 <= 20
FORMULA JoinFreeModules-PT-0020-UpperBounds-03 20 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-0020-UpperBounds-03,0,0.057249,5028,1,0,37,6484,65,7,90,6993,53
Min sum of variable value : 0
Maximum sum along a path : 21
Bounds property JoinFreeModules-PT-0020-UpperBounds-07 :0 <= u0.p2 <= 21
FORMULA JoinFreeModules-PT-0020-UpperBounds-07 21 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-0020-UpperBounds-07,0,0.063192,5028,1,0,45,6484,82,7,122,6993,66
Min sum of variable value : 0
Maximum sum along a path : 21
Bounds property JoinFreeModules-PT-0020-UpperBounds-09 :0 <= u3.p57 <= 21
FORMULA JoinFreeModules-PT-0020-UpperBounds-09 21 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-0020-UpperBounds-09,0,0.063518,5028,1,0,49,6484,93,7,122,6993,73
Min sum of variable value : 0
Maximum sum along a path : 20
Bounds property JoinFreeModules-PT-0020-UpperBounds-10 :0 <= u2.p53 <= 20
FORMULA JoinFreeModules-PT-0020-UpperBounds-10 20 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-0020-UpperBounds-10,0,0.063825,5028,1,0,54,6484,103,7,122,6993,82
Min sum of variable value : 0
Maximum sum along a path : 20
Bounds property JoinFreeModules-PT-0020-UpperBounds-13 :0 <= u1.p23 <= 20
FORMULA JoinFreeModules-PT-0020-UpperBounds-13 20 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-0020-UpperBounds-13,0,0.064054,5028,1,0,60,6484,112,7,122,6993,93
Min sum of variable value : 0
Maximum sum along a path : 20
Bounds property JoinFreeModules-PT-0020-UpperBounds-14 :0 <= u5.p93 <= 20
FORMULA JoinFreeModules-PT-0020-UpperBounds-14 20 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-0020-UpperBounds-14,0,0.064264,5028,1,0,62,6484,124,7,122,6993,98
BK_STOP 1652739546330
--------------------
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-0020"
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-0020, 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-165271830200064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0020.tgz
mv JoinFreeModules-PT-0020 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 '
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 ;