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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1706.516 46716.00 59894.00 127.40 12 13 13 12 10 10 11 10 13 11 13 11 11 11 11 13 normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 159K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 26 06:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 26 06:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 24 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.3K Mar 24 10:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 57K May 5 16:51 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1620841436120

Running Version 0
[2021-05-12 17:43:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-12 17:43:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 17:43:58] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2021-05-12 17:43:58] [INFO ] Transformed 51 places.
[2021-05-12 17:43:58] [INFO ] Transformed 81 transitions.
[2021-05-12 17:43:58] [INFO ] Parsed PT model containing 51 places and 81 transitions in 81 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 81 rows 50 cols
[2021-05-12 17:43:58] [INFO ] Computed 10 place invariants in 7 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 16) seen :174
FORMULA JoinFreeModules-PT-0010-UpperBounds-08 13 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0010-UpperBounds-02 13 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :92
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :90
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :91
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :92
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :76
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :102
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :83
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :97
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 14) seen :94
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :97
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :95
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 14) seen :103
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 14) seen :105
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 14) seen :103
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:43:58] [INFO ] Computed 10 place invariants in 7 ms
[2021-05-12 17:43:58] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-12 17:43:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:43:58] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2021-05-12 17:43:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:43:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:43:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:43:58] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2021-05-12 17:43:58] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-12 17:43:58] [INFO ] Added : 35 causal constraints over 7 iterations in 102 ms. Result :sat
Minimization took 45 ms.
[2021-05-12 17:43:58] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:43:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:43:58] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-12 17:43:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:43:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:43:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:43:58] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2021-05-12 17:43:58] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 3 ms to minimize.
[2021-05-12 17:43:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2021-05-12 17:43:58] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 17:43:58] [INFO ] Added : 35 causal constraints over 7 iterations in 83 ms. Result :sat
Minimization took 29 ms.
[2021-05-12 17:43:59] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:43:59] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 17:43:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:43:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:43:59] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2021-05-12 17:43:59] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-12 17:43:59] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2021-05-12 17:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 16 ms
[2021-05-12 17:43:59] [INFO ] Added : 35 causal constraints over 7 iterations in 102 ms. Result :sat
Minimization took 55 ms.
[2021-05-12 17:43:59] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:43:59] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-12 17:43:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:43:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:43:59] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2021-05-12 17:43:59] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-12 17:43:59] [INFO ] Added : 30 causal constraints over 7 iterations in 81 ms. Result :sat
Minimization took 36 ms.
[2021-05-12 17:43:59] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:43:59] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-12 17:43:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:43:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:43:59] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2021-05-12 17:43:59] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 17:43:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-12 17:43:59] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 17:43:59] [INFO ] Added : 36 causal constraints over 8 iterations in 121 ms. Result :sat
Minimization took 23 ms.
[2021-05-12 17:43:59] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:43:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:43:59] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 17:43:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:43:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:43:59] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-12 17:43:59] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 2 ms to minimize.
[2021-05-12 17:43:59] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 1 ms to minimize.
[2021-05-12 17:43:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 25 ms
[2021-05-12 17:43:59] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 6 ms.
[2021-05-12 17:44:00] [INFO ] Added : 36 causal constraints over 9 iterations in 87 ms. Result :sat
Minimization took 27 ms.
[2021-05-12 17:44:00] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:00] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-12 17:44:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:00] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-12 17:44:00] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:44:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 14 ms
[2021-05-12 17:44:00] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 17:44:00] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:44:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2021-05-12 17:44:00] [INFO ] Added : 28 causal constraints over 6 iterations in 85 ms. Result :sat
Minimization took 25 ms.
[2021-05-12 17:44:00] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:00] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-12 17:44:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:00] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-12 17:44:00] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:44:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2021-05-12 17:44:00] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 17:44:00] [INFO ] Added : 28 causal constraints over 6 iterations in 48 ms. Result :sat
Minimization took 27 ms.
[2021-05-12 17:44:00] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:00] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-12 17:44:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:00] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-12 17:44:00] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:44:00] [INFO ] Added : 34 causal constraints over 7 iterations in 95 ms. Result :sat
Minimization took 29 ms.
[2021-05-12 17:44:00] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:00] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-12 17:44:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:00] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2021-05-12 17:44:00] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:44:00] [INFO ] Added : 24 causal constraints over 6 iterations in 67 ms. Result :sat
Minimization took 27 ms.
[2021-05-12 17:44:00] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2021-05-12 17:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:00] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-12 17:44:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:01] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-12 17:44:01] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:44:01] [INFO ] Added : 36 causal constraints over 8 iterations in 357 ms. Result :sat
Minimization took 26 ms.
[2021-05-12 17:44:01] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:01] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-12 17:44:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:01] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2021-05-12 17:44:01] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:44:01] [INFO ] Added : 30 causal constraints over 7 iterations in 52 ms. Result :sat
Minimization took 25 ms.
[2021-05-12 17:44:01] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:01] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2021-05-12 17:44:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:01] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2021-05-12 17:44:01] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:44:01] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:44:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 25 ms
[2021-05-12 17:44:01] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:44:01] [INFO ] Added : 36 causal constraints over 9 iterations in 82 ms. Result :sat
Minimization took 27 ms.
[2021-05-12 17:44:01] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:01] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-12 17:44:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:01] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:01] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-12 17:44:01] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 17:44:02] [INFO ] Added : 38 causal constraints over 8 iterations in 56 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13] Max seen :[10, 11, 10, 10, 10, 11, 10, 11, 11, 11, 11, 11, 11, 12]
Incomplete Parikh walk after 16000 steps, including 128 resets, run finished after 75 ms. (steps per millisecond=213 ) properties (out of 14) seen :85 could not realise parikh vector
Incomplete Parikh walk after 9100 steps, including 111 resets, run finished after 34 ms. (steps per millisecond=267 ) properties (out of 14) seen :75 could not realise parikh vector
Incomplete Parikh walk after 7800 steps, including 126 resets, run finished after 25 ms. (steps per millisecond=312 ) properties (out of 14) seen :54 could not realise parikh vector
Incomplete Parikh walk after 11500 steps, including 107 resets, run finished after 36 ms. (steps per millisecond=319 ) properties (out of 14) seen :72 could not realise parikh vector
Incomplete Parikh walk after 5200 steps, including 114 resets, run finished after 18 ms. (steps per millisecond=288 ) properties (out of 14) seen :56 could not realise parikh vector
Incomplete Parikh walk after 7100 steps, including 120 resets, run finished after 23 ms. (steps per millisecond=308 ) properties (out of 14) seen :67 could not realise parikh vector
FORMULA JoinFreeModules-PT-0010-UpperBounds-10 13 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 10000 steps, including 114 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :74 could not realise parikh vector
Incomplete Parikh walk after 5500 steps, including 112 resets, run finished after 19 ms. (steps per millisecond=289 ) properties (out of 13) seen :51 could not realise parikh vector
Incomplete Parikh walk after 9100 steps, including 110 resets, run finished after 32 ms. (steps per millisecond=284 ) properties (out of 13) seen :66 could not realise parikh vector
Incomplete Parikh walk after 8500 steps, including 149 resets, run finished after 28 ms. (steps per millisecond=303 ) properties (out of 13) seen :51 could not realise parikh vector
Incomplete Parikh walk after 6000 steps, including 116 resets, run finished after 20 ms. (steps per millisecond=300 ) properties (out of 13) seen :58 could not realise parikh vector
Incomplete Parikh walk after 29200 steps, including 138 resets, run finished after 85 ms. (steps per millisecond=343 ) properties (out of 13) seen :76 could not realise parikh vector
Incomplete Parikh walk after 8700 steps, including 111 resets, run finished after 26 ms. (steps per millisecond=334 ) properties (out of 13) seen :76 could not realise parikh vector
FORMULA JoinFreeModules-PT-0010-UpperBounds-01 13 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 9300 steps, including 137 resets, run finished after 29 ms. (steps per millisecond=320 ) properties (out of 12) seen :57 could not realise parikh vector
Support contains 11 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 81/81 transitions.
Graph (complete) has 120 edges and 50 vertex of which 45 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 45 transition count 72
Applied a total of 2 rules in 24 ms. Remains 45 /50 variables (removed 5) and now considering 72/81 (removed 9) transitions.
// Phase 1: matrix 72 rows 45 cols
[2021-05-12 17:44:02] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-12 17:44:02] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 45/50 places, 72/81 transitions.
// Phase 1: matrix 72 rows 45 cols
[2021-05-12 17:44:02] [INFO ] Computed 9 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2430 ms. (steps per millisecond=411 ) properties (out of 12) seen :133
FORMULA JoinFreeModules-PT-0010-UpperBounds-15 13 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 792 ms. (steps per millisecond=1262 ) properties (out of 11) seen :113
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 742 ms. (steps per millisecond=1347 ) properties (out of 11) seen :104
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 725 ms. (steps per millisecond=1379 ) properties (out of 11) seen :113
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 737 ms. (steps per millisecond=1356 ) properties (out of 11) seen :117
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 707 ms. (steps per millisecond=1414 ) properties (out of 11) seen :116
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 718 ms. (steps per millisecond=1392 ) properties (out of 11) seen :95
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 726 ms. (steps per millisecond=1377 ) properties (out of 11) seen :116
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 769 ms. (steps per millisecond=1300 ) properties (out of 11) seen :116
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 774 ms. (steps per millisecond=1291 ) properties (out of 11) seen :107
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 766 ms. (steps per millisecond=1305 ) properties (out of 11) seen :115
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 11) seen :115
// Phase 1: matrix 72 rows 45 cols
[2021-05-12 17:44:13] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-12 17:44:13] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:13] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-12 17:44:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:13] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-12 17:44:13] [INFO ] Deduced a trap composed of 3 places in 9 ms of which 0 ms to minimize.
[2021-05-12 17:44:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 12 ms
[2021-05-12 17:44:13] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:13] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-12 17:44:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:13] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2021-05-12 17:44:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2021-05-12 17:44:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2021-05-12 17:44:13] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:13] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-12 17:44:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:13] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-12 17:44:13] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:44:13] [INFO ] Deduced a trap composed of 3 places in 7 ms of which 0 ms to minimize.
[2021-05-12 17:44:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13 ms
[2021-05-12 17:44:13] [INFO ] Added : 17 causal constraints over 6 iterations in 68 ms. Result :sat
Minimization took 24 ms.
[2021-05-12 17:44:13] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:13] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-12 17:44:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:13] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2021-05-12 17:44:13] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 1 ms to minimize.
[2021-05-12 17:44:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2021-05-12 17:44:13] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:44:13] [INFO ] Added : 34 causal constraints over 8 iterations in 96 ms. Result :sat
Minimization took 24 ms.
[2021-05-12 17:44:13] [INFO ] [Real]Absence check using 9 positive place invariants in 14 ms returned sat
[2021-05-12 17:44:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:13] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-12 17:44:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:14] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-12 17:44:14] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 5 ms.
[2021-05-12 17:44:14] [INFO ] Added : 24 causal constraints over 6 iterations in 64 ms. Result :sat
Minimization took 21 ms.
[2021-05-12 17:44:14] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:14] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2021-05-12 17:44:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:14] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-12 17:44:14] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:44:14] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 17:44:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 17 ms
[2021-05-12 17:44:14] [INFO ] Added : 35 causal constraints over 8 iterations in 173 ms. Result :sat
Minimization took 24 ms.
[2021-05-12 17:44:14] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:14] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-12 17:44:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:14] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2021-05-12 17:44:14] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:44:14] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 17:44:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-12 17:44:14] [INFO ] Added : 24 causal constraints over 6 iterations in 74 ms. Result :sat
Minimization took 22 ms.
[2021-05-12 17:44:14] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:14] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-12 17:44:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:14] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2021-05-12 17:44:14] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 1 ms to minimize.
[2021-05-12 17:44:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 10 ms
[2021-05-12 17:44:14] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:44:14] [INFO ] Added : 17 causal constraints over 4 iterations in 52 ms. Result :sat
Minimization took 25 ms.
[2021-05-12 17:44:14] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:14] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-12 17:44:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:14] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2021-05-12 17:44:14] [INFO ] Deduced a trap composed of 3 places in 6 ms of which 0 ms to minimize.
[2021-05-12 17:44:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2021-05-12 17:44:14] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:44:14] [INFO ] Added : 29 causal constraints over 7 iterations in 73 ms. Result :sat
Minimization took 21 ms.
[2021-05-12 17:44:15] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:15] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-12 17:44:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:15] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2021-05-12 17:44:15] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:44:15] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:44:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-12 17:44:15] [INFO ] Added : 25 causal constraints over 6 iterations in 158 ms. Result :sat
Minimization took 21 ms.
[2021-05-12 17:44:15] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:15] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2021-05-12 17:44:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:15] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2021-05-12 17:44:15] [INFO ] Computed and/alt/rep : 54/135/54 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:44:15] [INFO ] Added : 24 causal constraints over 6 iterations in 63 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13] Max seen :[12, 12, 10, 10, 11, 10, 11, 11, 11, 11, 11]
FORMULA JoinFreeModules-PT-0010-UpperBounds-03 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0010-UpperBounds-00 12 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 5200 steps, including 116 resets, run finished after 21 ms. (steps per millisecond=247 ) properties (out of 9) seen :58 could not realise parikh vector
Incomplete Parikh walk after 7400 steps, including 103 resets, run finished after 31 ms. (steps per millisecond=238 ) properties (out of 9) seen :68 could not realise parikh vector
Incomplete Parikh walk after 8000 steps, including 113 resets, run finished after 33 ms. (steps per millisecond=242 ) properties (out of 9) seen :55 could not realise parikh vector
Incomplete Parikh walk after 7200 steps, including 118 resets, run finished after 28 ms. (steps per millisecond=257 ) properties (out of 9) seen :55 could not realise parikh vector
Incomplete Parikh walk after 5900 steps, including 119 resets, run finished after 25 ms. (steps per millisecond=236 ) properties (out of 9) seen :52 could not realise parikh vector
Incomplete Parikh walk after 7300 steps, including 122 resets, run finished after 31 ms. (steps per millisecond=235 ) properties (out of 9) seen :54 could not realise parikh vector
Incomplete Parikh walk after 5200 steps, including 116 resets, run finished after 21 ms. (steps per millisecond=247 ) properties (out of 9) seen :58 could not realise parikh vector
Incomplete Parikh walk after 7500 steps, including 111 resets, run finished after 30 ms. (steps per millisecond=250 ) properties (out of 9) seen :48 could not realise parikh vector
Incomplete Parikh walk after 3900 steps, including 117 resets, run finished after 10 ms. (steps per millisecond=390 ) properties (out of 9) seen :43 could not realise parikh vector
Support contains 8 out of 45 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 45/45 places, 72/72 transitions.
Graph (complete) has 108 edges and 45 vertex of which 35 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 3 ms. Remains 35 /45 variables (removed 10) and now considering 56/72 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 35/45 places, 56/72 transitions.
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:15] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2046 ms. (steps per millisecond=488 ) properties (out of 9) seen :96
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 9) seen :96
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 623 ms. (steps per millisecond=1605 ) properties (out of 9) seen :94
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 654 ms. (steps per millisecond=1529 ) properties (out of 9) seen :95
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 648 ms. (steps per millisecond=1543 ) properties (out of 9) seen :76
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 617 ms. (steps per millisecond=1620 ) properties (out of 9) seen :95
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 594 ms. (steps per millisecond=1683 ) properties (out of 9) seen :94
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 618 ms. (steps per millisecond=1618 ) properties (out of 9) seen :95
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 587 ms. (steps per millisecond=1703 ) properties (out of 9) seen :96
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 600 ms. (steps per millisecond=1666 ) properties (out of 9) seen :95
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:23] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 17:44:23] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:23] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 17:44:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:23] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2021-05-12 17:44:23] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:44:23] [INFO ] Added : 18 causal constraints over 4 iterations in 72 ms. Result :sat
Minimization took 14 ms.
[2021-05-12 17:44:23] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:23] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 17:44:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:23] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-12 17:44:23] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:44:23] [INFO ] Added : 23 causal constraints over 5 iterations in 106 ms. Result :sat
Minimization took 21 ms.
[2021-05-12 17:44:23] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:23] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-12 17:44:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:23] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2021-05-12 17:44:23] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:44:23] [INFO ] Added : 24 causal constraints over 5 iterations in 66 ms. Result :sat
Minimization took 18 ms.
[2021-05-12 17:44:23] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:23] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-12 17:44:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:23] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:23] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-12 17:44:23] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:44:23] [INFO ] Added : 23 causal constraints over 5 iterations in 61 ms. Result :sat
Minimization took 21 ms.
[2021-05-12 17:44:23] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:23] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 17:44:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:24] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2021-05-12 17:44:24] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2021-05-12 17:44:24] [INFO ] Added : 32 causal constraints over 7 iterations in 37 ms. Result :sat
Minimization took 24 ms.
[2021-05-12 17:44:24] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:24] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 17:44:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:24] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-12 17:44:24] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:44:24] [INFO ] Added : 22 causal constraints over 6 iterations in 29 ms. Result :sat
Minimization took 19 ms.
[2021-05-12 17:44:24] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:24] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-12 17:44:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:24] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-12 17:44:24] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:44:24] [INFO ] Added : 22 causal constraints over 5 iterations in 54 ms. Result :sat
Minimization took 20 ms.
[2021-05-12 17:44:24] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:24] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-12 17:44:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:24] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2021-05-12 17:44:24] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:44:24] [INFO ] Added : 21 causal constraints over 5 iterations in 63 ms. Result :sat
Minimization took 28 ms.
[2021-05-12 17:44:24] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:24] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 17:44:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:24] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:24] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2021-05-12 17:44:24] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:44:24] [INFO ] Added : 24 causal constraints over 5 iterations in 54 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [13, 13, 13, 13, 13, 13, 13, 13, 13] Max seen :[10, 10, 11, 10, 11, 11, 11, 11, 11]
Incomplete Parikh walk after 6000 steps, including 103 resets, run finished after 15 ms. (steps per millisecond=400 ) properties (out of 9) seen :70 could not realise parikh vector
Incomplete Parikh walk after 9400 steps, including 130 resets, run finished after 21 ms. (steps per millisecond=447 ) properties (out of 9) seen :62 could not realise parikh vector
Incomplete Parikh walk after 5700 steps, including 112 resets, run finished after 14 ms. (steps per millisecond=407 ) properties (out of 9) seen :59 could not realise parikh vector
Incomplete Parikh walk after 5600 steps, including 110 resets, run finished after 13 ms. (steps per millisecond=430 ) properties (out of 9) seen :55 could not realise parikh vector
Incomplete Parikh walk after 8500 steps, including 109 resets, run finished after 22 ms. (steps per millisecond=386 ) properties (out of 9) seen :69 could not realise parikh vector
Incomplete Parikh walk after 5900 steps, including 118 resets, run finished after 16 ms. (steps per millisecond=368 ) properties (out of 9) seen :52 could not realise parikh vector
Incomplete Parikh walk after 6000 steps, including 103 resets, run finished after 15 ms. (steps per millisecond=400 ) properties (out of 9) seen :69 could not realise parikh vector
Incomplete Parikh walk after 5000 steps, including 118 resets, run finished after 13 ms. (steps per millisecond=384 ) properties (out of 9) seen :48 could not realise parikh vector
Incomplete Parikh walk after 32400 steps, including 128 resets, run finished after 71 ms. (steps per millisecond=456 ) properties (out of 9) seen :50 could not realise parikh vector
Support contains 8 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 56/56 transitions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:24] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 17:44:24] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:24] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 17:44:24] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2021-05-12 17:44:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:24] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 17:44:24] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 35/35 places, 56/56 transitions.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-04
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:24] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :10
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:25] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 17:44:25] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:25] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 17:44:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:25] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2021-05-12 17:44:25] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:44:25] [INFO ] Added : 18 causal constraints over 4 iterations in 83 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Incomplete Parikh walk after 32400 steps, including 128 resets, run finished after 69 ms. (steps per millisecond=469 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:25] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:25] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:25] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 990 ms. (steps per millisecond=1010 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 409 ms. (steps per millisecond=2444 ) properties (out of 1) seen :10
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:26] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:26] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:44:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:26] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2021-05-12 17:44:26] [INFO ] Deduced a trap composed of 3 places in 5 ms of which 0 ms to minimize.
[2021-05-12 17:44:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6 ms
[2021-05-12 17:44:26] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:44:26] [INFO ] Added : 6 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Incomplete Parikh walk after 1200 steps, including 147 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:26] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:26] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:26] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:26] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-12 17:44:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:26] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:26] [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-0010-UpperBounds-04 in 1780 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-05
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:26] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :10
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:26] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 17:44:26] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:26] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-12 17:44:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:26] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-12 17:44:26] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:44:26] [INFO ] Added : 23 causal constraints over 5 iterations in 106 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Incomplete Parikh walk after 5000 steps, including 119 resets, run finished after 13 ms. (steps per millisecond=384 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:27] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:44:27] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:27] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1016 ms. (steps per millisecond=984 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties (out of 1) seen :10
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:28] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:44:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:28] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:28] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:44:28] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 0 ms to minimize.
[2021-05-12 17:44:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12 ms
[2021-05-12 17:44:28] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 17:44:28] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Incomplete Parikh walk after 1200 steps, including 145 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:28] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:28] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-05-12 17:44:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:28] [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-0010-UpperBounds-05 in 1764 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-06
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:28] [INFO ] Computed 7 place invariants in 4 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :11
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:28] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 17:44:28] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:28] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 17:44:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:28] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2021-05-12 17:44:28] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:44:28] [INFO ] Added : 24 causal constraints over 5 iterations in 54 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Incomplete Parikh walk after 6000 steps, including 103 resets, run finished after 15 ms. (steps per millisecond=400 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:28] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:44:28] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:28] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 994 ms. (steps per millisecond=1006 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=1776 ) properties (out of 1) seen :11
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:30] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:30] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2021-05-12 17:44:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:44:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:30] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:44:30] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 17:44:30] [INFO ] Added : 6 causal constraints over 2 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Incomplete Parikh walk after 2100 steps, including 99 resets, run finished after 4 ms. (steps per millisecond=525 ) properties (out of 1) seen :11 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:30] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:30] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:30] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2021-05-12 17:44:30] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:30] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:44:30] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-06 in 2023 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-07
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:30] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :10
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:30] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 17:44:30] [INFO ] [Real]Absence check using 7 positive place invariants in 41 ms returned sat
[2021-05-12 17:44:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:30] [INFO ] [Real]Absence check using state equation in 220 ms returned sat
[2021-05-12 17:44:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:30] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-12 17:44:30] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:44:31] [INFO ] Added : 23 causal constraints over 5 iterations in 61 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Incomplete Parikh walk after 5900 steps, including 118 resets, run finished after 15 ms. (steps per millisecond=393 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:31] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:31] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:31] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 990 ms. (steps per millisecond=1010 ) properties (out of 1) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 388 ms. (steps per millisecond=2577 ) properties (out of 1) seen :10
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:32] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:44:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:44:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:32] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:44:32] [INFO ] Deduced a trap composed of 3 places in 8 ms of which 1 ms to minimize.
[2021-05-12 17:44:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 11 ms
[2021-05-12 17:44:32] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 17:44:32] [INFO ] Added : 6 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[10]
Incomplete Parikh walk after 1200 steps, including 146 resets, run finished after 2 ms. (steps per millisecond=600 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:32] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:32] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:44:32] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-12 17:44:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:32] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:44:32] [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-0010-UpperBounds-07 in 1996 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-09
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:32] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :11
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:32] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 17:44:32] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:32] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-12 17:44:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 41 ms returned sat
[2021-05-12 17:44:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:32] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-12 17:44:32] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:44:32] [INFO ] Added : 32 causal constraints over 7 iterations in 48 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Incomplete Parikh walk after 8500 steps, including 109 resets, run finished after 21 ms. (steps per millisecond=404 ) properties (out of 1) seen :11 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:32] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:44:32] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:32] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 1006 ms. (steps per millisecond=994 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 463 ms. (steps per millisecond=2159 ) properties (out of 1) seen :11
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:34] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:44:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:34] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:44:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:34] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:44:34] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2021-05-12 17:44:34] [INFO ] Added : 6 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Incomplete Parikh walk after 2100 steps, including 99 resets, run finished after 4 ms. (steps per millisecond=525 ) properties (out of 1) seen :11 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:34] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:34] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:34] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:34] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-12 17:44:34] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:34] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:34] [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-0010-UpperBounds-09 in 1912 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-11
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:34] [INFO ] Computed 7 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :11
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:34] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-12 17:44:34] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:34] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 17:44:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:34] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:34] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2021-05-12 17:44:34] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:44:34] [INFO ] Added : 22 causal constraints over 6 iterations in 29 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Incomplete Parikh walk after 5600 steps, including 111 resets, run finished after 14 ms. (steps per millisecond=400 ) properties (out of 1) seen :11 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:34] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:44:34] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:34] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 993 ms. (steps per millisecond=1007 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 469 ms. (steps per millisecond=2132 ) properties (out of 1) seen :11
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:36] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:44:36] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:44:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:36] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:44:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:44:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:36] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:44:36] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:44:36] [INFO ] Added : 6 causal constraints over 2 iterations in 34 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Incomplete Parikh walk after 2100 steps, including 99 resets, run finished after 4 ms. (steps per millisecond=525 ) properties (out of 1) seen :11 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:36] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:36] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:44:36] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-12 17:44:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:36] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:44:36] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-11 in 1801 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-12
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:36] [INFO ] Computed 7 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :11
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:36] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 17:44:36] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:36] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2021-05-12 17:44:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:36] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:36] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-12 17:44:36] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:44:36] [INFO ] Added : 22 causal constraints over 5 iterations in 54 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Incomplete Parikh walk after 5700 steps, including 113 resets, run finished after 13 ms. (steps per millisecond=438 ) properties (out of 1) seen :10 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:36] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:36] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:36] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 995 ms. (steps per millisecond=1005 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 469 ms. (steps per millisecond=2132 ) properties (out of 1) seen :11
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:37] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:37] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:44:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:37] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2021-05-12 17:44:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:44:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:37] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:44:37] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 8 ms.
[2021-05-12 17:44:37] [INFO ] Added : 6 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Incomplete Parikh walk after 2100 steps, including 99 resets, run finished after 4 ms. (steps per millisecond=525 ) properties (out of 1) seen :11 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:37] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:38] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:38] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:38] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-12 17:44:38] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:38] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:44:38] [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-0010-UpperBounds-12 in 1790 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-13
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:38] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :11
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:38] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 17:44:38] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-12 17:44:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:38] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-12 17:44:38] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-12 17:44:38] [INFO ] Added : 21 causal constraints over 5 iterations in 71 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Incomplete Parikh walk after 9400 steps, including 130 resets, run finished after 21 ms. (steps per millisecond=447 ) properties (out of 1) seen :9 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:38] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:38] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:38] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 1002 ms. (steps per millisecond=998 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 472 ms. (steps per millisecond=2118 ) properties (out of 1) seen :11
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:39] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:44:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2021-05-12 17:44:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:39] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2021-05-12 17:44:39] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:44:39] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Incomplete Parikh walk after 2100 steps, including 99 resets, run finished after 4 ms. (steps per millisecond=525 ) properties (out of 1) seen :11 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:39] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:39] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-12 17:44:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:39] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0010-UpperBounds-13 in 1812 ms.
Starting property specific reduction for JoinFreeModules-PT-0010-UpperBounds-14
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:39] [INFO ] Computed 7 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :11
// Phase 1: matrix 56 rows 35 cols
[2021-05-12 17:44:39] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-12 17:44:39] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:39] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2021-05-12 17:44:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-12 17:44:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:39] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2021-05-12 17:44:39] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-12 17:44:40] [INFO ] Added : 24 causal constraints over 5 iterations in 53 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Incomplete Parikh walk after 6000 steps, including 103 resets, run finished after 15 ms. (steps per millisecond=400 ) properties (out of 1) seen :11 could not realise parikh vector
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:40] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:44:40] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/35 places, 8/56 transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:40] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 997 ms. (steps per millisecond=1003 ) properties (out of 1) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=2155 ) properties (out of 1) seen :11
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:41] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:44:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:41] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:44:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-12 17:44:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-12 17:44:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-12 17:44:41] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2021-05-12 17:44:41] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-12 17:44:41] [INFO ] Added : 6 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [13] Max seen :[11]
Incomplete Parikh walk after 2100 steps, including 99 resets, run finished after 4 ms. (steps per millisecond=525 ) properties (out of 1) seen :11 could not realise parikh vector
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:41] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:41] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-12 17:44:41] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-12 17:44:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2021-05-12 17:44:41] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-12 17:44:41] [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-0010-UpperBounds-14 in 1767 ms.
[2021-05-12 17:44:41] [INFO ] Flatten gal took : 27 ms
[2021-05-12 17:44:41] [INFO ] Applying decomposition
[2021-05-12 17:44:41] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7885779953911098614.txt, -o, /tmp/graph7885779953911098614.bin, -w, /tmp/graph7885779953911098614.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/graph7885779953911098614.bin, -l, -1, -v, -w, /tmp/graph7885779953911098614.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-12 17:44:41] [INFO ] Decomposing Gal with order
[2021-05-12 17:44:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-12 17:44:41] [INFO ] Flatten gal took : 6 ms
[2021-05-12 17:44:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-12 17:44:41] [INFO ] Time to serialize gal into /tmp/UpperBounds9003431931343727985.gal : 2 ms
[2021-05-12 17:44:41] [INFO ] Time to serialize properties into /tmp/UpperBounds17774852024241094339.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds9003431931343727985.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds17774852024241094339.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/UpperBounds9003431931343727985.gal -t CGAL -reachable-file /tmp/UpperBounds17774852024241094339.prop --nowitness
Loading property file /tmp/UpperBounds17774852024241094339.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.7419e+23,0.024545,4336,9,89,25,2679,34,0,59,2738,0
Total reachable state count : 174190314299603689996288

