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.r140-tall-162089128200611.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 Peterson-PT-3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089128200611
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 132K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 555K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 104K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 464K 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 16K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Mar 27 06:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 27 06:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Mar 25 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 25 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.5K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 2 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 253K 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 Peterson-PT-3-UpperBounds-00
FORMULA_NAME Peterson-PT-3-UpperBounds-01
FORMULA_NAME Peterson-PT-3-UpperBounds-02
FORMULA_NAME Peterson-PT-3-UpperBounds-03
FORMULA_NAME Peterson-PT-3-UpperBounds-04
FORMULA_NAME Peterson-PT-3-UpperBounds-05
FORMULA_NAME Peterson-PT-3-UpperBounds-06
FORMULA_NAME Peterson-PT-3-UpperBounds-07
FORMULA_NAME Peterson-PT-3-UpperBounds-08
FORMULA_NAME Peterson-PT-3-UpperBounds-09
FORMULA_NAME Peterson-PT-3-UpperBounds-10
FORMULA_NAME Peterson-PT-3-UpperBounds-11
FORMULA_NAME Peterson-PT-3-UpperBounds-12
FORMULA_NAME Peterson-PT-3-UpperBounds-13
FORMULA_NAME Peterson-PT-3-UpperBounds-14
FORMULA_NAME Peterson-PT-3-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1621019474176

Running Version 0
[2021-05-14 19:11:31] [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-14 19:11:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 19:11:31] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2021-05-14 19:11:31] [INFO ] Transformed 244 places.
[2021-05-14 19:11:31] [INFO ] Transformed 332 transitions.
[2021-05-14 19:11:31] [INFO ] Found NUPN structural information;
[2021-05-14 19:11:31] [INFO ] Parsed PT model containing 244 places and 332 transitions in 131 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
FORMULA Peterson-PT-3-UpperBounds-00 3 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-3-UpperBounds-05 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 308 out of 332 initially.
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 19:11:31] [INFO ] Computed 15 place invariants in 16 ms
FORMULA Peterson-PT-3-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 12) seen :18
FORMULA Peterson-PT-3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :16
[2021-05-14 19:11:32] [INFO ] Flow matrix only has 308 transitions (discarded 24 similar events)
// Phase 1: matrix 308 rows 244 cols
[2021-05-14 19:11:32] [INFO ] Computed 15 place invariants in 5 ms
[2021-05-14 19:11:32] [INFO ] [Real]Absence check using 11 positive place invariants in 18 ms returned unsat
[2021-05-14 19:11:32] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
[2021-05-14 19:11:32] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2021-05-14 19:11:32] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned unsat
[2021-05-14 19:11:32] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:11:32] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 19:11:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:32] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2021-05-14 19:11:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:11:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:11:32] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:11:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:32] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2021-05-14 19:11:32] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:11:32] [INFO ] [Nat]Added 66 Read/Feed constraints in 9 ms returned sat
[2021-05-14 19:11:32] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 3 ms to minimize.
[2021-05-14 19:11:32] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2021-05-14 19:11:32] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2021-05-14 19:11:32] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2021-05-14 19:11:32] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
[2021-05-14 19:11:33] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2021-05-14 19:11:33] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2021-05-14 19:11:33] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2021-05-14 19:11:33] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2021-05-14 19:11:33] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2021-05-14 19:11:33] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2021-05-14 19:11:33] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2021-05-14 19:11:33] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 0 ms to minimize.
[2021-05-14 19:11:33] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
[2021-05-14 19:11:33] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2021-05-14 19:11:33] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2021-05-14 19:11:33] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2021-05-14 19:11:33] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2021-05-14 19:11:33] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 0 ms to minimize.
[2021-05-14 19:11:33] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1177 ms
[2021-05-14 19:11:33] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 20 ms.
[2021-05-14 19:11:34] [INFO ] Deduced a trap composed of 34 places in 89 ms of which 1 ms to minimize.
[2021-05-14 19:11:35] [INFO ] Deduced a trap composed of 53 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:11:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 193 ms
[2021-05-14 19:11:35] [INFO ] Added : 280 causal constraints over 56 iterations in 1270 ms. Result :sat
Minimization took 78 ms.
[2021-05-14 19:11:35] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:11:35] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 19:11:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:35] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2021-05-14 19:11:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:11:35] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:11:35] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 2 ms returned sat
[2021-05-14 19:11:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:35] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2021-05-14 19:11:35] [INFO ] [Nat]Added 66 Read/Feed constraints in 13 ms returned sat
[2021-05-14 19:11:35] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2021-05-14 19:11:35] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2021-05-14 19:11:35] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2021-05-14 19:11:35] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:11:35] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2021-05-14 19:11:35] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 0 ms to minimize.
[2021-05-14 19:11:35] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2021-05-14 19:11:35] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 0 ms to minimize.
[2021-05-14 19:11:35] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2021-05-14 19:11:36] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2021-05-14 19:11:36] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2021-05-14 19:11:36] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2021-05-14 19:11:36] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2021-05-14 19:11:36] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2021-05-14 19:11:36] [INFO ] Deduced a trap composed of 79 places in 40 ms of which 0 ms to minimize.
[2021-05-14 19:11:36] [INFO ] Deduced a trap composed of 49 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:11:36] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 894 ms
[2021-05-14 19:11:36] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 21 ms.
[2021-05-14 19:11:37] [INFO ] Deduced a trap composed of 38 places in 30 ms of which 0 ms to minimize.
[2021-05-14 19:11:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2021-05-14 19:11:37] [INFO ] Added : 262 causal constraints over 53 iterations in 1035 ms. Result :sat
Minimization took 81 ms.
[2021-05-14 19:11:37] [INFO ] [Real]Absence check using 11 positive place invariants in 12 ms returned sat
[2021-05-14 19:11:37] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:11:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:37] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-14 19:11:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:11:37] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:11:37] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:11:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:37] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2021-05-14 19:11:37] [INFO ] [Nat]Added 66 Read/Feed constraints in 10 ms returned sat
[2021-05-14 19:11:37] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2021-05-14 19:11:37] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2021-05-14 19:11:37] [INFO ] Deduced a trap composed of 56 places in 57 ms of which 0 ms to minimize.
[2021-05-14 19:11:38] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2021-05-14 19:11:38] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2021-05-14 19:11:38] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2021-05-14 19:11:38] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 0 ms to minimize.
[2021-05-14 19:11:38] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 8 ms to minimize.
[2021-05-14 19:11:38] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2021-05-14 19:11:38] [INFO ] Deduced a trap composed of 50 places in 39 ms of which 0 ms to minimize.
[2021-05-14 19:11:38] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 1 ms to minimize.
[2021-05-14 19:11:38] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 696 ms
[2021-05-14 19:11:38] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 19 ms.
[2021-05-14 19:11:39] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2021-05-14 19:11:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2021-05-14 19:11:39] [INFO ] Added : 253 causal constraints over 51 iterations in 992 ms. Result :sat
Minimization took 74 ms.
[2021-05-14 19:11:39] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-14 19:11:39] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-14 19:11:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:39] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2021-05-14 19:11:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:11:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:11:39] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:11:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:39] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2021-05-14 19:11:39] [INFO ] [Nat]Added 66 Read/Feed constraints in 9 ms returned sat
[2021-05-14 19:11:39] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2021-05-14 19:11:39] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2021-05-14 19:11:39] [INFO ] Deduced a trap composed of 83 places in 63 ms of which 0 ms to minimize.
[2021-05-14 19:11:40] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2021-05-14 19:11:40] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2021-05-14 19:11:40] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 0 ms to minimize.
[2021-05-14 19:11:40] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 8 ms to minimize.
[2021-05-14 19:11:40] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:11:40] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2021-05-14 19:11:40] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 0 ms to minimize.
[2021-05-14 19:11:40] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 0 ms to minimize.
[2021-05-14 19:11:40] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 807 ms
[2021-05-14 19:11:40] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 20 ms.
[2021-05-14 19:11:41] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2021-05-14 19:11:41] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2021-05-14 19:11:41] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 0 ms to minimize.
[2021-05-14 19:11:41] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2021-05-14 19:11:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 263 ms
[2021-05-14 19:11:41] [INFO ] Added : 252 causal constraints over 51 iterations in 1158 ms. Result :sat
Minimization took 85 ms.
[2021-05-14 19:11:41] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-14 19:11:41] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-14 19:11:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:41] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2021-05-14 19:11:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:11:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:11:42] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:11:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:42] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2021-05-14 19:11:42] [INFO ] [Nat]Added 66 Read/Feed constraints in 9 ms returned sat
[2021-05-14 19:11:42] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2021-05-14 19:11:42] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
[2021-05-14 19:11:42] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2021-05-14 19:11:42] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2021-05-14 19:11:42] [INFO ] Deduced a trap composed of 42 places in 34 ms of which 0 ms to minimize.
[2021-05-14 19:11:42] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2021-05-14 19:11:42] [INFO ] Deduced a trap composed of 49 places in 34 ms of which 0 ms to minimize.
[2021-05-14 19:11:42] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2021-05-14 19:11:42] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:11:42] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2021-05-14 19:11:42] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2021-05-14 19:11:42] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 534 ms
[2021-05-14 19:11:42] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 25 ms.
[2021-05-14 19:11:43] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2021-05-14 19:11:43] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2021-05-14 19:11:43] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 0 ms to minimize.
[2021-05-14 19:11:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 233 ms
[2021-05-14 19:11:43] [INFO ] Added : 274 causal constraints over 55 iterations in 1176 ms. Result :sat
Minimization took 90 ms.
[2021-05-14 19:11:43] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2021-05-14 19:11:43] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:11:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:44] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2021-05-14 19:11:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:11:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2021-05-14 19:11:44] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:11:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:44] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2021-05-14 19:11:44] [INFO ] [Nat]Added 66 Read/Feed constraints in 9 ms returned sat
[2021-05-14 19:11:44] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2021-05-14 19:11:44] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2021-05-14 19:11:44] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 0 ms to minimize.
[2021-05-14 19:11:44] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2021-05-14 19:11:44] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2021-05-14 19:11:44] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2021-05-14 19:11:44] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 0 ms to minimize.
[2021-05-14 19:11:44] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2021-05-14 19:11:44] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2021-05-14 19:11:44] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:11:44] [INFO ] Deduced a trap composed of 57 places in 47 ms of which 1 ms to minimize.
[2021-05-14 19:11:44] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 664 ms
[2021-05-14 19:11:44] [INFO ] Computed and/alt/rep : 283/461/283 causal constraints (skipped 21 transitions) in 17 ms.
[2021-05-14 19:11:45] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
[2021-05-14 19:11:45] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2021-05-14 19:11:45] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2021-05-14 19:11:45] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2021-05-14 19:11:46] [INFO ] Deduced a trap composed of 45 places in 38 ms of which 0 ms to minimize.
[2021-05-14 19:11:46] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 0 ms to minimize.
[2021-05-14 19:11:46] [INFO ] Deduced a trap composed of 58 places in 38 ms of which 1 ms to minimize.
[2021-05-14 19:11:46] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 0 ms to minimize.
[2021-05-14 19:11:46] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2021-05-14 19:11:46] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 688 ms
[2021-05-14 19:11:46] [INFO ] Added : 248 causal constraints over 50 iterations in 1587 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : [4, 4, 4, 4, 1, 1, 1, 1, 1, 1] Max seen :[4, 4, 4, 4, 0, 0, 0, 0, 0, 0]
FORMULA Peterson-PT-3-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-3-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 27800 steps, including 794 resets, run finished after 108 ms. (steps per millisecond=257 ) properties (out of 6) seen :2 could not realise parikh vector
FORMULA Peterson-PT-3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-3-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 53100 steps, including 989 resets, run finished after 175 ms. (steps per millisecond=303 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 73700 steps, including 902 resets, run finished after 196 ms. (steps per millisecond=376 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11500 steps, including 354 resets, run finished after 26 ms. (steps per millisecond=442 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 46400 steps, including 744 resets, run finished after 106 ms. (steps per millisecond=437 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 37700 steps, including 969 resets, run finished after 88 ms. (steps per millisecond=428 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 332/332 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 244 transition count 241
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 1 with 91 rules applied. Total rules applied 182 place count 153 transition count 241
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 182 place count 153 transition count 193
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 2 with 96 rules applied. Total rules applied 278 place count 105 transition count 193
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 298 place count 95 transition count 183
Applied a total of 298 rules in 39 ms. Remains 95 /244 variables (removed 149) and now considering 183/332 (removed 149) transitions.
Finished structural reductions, in 1 iterations. Remains : 95/244 places, 183/332 transitions.
Normalized transition count is 159 out of 183 initially.
// Phase 1: matrix 159 rows 95 cols
[2021-05-14 19:11:47] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1996 ms. (steps per millisecond=501 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 542 ms. (steps per millisecond=1845 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 538 ms. (steps per millisecond=1858 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 544 ms. (steps per millisecond=1838 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 550 ms. (steps per millisecond=1818 ) properties (out of 4) seen :0
[2021-05-14 19:11:51] [INFO ] Flow matrix only has 159 transitions (discarded 24 similar events)
// Phase 1: matrix 159 rows 95 cols
[2021-05-14 19:11:51] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-14 19:11:51] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:11:51] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-14 19:11:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:51] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2021-05-14 19:11:51] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:11:51] [INFO ] [Real]Added 66 Read/Feed constraints in 6 ms returned sat
[2021-05-14 19:11:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:11:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:11:51] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:11:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:51] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-14 19:11:51] [INFO ] [Nat]Added 66 Read/Feed constraints in 6 ms returned sat
[2021-05-14 19:11:51] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2021-05-14 19:11:51] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2021-05-14 19:11:51] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2021-05-14 19:11:51] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2021-05-14 19:11:51] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 0 ms to minimize.
[2021-05-14 19:11:51] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2021-05-14 19:11:51] [INFO ] Deduced a trap composed of 8 places in 16 ms of which 0 ms to minimize.
[2021-05-14 19:11:51] [INFO ] Deduced a trap composed of 9 places in 14 ms of which 0 ms to minimize.
[2021-05-14 19:11:51] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 200 ms
[2021-05-14 19:11:51] [INFO ] Computed and/alt/rep : 134/336/134 causal constraints (skipped 21 transitions) in 9 ms.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 0 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 0 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 420 ms
[2021-05-14 19:11:52] [INFO ] Added : 127 causal constraints over 26 iterations in 681 ms. Result :sat
Minimization took 41 ms.
[2021-05-14 19:11:52] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:11:52] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:11:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:52] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-14 19:11:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:11:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:11:52] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:11:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:52] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-14 19:11:52] [INFO ] [Nat]Added 66 Read/Feed constraints in 6 ms returned sat
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2021-05-14 19:11:52] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 227 ms
[2021-05-14 19:11:52] [INFO ] Computed and/alt/rep : 134/336/134 causal constraints (skipped 21 transitions) in 8 ms.
[2021-05-14 19:11:52] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2021-05-14 19:11:53] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2021-05-14 19:11:53] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2021-05-14 19:11:53] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
[2021-05-14 19:11:53] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2021-05-14 19:11:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 168 ms
[2021-05-14 19:11:53] [INFO ] Added : 89 causal constraints over 18 iterations in 326 ms. Result :sat
Minimization took 33 ms.
[2021-05-14 19:11:53] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:11:53] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-14 19:11:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:53] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-14 19:11:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:11:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:11:53] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-14 19:11:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:53] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-14 19:11:53] [INFO ] [Nat]Added 66 Read/Feed constraints in 7 ms returned sat
[2021-05-14 19:11:53] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2021-05-14 19:11:53] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2021-05-14 19:11:53] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2021-05-14 19:11:53] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2021-05-14 19:11:53] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2021-05-14 19:11:53] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2021-05-14 19:11:53] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2021-05-14 19:11:53] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 1 ms to minimize.
[2021-05-14 19:11:53] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 214 ms
[2021-05-14 19:11:53] [INFO ] Computed and/alt/rep : 134/336/134 causal constraints (skipped 21 transitions) in 9 ms.
[2021-05-14 19:11:53] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2021-05-14 19:11:53] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2021-05-14 19:11:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 76 ms
[2021-05-14 19:11:53] [INFO ] Added : 88 causal constraints over 19 iterations in 257 ms. Result :sat
Minimization took 34 ms.
[2021-05-14 19:11:53] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:11:53] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:11:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:53] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-14 19:11:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:11:53] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:11:53] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-14 19:11:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:53] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-14 19:11:53] [INFO ] [Nat]Added 66 Read/Feed constraints in 6 ms returned sat
[2021-05-14 19:11:53] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2021-05-14 19:11:53] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2021-05-14 19:11:54] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2021-05-14 19:11:54] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
[2021-05-14 19:11:54] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2021-05-14 19:11:54] [INFO ] Deduced a trap composed of 20 places in 17 ms of which 0 ms to minimize.
[2021-05-14 19:11:54] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2021-05-14 19:11:54] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2021-05-14 19:11:54] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2021-05-14 19:11:54] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 243 ms
[2021-05-14 19:11:54] [INFO ] Computed and/alt/rep : 134/336/134 causal constraints (skipped 21 transitions) in 9 ms.
[2021-05-14 19:11:54] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:11:54] [INFO ] Deduced a trap composed of 26 places in 27 ms of which 0 ms to minimize.
[2021-05-14 19:11:54] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2021-05-14 19:11:54] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2021-05-14 19:11:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 146 ms
[2021-05-14 19:11:54] [INFO ] Added : 121 causal constraints over 25 iterations in 381 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 16800 steps, including 795 resets, run finished after 40 ms. (steps per millisecond=420 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 23800 steps, including 845 resets, run finished after 53 ms. (steps per millisecond=449 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 29400 steps, including 981 resets, run finished after 61 ms. (steps per millisecond=481 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA Peterson-PT-3-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 14900 steps, including 790 resets, run finished after 31 ms. (steps per millisecond=480 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 95 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 95/95 places, 183/183 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 94 transition count 182
Applied a total of 2 rules in 15 ms. Remains 94 /95 variables (removed 1) and now considering 182/183 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 94/95 places, 182/183 transitions.
Normalized transition count is 158 out of 182 initially.
// Phase 1: matrix 158 rows 94 cols
[2021-05-14 19:11:54] [INFO ] Computed 15 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1884 ms. (steps per millisecond=530 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 593 ms. (steps per millisecond=1686 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 552 ms. (steps per millisecond=1811 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 557 ms. (steps per millisecond=1795 ) properties (out of 3) seen :0
[2021-05-14 19:11:58] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
// Phase 1: matrix 158 rows 94 cols
[2021-05-14 19:11:58] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 19:11:58] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-14 19:11:58] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-14 19:11:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:58] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-14 19:11:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:11:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:11:58] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:11:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:58] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-14 19:11:58] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:11:58] [INFO ] [Nat]Added 66 Read/Feed constraints in 5 ms returned sat
[2021-05-14 19:11:58] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2021-05-14 19:11:58] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2021-05-14 19:11:58] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2021-05-14 19:11:58] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:11:58] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 0 ms to minimize.
[2021-05-14 19:11:58] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2021-05-14 19:11:58] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:11:58] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2021-05-14 19:11:58] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2021-05-14 19:11:58] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2021-05-14 19:11:58] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2021-05-14 19:11:58] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
[2021-05-14 19:11:59] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2021-05-14 19:11:59] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2021-05-14 19:11:59] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 565 ms
[2021-05-14 19:11:59] [INFO ] Computed and/alt/rep : 133/335/133 causal constraints (skipped 21 transitions) in 9 ms.
[2021-05-14 19:11:59] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2021-05-14 19:11:59] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2021-05-14 19:11:59] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2021-05-14 19:11:59] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2021-05-14 19:11:59] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2021-05-14 19:11:59] [INFO ] Deduced a trap composed of 17 places in 15 ms of which 0 ms to minimize.
[2021-05-14 19:11:59] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2021-05-14 19:11:59] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2021-05-14 19:11:59] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2021-05-14 19:11:59] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2021-05-14 19:11:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 400 ms
[2021-05-14 19:11:59] [INFO ] Added : 126 causal constraints over 26 iterations in 654 ms. Result :sat
Minimization took 44 ms.
[2021-05-14 19:11:59] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2021-05-14 19:11:59] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:11:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:59] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-14 19:11:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:11:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:11:59] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:11:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:11:59] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2021-05-14 19:11:59] [INFO ] [Nat]Added 66 Read/Feed constraints in 6 ms returned sat
[2021-05-14 19:11:59] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 0 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 0 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 14 places in 16 ms of which 0 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 294 ms
[2021-05-14 19:12:00] [INFO ] Computed and/alt/rep : 133/335/133 causal constraints (skipped 21 transitions) in 10 ms.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 9 places in 16 ms of which 0 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 14 places in 14 ms of which 0 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 198 ms
[2021-05-14 19:12:00] [INFO ] Added : 90 causal constraints over 18 iterations in 372 ms. Result :sat
Minimization took 36 ms.
[2021-05-14 19:12:00] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-14 19:12:00] [INFO ] [Real]Absence check using 11 positive and 4 generalized place invariants in 0 ms returned sat
[2021-05-14 19:12:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:00] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-14 19:12:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:12:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:12:00] [INFO ] [Nat]Absence check using 11 positive and 4 generalized place invariants in 1 ms returned sat
[2021-05-14 19:12:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:00] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-14 19:12:00] [INFO ] [Nat]Added 66 Read/Feed constraints in 6 ms returned sat
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 21 places in 17 ms of which 0 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 9 places in 15 ms of which 0 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2021-05-14 19:12:00] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2021-05-14 19:12:01] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2021-05-14 19:12:01] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2021-05-14 19:12:01] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2021-05-14 19:12:01] [INFO ] Deduced a trap composed of 14 places in 13 ms of which 0 ms to minimize.
[2021-05-14 19:12:01] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 358 ms
[2021-05-14 19:12:01] [INFO ] Computed and/alt/rep : 133/335/133 causal constraints (skipped 21 transitions) in 9 ms.
[2021-05-14 19:12:01] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2021-05-14 19:12:01] [INFO ] Deduced a trap composed of 20 places in 16 ms of which 1 ms to minimize.
[2021-05-14 19:12:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
[2021-05-14 19:12:01] [INFO ] Added : 127 causal constraints over 26 iterations in 335 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 16100 steps, including 746 resets, run finished after 35 ms. (steps per millisecond=460 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 26100 steps, including 934 resets, run finished after 55 ms. (steps per millisecond=474 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 22400 steps, including 668 resets, run finished after 52 ms. (steps per millisecond=430 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 94/94 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 94/94 places, 182/182 transitions.
Starting structural reductions, iteration 0 : 94/94 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2021-05-14 19:12:01] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
// Phase 1: matrix 158 rows 94 cols
[2021-05-14 19:12:01] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 19:12:01] [INFO ] Implicit Places using invariants in 65 ms returned [87, 88, 89, 90]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 66 ms to find 4 implicit places.
[2021-05-14 19:12:01] [INFO ] Redundant transitions in 5 ms returned []
[2021-05-14 19:12:01] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
// Phase 1: matrix 158 rows 90 cols
[2021-05-14 19:12:01] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:12:01] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Starting structural reductions, iteration 1 : 90/94 places, 182/182 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2021-05-14 19:12:01] [INFO ] Redundant transitions in 5 ms returned []
[2021-05-14 19:12:01] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
// Phase 1: matrix 158 rows 90 cols
[2021-05-14 19:12:01] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:12:01] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Finished structural reductions, in 2 iterations. Remains : 90/94 places, 182/182 transitions.
Normalized transition count is 158 out of 182 initially.
// Phase 1: matrix 158 rows 90 cols
[2021-05-14 19:12:01] [INFO ] Computed 11 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1907 ms. (steps per millisecond=524 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 550 ms. (steps per millisecond=1818 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 550 ms. (steps per millisecond=1818 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 550 ms. (steps per millisecond=1818 ) properties (out of 3) seen :0
[2021-05-14 19:12:05] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
// Phase 1: matrix 158 rows 90 cols
[2021-05-14 19:12:05] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:12:05] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:12:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:05] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-14 19:12:05] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:12:05] [INFO ] [Real]Added 66 Read/Feed constraints in 5 ms returned sat
[2021-05-14 19:12:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:12:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:12:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:05] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-14 19:12:05] [INFO ] [Nat]Added 66 Read/Feed constraints in 5 ms returned sat
[2021-05-14 19:12:05] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2021-05-14 19:12:05] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2021-05-14 19:12:05] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2021-05-14 19:12:05] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2021-05-14 19:12:05] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2021-05-14 19:12:05] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:12:05] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2021-05-14 19:12:05] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2021-05-14 19:12:05] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2021-05-14 19:12:05] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2021-05-14 19:12:05] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2021-05-14 19:12:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 397 ms
[2021-05-14 19:12:05] [INFO ] Computed and/alt/rep : 133/335/133 causal constraints (skipped 21 transitions) in 8 ms.
[2021-05-14 19:12:06] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 0 ms to minimize.
[2021-05-14 19:12:06] [INFO ] Deduced a trap composed of 19 places in 15 ms of which 1 ms to minimize.
[2021-05-14 19:12:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 59 ms
[2021-05-14 19:12:06] [INFO ] Added : 123 causal constraints over 25 iterations in 294 ms. Result :sat
Minimization took 38 ms.
[2021-05-14 19:12:06] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:12:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:06] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-14 19:12:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:12:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:12:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:06] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-14 19:12:06] [INFO ] [Nat]Added 66 Read/Feed constraints in 6 ms returned sat
[2021-05-14 19:12:06] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:12:06] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2021-05-14 19:12:06] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2021-05-14 19:12:06] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2021-05-14 19:12:06] [INFO ] Deduced a trap composed of 21 places in 17 ms of which 0 ms to minimize.
[2021-05-14 19:12:06] [INFO ] Deduced a trap composed of 9 places in 9 ms of which 0 ms to minimize.
[2021-05-14 19:12:06] [INFO ] Deduced a trap composed of 14 places in 13 ms of which 1 ms to minimize.
[2021-05-14 19:12:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 187 ms
[2021-05-14 19:12:06] [INFO ] Computed and/alt/rep : 133/335/133 causal constraints (skipped 21 transitions) in 9 ms.
[2021-05-14 19:12:06] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 2 ms to minimize.
[2021-05-14 19:12:06] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2021-05-14 19:12:06] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2021-05-14 19:12:06] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 14 places in 12 ms of which 0 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 202 ms
[2021-05-14 19:12:07] [INFO ] Added : 129 causal constraints over 26 iterations in 435 ms. Result :sat
Minimization took 41 ms.
[2021-05-14 19:12:07] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:12:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:07] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-14 19:12:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:12:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:07] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-14 19:12:07] [INFO ] [Nat]Added 66 Read/Feed constraints in 7 ms returned sat
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 391 ms
[2021-05-14 19:12:07] [INFO ] Computed and/alt/rep : 133/335/133 causal constraints (skipped 21 transitions) in 8 ms.
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 26 places in 20 ms of which 0 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Deduced a trap composed of 19 places in 14 ms of which 0 ms to minimize.
[2021-05-14 19:12:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 94 ms
[2021-05-14 19:12:07] [INFO ] Added : 127 causal constraints over 26 iterations in 336 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 17400 steps, including 769 resets, run finished after 37 ms. (steps per millisecond=470 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 21200 steps, including 712 resets, run finished after 47 ms. (steps per millisecond=451 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 15700 steps, including 678 resets, run finished after 35 ms. (steps per millisecond=448 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 90/90 places, 182/182 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 182/182 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 182/182 transitions.
Starting structural reductions, iteration 0 : 90/90 places, 182/182 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 182/182 (removed 0) transitions.
[2021-05-14 19:12:08] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
// Phase 1: matrix 158 rows 90 cols
[2021-05-14 19:12:08] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:12:08] [INFO ] Implicit Places using invariants in 51 ms returned []
[2021-05-14 19:12:08] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
// Phase 1: matrix 158 rows 90 cols
[2021-05-14 19:12:08] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:12:08] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:12:08] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2021-05-14 19:12:08] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-14 19:12:08] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
// Phase 1: matrix 158 rows 90 cols
[2021-05-14 19:12:08] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:12:08] [INFO ] Dead Transitions using invariants and state equation in 83 ms returned []
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 182/182 transitions.
Starting property specific reduction for Peterson-PT-3-UpperBounds-08
Normalized transition count is 158 out of 182 initially.
// Phase 1: matrix 158 rows 90 cols
[2021-05-14 19:12:13] [INFO ] Computed 11 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
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 :0
[2021-05-14 19:12:13] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
// Phase 1: matrix 158 rows 90 cols
[2021-05-14 19:12:13] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:12:13] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-14 19:12:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:13] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-14 19:12:13] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:12:13] [INFO ] [Real]Added 66 Read/Feed constraints in 5 ms returned sat
[2021-05-14 19:12:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:12:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:12:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:13] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2021-05-14 19:12:13] [INFO ] [Nat]Added 66 Read/Feed constraints in 6 ms returned sat
[2021-05-14 19:12:13] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2021-05-14 19:12:14] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 5 ms to minimize.
[2021-05-14 19:12:14] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2021-05-14 19:12:14] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2021-05-14 19:12:14] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2021-05-14 19:12:14] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2021-05-14 19:12:14] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:12:14] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2021-05-14 19:12:14] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2021-05-14 19:12:14] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2021-05-14 19:12:14] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:12:14] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 413 ms
[2021-05-14 19:12:14] [INFO ] Computed and/alt/rep : 133/335/133 causal constraints (skipped 21 transitions) in 10 ms.
[2021-05-14 19:12:14] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 0 ms to minimize.
[2021-05-14 19:12:14] [INFO ] Deduced a trap composed of 19 places in 14 ms of which 0 ms to minimize.
[2021-05-14 19:12:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 57 ms
[2021-05-14 19:12:14] [INFO ] Added : 123 causal constraints over 25 iterations in 307 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 15700 steps, including 685 resets, run finished after 35 ms. (steps per millisecond=448 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 90 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 90/90 places, 181/181 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 90 transition count 179
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 88 transition count 179
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 88 transition count 177
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 86 transition count 177
Applied a total of 8 rules in 25 ms. Remains 86 /90 variables (removed 4) and now considering 177/181 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/90 places, 177/181 transitions.
Normalized transition count is 153 out of 177 initially.
// Phase 1: matrix 153 rows 86 cols
[2021-05-14 19:12:14] [INFO ] Computed 11 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1833 ms. (steps per millisecond=545 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 535 ms. (steps per millisecond=1869 ) properties (out of 1) seen :0
[2021-05-14 19:12:17] [INFO ] Flow matrix only has 153 transitions (discarded 24 similar events)
// Phase 1: matrix 153 rows 86 cols
[2021-05-14 19:12:17] [INFO ] Computed 11 place invariants in 16 ms
[2021-05-14 19:12:17] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:12:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:17] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-14 19:12:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:12:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:12:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:17] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2021-05-14 19:12:17] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:12:17] [INFO ] [Nat]Added 66 Read/Feed constraints in 7 ms returned sat
[2021-05-14 19:12:17] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2021-05-14 19:12:17] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:12:17] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2021-05-14 19:12:17] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2021-05-14 19:12:17] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2021-05-14 19:12:17] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 0 ms to minimize.
[2021-05-14 19:12:17] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
[2021-05-14 19:12:17] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2021-05-14 19:12:17] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2021-05-14 19:12:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 230 ms
[2021-05-14 19:12:17] [INFO ] Computed and/alt/rep : 128/329/128 causal constraints (skipped 21 transitions) in 9 ms.
[2021-05-14 19:12:17] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2021-05-14 19:12:17] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 0 ms to minimize.
[2021-05-14 19:12:17] [INFO ] Deduced a trap composed of 19 places in 14 ms of which 0 ms to minimize.
[2021-05-14 19:12:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 95 ms
[2021-05-14 19:12:17] [INFO ] Added : 121 causal constraints over 25 iterations in 331 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 14500 steps, including 709 resets, run finished after 31 ms. (steps per millisecond=467 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 86/86 places, 177/177 transitions.
Applied a total of 0 rules in 7 ms. Remains 86 /86 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 177/177 transitions.
Starting structural reductions, iteration 0 : 86/86 places, 177/177 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2021-05-14 19:12:17] [INFO ] Flow matrix only has 153 transitions (discarded 24 similar events)
// Phase 1: matrix 153 rows 86 cols
[2021-05-14 19:12:17] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:12:17] [INFO ] Implicit Places using invariants in 50 ms returned []
[2021-05-14 19:12:17] [INFO ] Flow matrix only has 153 transitions (discarded 24 similar events)
// Phase 1: matrix 153 rows 86 cols
[2021-05-14 19:12:17] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:12:18] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:12:18] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2021-05-14 19:12:18] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-14 19:12:18] [INFO ] Flow matrix only has 153 transitions (discarded 24 similar events)
// Phase 1: matrix 153 rows 86 cols
[2021-05-14 19:12:18] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:12:18] [INFO ] Dead Transitions using invariants and state equation in 98 ms returned []
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 177/177 transitions.
Ending property specific reduction for Peterson-PT-3-UpperBounds-08 in 9827 ms.
Starting property specific reduction for Peterson-PT-3-UpperBounds-09
Normalized transition count is 158 out of 182 initially.
// Phase 1: matrix 158 rows 90 cols
[2021-05-14 19:12:18] [INFO ] Computed 11 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 :0
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 :0
[2021-05-14 19:12:18] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
// Phase 1: matrix 158 rows 90 cols
[2021-05-14 19:12:18] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:12:18] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:12:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:18] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2021-05-14 19:12:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:12:18] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:12:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:18] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-14 19:12:18] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:12:18] [INFO ] [Nat]Added 66 Read/Feed constraints in 6 ms returned sat
[2021-05-14 19:12:18] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2021-05-14 19:12:18] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2021-05-14 19:12:18] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2021-05-14 19:12:18] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2021-05-14 19:12:18] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 0 ms to minimize.
[2021-05-14 19:12:18] [INFO ] Deduced a trap composed of 9 places in 9 ms of which 0 ms to minimize.
[2021-05-14 19:12:18] [INFO ] Deduced a trap composed of 14 places in 15 ms of which 1 ms to minimize.
[2021-05-14 19:12:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 186 ms
[2021-05-14 19:12:18] [INFO ] Computed and/alt/rep : 133/335/133 causal constraints (skipped 21 transitions) in 9 ms.
[2021-05-14 19:12:18] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2021-05-14 19:12:18] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 0 ms to minimize.
[2021-05-14 19:12:18] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2021-05-14 19:12:18] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2021-05-14 19:12:18] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2021-05-14 19:12:18] [INFO ] Deduced a trap composed of 14 places in 13 ms of which 0 ms to minimize.
[2021-05-14 19:12:18] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 220 ms
[2021-05-14 19:12:18] [INFO ] Added : 129 causal constraints over 26 iterations in 452 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 21200 steps, including 706 resets, run finished after 47 ms. (steps per millisecond=451 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 90 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 90/90 places, 181/181 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 89 transition count 176
Reduce places removed 4 places and 1 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 85 transition count 175
Applied a total of 8 rules in 7 ms. Remains 85 /90 variables (removed 5) and now considering 175/181 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/90 places, 175/181 transitions.
Normalized transition count is 151 out of 175 initially.
// Phase 1: matrix 151 rows 85 cols
[2021-05-14 19:12:19] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1839 ms. (steps per millisecond=543 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 540 ms. (steps per millisecond=1851 ) properties (out of 1) seen :0
[2021-05-14 19:12:21] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 85 cols
[2021-05-14 19:12:21] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:12:21] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:12:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:21] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2021-05-14 19:12:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:12:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:12:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:21] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2021-05-14 19:12:21] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-14 19:12:21] [INFO ] [Nat]Added 65 Read/Feed constraints in 6 ms returned sat
[2021-05-14 19:12:21] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 1 ms to minimize.
[2021-05-14 19:12:21] [INFO ] Deduced a trap composed of 13 places in 15 ms of which 0 ms to minimize.
[2021-05-14 19:12:21] [INFO ] Deduced a trap composed of 14 places in 15 ms of which 0 ms to minimize.
[2021-05-14 19:12:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 65 ms
[2021-05-14 19:12:21] [INFO ] Computed and/alt/rep : 127/335/127 causal constraints (skipped 20 transitions) in 9 ms.
[2021-05-14 19:12:21] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2021-05-14 19:12:21] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2021-05-14 19:12:21] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 0 ms to minimize.
[2021-05-14 19:12:21] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2021-05-14 19:12:22] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2021-05-14 19:12:22] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2021-05-14 19:12:22] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2021-05-14 19:12:22] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 0 ms to minimize.
[2021-05-14 19:12:22] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2021-05-14 19:12:22] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2021-05-14 19:12:22] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2021-05-14 19:12:22] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 0 ms to minimize.
[2021-05-14 19:12:22] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2021-05-14 19:12:22] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 1 ms to minimize.
[2021-05-14 19:12:22] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2021-05-14 19:12:22] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2021-05-14 19:12:22] [INFO ] Deduced a trap composed of 19 places in 15 ms of which 1 ms to minimize.
[2021-05-14 19:12:22] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 671 ms
[2021-05-14 19:12:22] [INFO ] Added : 104 causal constraints over 22 iterations in 873 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 6700 steps, including 312 resets, run finished after 15 ms. (steps per millisecond=446 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 85/85 places, 175/175 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 175/175 transitions.
Starting structural reductions, iteration 0 : 85/85 places, 175/175 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2021-05-14 19:12:22] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 85 cols
[2021-05-14 19:12:22] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:12:22] [INFO ] Implicit Places using invariants in 59 ms returned []
[2021-05-14 19:12:22] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 85 cols
[2021-05-14 19:12:22] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:12:22] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-14 19:12:22] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2021-05-14 19:12:22] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 19:12:22] [INFO ] Flow matrix only has 151 transitions (discarded 24 similar events)
// Phase 1: matrix 151 rows 85 cols
[2021-05-14 19:12:22] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:12:22] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 175/175 transitions.
Ending property specific reduction for Peterson-PT-3-UpperBounds-09 in 4647 ms.
Starting property specific reduction for Peterson-PT-3-UpperBounds-12
Normalized transition count is 158 out of 182 initially.
// Phase 1: matrix 158 rows 90 cols
[2021-05-14 19:12:22] [INFO ] Computed 11 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 :0
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 :0
[2021-05-14 19:12:22] [INFO ] Flow matrix only has 158 transitions (discarded 24 similar events)
// Phase 1: matrix 158 rows 90 cols
[2021-05-14 19:12:22] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:12:22] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned sat
[2021-05-14 19:12:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:22] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-14 19:12:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:12:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:12:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:23] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2021-05-14 19:12:23] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:12:23] [INFO ] [Nat]Added 66 Read/Feed constraints in 6 ms returned sat
[2021-05-14 19:12:23] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2021-05-14 19:12:23] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2021-05-14 19:12:23] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2021-05-14 19:12:23] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2021-05-14 19:12:23] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2021-05-14 19:12:23] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 0 ms to minimize.
[2021-05-14 19:12:23] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 0 ms to minimize.
[2021-05-14 19:12:23] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2021-05-14 19:12:23] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2021-05-14 19:12:23] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2021-05-14 19:12:23] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2021-05-14 19:12:23] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2021-05-14 19:12:23] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2021-05-14 19:12:23] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
[2021-05-14 19:12:23] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 418 ms
[2021-05-14 19:12:23] [INFO ] Computed and/alt/rep : 133/335/133 causal constraints (skipped 21 transitions) in 9 ms.
[2021-05-14 19:12:23] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2021-05-14 19:12:23] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
[2021-05-14 19:12:23] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2021-05-14 19:12:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 109 ms
[2021-05-14 19:12:23] [INFO ] Added : 127 causal constraints over 26 iterations in 349 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 17400 steps, including 766 resets, run finished after 35 ms. (steps per millisecond=497 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 90 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 90/90 places, 181/181 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 89 transition count 179
Reduce places removed 2 places and 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 87 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 87 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 86 transition count 177
Applied a total of 6 rules in 17 ms. Remains 86 /90 variables (removed 4) and now considering 177/181 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/90 places, 177/181 transitions.
Normalized transition count is 153 out of 177 initially.
// Phase 1: matrix 153 rows 86 cols
[2021-05-14 19:12:23] [INFO ] Computed 11 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1817 ms. (steps per millisecond=550 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 541 ms. (steps per millisecond=1848 ) properties (out of 1) seen :0
[2021-05-14 19:12:26] [INFO ] Flow matrix only has 153 transitions (discarded 24 similar events)
// Phase 1: matrix 153 rows 86 cols
[2021-05-14 19:12:26] [INFO ] Computed 11 place invariants in 0 ms
[2021-05-14 19:12:26] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:12:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:26] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2021-05-14 19:12:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 19:12:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2021-05-14 19:12:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 19:12:26] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2021-05-14 19:12:26] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:12:26] [INFO ] [Nat]Added 66 Read/Feed constraints in 7 ms returned sat
[2021-05-14 19:12:26] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2021-05-14 19:12:26] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2021-05-14 19:12:26] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2021-05-14 19:12:26] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2021-05-14 19:12:26] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2021-05-14 19:12:26] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2021-05-14 19:12:26] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2021-05-14 19:12:26] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2021-05-14 19:12:26] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2021-05-14 19:12:26] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 377 ms
[2021-05-14 19:12:26] [INFO ] Computed and/alt/rep : 128/329/128 causal constraints (skipped 21 transitions) in 8 ms.
[2021-05-14 19:12:26] [INFO ] Added : 87 causal constraints over 18 iterations in 198 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 20000 steps, including 909 resets, run finished after 40 ms. (steps per millisecond=500 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 86/86 places, 177/177 transitions.
Applied a total of 0 rules in 3 ms. Remains 86 /86 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 177/177 transitions.
Starting structural reductions, iteration 0 : 86/86 places, 177/177 transitions.
Applied a total of 0 rules in 4 ms. Remains 86 /86 variables (removed 0) and now considering 177/177 (removed 0) transitions.
[2021-05-14 19:12:27] [INFO ] Flow matrix only has 153 transitions (discarded 24 similar events)
// Phase 1: matrix 153 rows 86 cols
[2021-05-14 19:12:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:12:27] [INFO ] Implicit Places using invariants in 67 ms returned []
[2021-05-14 19:12:27] [INFO ] Flow matrix only has 153 transitions (discarded 24 similar events)
// Phase 1: matrix 153 rows 86 cols
[2021-05-14 19:12:27] [INFO ] Computed 11 place invariants in 1 ms
[2021-05-14 19:12:27] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-14 19:12:27] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2021-05-14 19:12:27] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-14 19:12:27] [INFO ] Flow matrix only has 153 transitions (discarded 24 similar events)
// Phase 1: matrix 153 rows 86 cols
[2021-05-14 19:12:27] [INFO ] Computed 11 place invariants in 6 ms
[2021-05-14 19:12:27] [INFO ] Dead Transitions using invariants and state equation in 74 ms returned []
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 177/177 transitions.
Ending property specific reduction for Peterson-PT-3-UpperBounds-12 in 4456 ms.
[2021-05-14 19:12:39] [INFO ] Flatten gal took : 56 ms
[2021-05-14 19:12:39] [INFO ] Applying decomposition
[2021-05-14 19:12:39] [INFO ] Flatten gal took : 14 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/graph5360133304203452341.txt, -o, /tmp/graph5360133304203452341.bin, -w, /tmp/graph5360133304203452341.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/graph5360133304203452341.bin, -l, -1, -v, -w, /tmp/graph5360133304203452341.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 19:12:39] [INFO ] Decomposing Gal with order
[2021-05-14 19:12:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 19:12:39] [INFO ] Removed a total of 173 redundant transitions.
[2021-05-14 19:12:39] [INFO ] Flatten gal took : 44 ms
[2021-05-14 19:12:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 9 ms.
[2021-05-14 19:12:39] [INFO ] Time to serialize gal into /tmp/UpperBounds18054982451271256616.gal : 7 ms
[2021-05-14 19:12:39] [INFO ] Time to serialize properties into /tmp/UpperBounds2156456341808055824.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds18054982451271256616.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds2156456341808055824.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/UpperBounds18054982451271256616.gal -t CGAL -reachable-file /tmp/UpperBounds2156456341808055824.prop --nowitness
Loading property file /tmp/UpperBounds2156456341808055824.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,70998,1.74206,48156,1627,251,65623,3588,481,163112,123,27278,0
Total reachable state count : 70998

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-PT-3-UpperBounds-08 :0 <= i3.u18.IsEndLoop_3_2_3 <= 1
FORMULA Peterson-PT-3-UpperBounds-08 1 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
Peterson-PT-3-UpperBounds-08,0,1.76896,48156,1,0,65623,3588,588,163112,140,27278,597
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-PT-3-UpperBounds-09 :0 <= i3.u0.TestIdentity_3_2_2 <= 1
FORMULA Peterson-PT-3-UpperBounds-09 1 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
Peterson-PT-3-UpperBounds-09,0,1.76943,48156,1,0,65623,3588,609,163112,147,27278,620
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-PT-3-UpperBounds-12 :0 <= i3.u5.BeginLoop_3_2_3 <= 1
FORMULA Peterson-PT-3-UpperBounds-12 1 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
Peterson-PT-3-UpperBounds-12,0,1.76967,48156,1,0,65623,3588,630,163112,147,27278,640
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621019562644

--------------------
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="Peterson-PT-3"
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 Peterson-PT-3, 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 r140-tall-162089128200611"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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