Verifying 9 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property JoinFreeModules-PT-0010-UpperBounds-04 :0 <= u1.p8 <= 10
FORMULA JoinFreeModules-PT-0010-UpperBounds-04 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0010-UpperBounds-04,0,0.025096,4336,1,0,46,2679,76,8,84,2738,65
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property JoinFreeModules-PT-0010-UpperBounds-05 :0 <= u6.p48 <= 10
FORMULA JoinFreeModules-PT-0010-UpperBounds-05 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0010-UpperBounds-05,0,0.025191,4336,1,0,49,2679,95,8,84,2738,79
Min sum of variable value : 0
Maximum sum along a path : 11
Bounds property JoinFreeModules-PT-0010-UpperBounds-06 :0 <= u4.p32 <= 11
FORMULA JoinFreeModules-PT-0010-UpperBounds-06 11 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0010-UpperBounds-06,0,0.026134,4336,1,0,54,2679,109,8,106,2738,87
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property JoinFreeModules-PT-0010-UpperBounds-07 :0 <= u4.p33 <= 10
FORMULA JoinFreeModules-PT-0010-UpperBounds-07 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0010-UpperBounds-07,0,0.026229,4336,1,0,58,2679,122,8,106,2738,94
Min sum of variable value : 0
Maximum sum along a path : 11
Bounds property JoinFreeModules-PT-0010-UpperBounds-09 :0 <= u0.p2 <= 11
FORMULA JoinFreeModules-PT-0010-UpperBounds-09 11 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0010-UpperBounds-09,0,0.026334,4336,1,0,65,2679,132,8,106,2738,107
Min sum of variable value : 0
Maximum sum along a path : 11
Bounds property JoinFreeModules-PT-0010-UpperBounds-11 :0 <= u3.p22 <= 11
FORMULA JoinFreeModules-PT-0010-UpperBounds-11 11 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0010-UpperBounds-11,0,0.026413,4336,1,0,70,2679,144,8,106,2738,116
Min sum of variable value : 0
Maximum sum along a path : 11
Bounds property JoinFreeModules-PT-0010-UpperBounds-12 :0 <= u5.p42 <= 11
FORMULA JoinFreeModules-PT-0010-UpperBounds-12 11 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0010-UpperBounds-12,0,0.026487,4336,1,0,73,2679,158,8,106,2738,121
Min sum of variable value : 0
Maximum sum along a path : 11
Bounds property JoinFreeModules-PT-0010-UpperBounds-13 :0 <= u2.p17 <= 11
FORMULA JoinFreeModules-PT-0010-UpperBounds-13 11 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0010-UpperBounds-13,0,0.026565,4336,1,0,79,2679,169,8,106,2738,132
Min sum of variable value : 0
Maximum sum along a path : 11
Bounds property JoinFreeModules-PT-0010-UpperBounds-14 :0 <= u4.p32 <= 11
FORMULA JoinFreeModules-PT-0010-UpperBounds-14 11 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0010-UpperBounds-14,0,0.026624,4336,1,0,79,2679,169,8,106,2738,132

BK_STOP 1620841482836

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0010.tgz
mv JoinFreeModules-PT-0010 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;