Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245688800101.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 ASLink-PT-06b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245688800101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.4K Apr 30 07:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 30 07:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 30 07:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 30 07:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 9 07:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 921K May 10 09:33 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 ASLink-PT-06b-UpperBounds-00
FORMULA_NAME ASLink-PT-06b-UpperBounds-01
FORMULA_NAME ASLink-PT-06b-UpperBounds-02
FORMULA_NAME ASLink-PT-06b-UpperBounds-03
FORMULA_NAME ASLink-PT-06b-UpperBounds-04
FORMULA_NAME ASLink-PT-06b-UpperBounds-05
FORMULA_NAME ASLink-PT-06b-UpperBounds-06
FORMULA_NAME ASLink-PT-06b-UpperBounds-07
FORMULA_NAME ASLink-PT-06b-UpperBounds-08
FORMULA_NAME ASLink-PT-06b-UpperBounds-09
FORMULA_NAME ASLink-PT-06b-UpperBounds-10
FORMULA_NAME ASLink-PT-06b-UpperBounds-11
FORMULA_NAME ASLink-PT-06b-UpperBounds-12
FORMULA_NAME ASLink-PT-06b-UpperBounds-13
FORMULA_NAME ASLink-PT-06b-UpperBounds-14
FORMULA_NAME ASLink-PT-06b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652649661445

Running Version 202205111006
[2022-05-15 21:21:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 21:21:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 21:21:02] [INFO ] Load time of PNML (sax parser for PT used): 213 ms
[2022-05-15 21:21:02] [INFO ] Transformed 2826 places.
[2022-05-15 21:21:02] [INFO ] Transformed 3513 transitions.
[2022-05-15 21:21:02] [INFO ] Found NUPN structural information;
[2022-05-15 21:21:03] [INFO ] Parsed PT model containing 2826 places and 3513 transitions in 353 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 3513 rows 2826 cols
[2022-05-15 21:21:03] [INFO ] Computed 277 place invariants in 145 ms
Incomplete random walk after 10000 steps, including 15 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 16) seen :9
FORMULA ASLink-PT-06b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :1
FORMULA ASLink-PT-06b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
// Phase 1: matrix 3513 rows 2826 cols
[2022-05-15 21:21:03] [INFO ] Computed 277 place invariants in 116 ms
[2022-05-15 21:21:04] [INFO ] [Real]Absence check using 65 positive place invariants in 118 ms returned sat
[2022-05-15 21:21:04] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 104 ms returned sat
[2022-05-15 21:21:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:21:06] [INFO ] [Real]Absence check using state equation in 2055 ms returned sat
[2022-05-15 21:21:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:21:07] [INFO ] [Nat]Absence check using 65 positive place invariants in 76 ms returned sat
[2022-05-15 21:21:07] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 120 ms returned sat
[2022-05-15 21:21:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:21:11] [INFO ] [Nat]Absence check using state equation in 4255 ms returned unknown
[2022-05-15 21:21:12] [INFO ] [Real]Absence check using 65 positive place invariants in 65 ms returned sat
[2022-05-15 21:21:12] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 91 ms returned sat
[2022-05-15 21:21:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:21:14] [INFO ] [Real]Absence check using state equation in 1875 ms returned sat
[2022-05-15 21:21:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:21:14] [INFO ] [Nat]Absence check using 65 positive place invariants in 73 ms returned sat
[2022-05-15 21:21:14] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 96 ms returned sat
[2022-05-15 21:21:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:21:19] [INFO ] [Nat]Absence check using state equation in 4340 ms returned unknown
[2022-05-15 21:21:19] [INFO ] [Real]Absence check using 65 positive place invariants in 49 ms returned sat
[2022-05-15 21:21:19] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 77 ms returned sat
[2022-05-15 21:21:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:21:22] [INFO ] [Real]Absence check using state equation in 2334 ms returned sat
[2022-05-15 21:21:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:21:22] [INFO ] [Nat]Absence check using 65 positive place invariants in 70 ms returned sat
[2022-05-15 21:21:22] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 97 ms returned sat
[2022-05-15 21:21:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:21:27] [INFO ] [Nat]Absence check using state equation in 4407 ms returned unknown
[2022-05-15 21:21:27] [INFO ] [Real]Absence check using 65 positive place invariants in 65 ms returned sat
[2022-05-15 21:21:28] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 126 ms returned sat
[2022-05-15 21:21:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:21:30] [INFO ] [Real]Absence check using state equation in 2256 ms returned sat
[2022-05-15 21:21:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:21:30] [INFO ] [Nat]Absence check using 65 positive place invariants in 68 ms returned sat
[2022-05-15 21:21:31] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 93 ms returned sat
[2022-05-15 21:21:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:21:35] [INFO ] [Nat]Absence check using state equation in 4380 ms returned unknown
[2022-05-15 21:21:35] [INFO ] [Real]Absence check using 65 positive place invariants in 46 ms returned sat
[2022-05-15 21:21:35] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 71 ms returned sat
[2022-05-15 21:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:21:37] [INFO ] [Real]Absence check using state equation in 1309 ms returned sat
[2022-05-15 21:21:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:21:37] [INFO ] [Nat]Absence check using 65 positive place invariants in 47 ms returned sat
[2022-05-15 21:21:37] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 67 ms returned sat
[2022-05-15 21:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:21:42] [INFO ] [Nat]Absence check using state equation in 4465 ms returned unknown
[2022-05-15 21:21:42] [INFO ] [Real]Absence check using 65 positive place invariants in 62 ms returned sat
[2022-05-15 21:21:43] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 93 ms returned sat
[2022-05-15 21:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:21:44] [INFO ] [Real]Absence check using state equation in 1418 ms returned sat
[2022-05-15 21:21:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:21:45] [INFO ] [Nat]Absence check using 65 positive place invariants in 67 ms returned sat
[2022-05-15 21:21:45] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 89 ms returned sat
[2022-05-15 21:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:21:49] [INFO ] [Nat]Absence check using state equation in 4437 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 2826 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2826/2826 places, 3513/3513 transitions.
Drop transitions removed 653 transitions
Trivial Post-agglo rules discarded 653 transitions
Performed 653 trivial Post agglomeration. Transition count delta: 653
Iterating post reduction 0 with 653 rules applied. Total rules applied 653 place count 2826 transition count 2860
Reduce places removed 653 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 683 rules applied. Total rules applied 1336 place count 2173 transition count 2830
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 1345 place count 2165 transition count 2829
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1346 place count 2164 transition count 2829
Performed 654 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 654 Pre rules applied. Total rules applied 1346 place count 2164 transition count 2175
Deduced a syphon composed of 654 places in 6 ms
Ensure Unique test removed 62 places
Reduce places removed 716 places and 0 transitions.
Iterating global reduction 4 with 1370 rules applied. Total rules applied 2716 place count 1448 transition count 2175
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 4 with 45 rules applied. Total rules applied 2761 place count 1442 transition count 2136
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 5 with 39 rules applied. Total rules applied 2800 place count 1403 transition count 2136
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 23 Pre rules applied. Total rules applied 2800 place count 1403 transition count 2113
Deduced a syphon composed of 23 places in 15 ms
Ensure Unique test removed 23 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 6 with 69 rules applied. Total rules applied 2869 place count 1357 transition count 2113
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 23 Pre rules applied. Total rules applied 2869 place count 1357 transition count 2090
Deduced a syphon composed of 23 places in 13 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 2915 place count 1334 transition count 2090
Discarding 89 places :
Symmetric choice reduction at 6 with 89 rule applications. Total rules 3004 place count 1245 transition count 2001
Iterating global reduction 6 with 89 rules applied. Total rules applied 3093 place count 1245 transition count 2001
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3094 place count 1245 transition count 2000
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 30 Pre rules applied. Total rules applied 3094 place count 1245 transition count 1970
Deduced a syphon composed of 30 places in 9 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 61 rules applied. Total rules applied 3155 place count 1214 transition count 1970
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3155 place count 1214 transition count 1969
Deduced a syphon composed of 1 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 3158 place count 1212 transition count 1969
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 3165 place count 1205 transition count 1924
Iterating global reduction 7 with 7 rules applied. Total rules applied 3172 place count 1205 transition count 1924
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 3172 place count 1205 transition count 1919
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 3182 place count 1200 transition count 1919
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3183 place count 1199 transition count 1911
Iterating global reduction 7 with 1 rules applied. Total rules applied 3184 place count 1199 transition count 1911
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3185 place count 1198 transition count 1903
Iterating global reduction 7 with 1 rules applied. Total rules applied 3186 place count 1198 transition count 1903
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3187 place count 1197 transition count 1895
Iterating global reduction 7 with 1 rules applied. Total rules applied 3188 place count 1197 transition count 1895
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3189 place count 1196 transition count 1887
Iterating global reduction 7 with 1 rules applied. Total rules applied 3190 place count 1196 transition count 1887
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3191 place count 1195 transition count 1879
Iterating global reduction 7 with 1 rules applied. Total rules applied 3192 place count 1195 transition count 1879
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3193 place count 1194 transition count 1871
Iterating global reduction 7 with 1 rules applied. Total rules applied 3194 place count 1194 transition count 1871
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3195 place count 1193 transition count 1863
Iterating global reduction 7 with 1 rules applied. Total rules applied 3196 place count 1193 transition count 1863
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3197 place count 1192 transition count 1855
Iterating global reduction 7 with 1 rules applied. Total rules applied 3198 place count 1192 transition count 1855
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3199 place count 1191 transition count 1847
Iterating global reduction 7 with 1 rules applied. Total rules applied 3200 place count 1191 transition count 1847
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3201 place count 1190 transition count 1839
Iterating global reduction 7 with 1 rules applied. Total rules applied 3202 place count 1190 transition count 1839
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3203 place count 1189 transition count 1831
Iterating global reduction 7 with 1 rules applied. Total rules applied 3204 place count 1189 transition count 1831
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3205 place count 1188 transition count 1823
Iterating global reduction 7 with 1 rules applied. Total rules applied 3206 place count 1188 transition count 1823
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3207 place count 1187 transition count 1815
Iterating global reduction 7 with 1 rules applied. Total rules applied 3208 place count 1187 transition count 1815
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3209 place count 1186 transition count 1807
Iterating global reduction 7 with 1 rules applied. Total rules applied 3210 place count 1186 transition count 1807
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3211 place count 1185 transition count 1799
Iterating global reduction 7 with 1 rules applied. Total rules applied 3212 place count 1185 transition count 1799
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3213 place count 1184 transition count 1791
Iterating global reduction 7 with 1 rules applied. Total rules applied 3214 place count 1184 transition count 1791
Performed 164 Post agglomeration using F-continuation condition.Transition count delta: 164
Deduced a syphon composed of 164 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 165 places and 0 transitions.
Iterating global reduction 7 with 329 rules applied. Total rules applied 3543 place count 1019 transition count 1627
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3544 place count 1018 transition count 1626
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 3546 place count 1017 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3547 place count 1016 transition count 1625
Iterating global reduction 7 with 1 rules applied. Total rules applied 3548 place count 1016 transition count 1625
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 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 7 with 2 rules applied. Total rules applied 3550 place count 1016 transition count 1623
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3551 place count 1015 transition count 1623
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3553 place count 1014 transition count 1632
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 3560 place count 1014 transition count 1625
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 3567 place count 1007 transition count 1625
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 10 with 6 rules applied. Total rules applied 3573 place count 1007 transition count 1619
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 10 with 6 rules applied. Total rules applied 3579 place count 1001 transition count 1619
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 3580 place count 1001 transition count 1619
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 3581 place count 1000 transition count 1618
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 11 with 17 rules applied. Total rules applied 3598 place count 988 transition count 1613
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 6 rules applied. Total rules applied 3604 place count 983 transition count 1612
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 3605 place count 982 transition count 1612
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 18 Pre rules applied. Total rules applied 3605 place count 982 transition count 1594
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 14 with 37 rules applied. Total rules applied 3642 place count 963 transition count 1594
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 14 with 7 rules applied. Total rules applied 3649 place count 956 transition count 1594
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 3649 place count 956 transition count 1593
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 3651 place count 955 transition count 1593
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 15 with 24 rules applied. Total rules applied 3675 place count 943 transition count 1581
Discarding 6 places :
Symmetric choice reduction at 15 with 6 rule applications. Total rules 3681 place count 937 transition count 1575
Iterating global reduction 15 with 6 rules applied. Total rules applied 3687 place count 937 transition count 1575
Free-agglomeration rule applied 6 times.
Iterating global reduction 15 with 6 rules applied. Total rules applied 3693 place count 937 transition count 1569
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 15 with 6 rules applied. Total rules applied 3699 place count 931 transition count 1569
Applied a total of 3699 rules in 2356 ms. Remains 931 /2826 variables (removed 1895) and now considering 1569/3513 (removed 1944) transitions.
Finished structural reductions, in 1 iterations. Remains : 931/2826 places, 1569/3513 transitions.
// Phase 1: matrix 1569 rows 931 cols
[2022-05-15 21:21:52] [INFO ] Computed 162 place invariants in 26 ms
Incomplete random walk after 1000000 steps, including 11255 resets, run finished after 2850 ms. (steps per millisecond=350 ) properties (out of 6) seen :2
FORMULA ASLink-PT-06b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1860 resets, run finished after 1180 ms. (steps per millisecond=847 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1871 resets, run finished after 1259 ms. (steps per millisecond=794 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1858 resets, run finished after 1357 ms. (steps per millisecond=736 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1868 resets, run finished after 1471 ms. (steps per millisecond=679 ) properties (out of 4) seen :0
// Phase 1: matrix 1569 rows 931 cols
[2022-05-15 21:22:00] [INFO ] Computed 162 place invariants in 35 ms
[2022-05-15 21:22:00] [INFO ] [Real]Absence check using 42 positive place invariants in 16 ms returned sat
[2022-05-15 21:22:00] [INFO ] [Real]Absence check using 42 positive and 120 generalized place invariants in 26 ms returned sat
[2022-05-15 21:22:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:22:00] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2022-05-15 21:22:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:22:01] [INFO ] [Nat]Absence check using 42 positive place invariants in 18 ms returned sat
[2022-05-15 21:22:01] [INFO ] [Nat]Absence check using 42 positive and 120 generalized place invariants in 25 ms returned sat
[2022-05-15 21:22:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:22:01] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2022-05-15 21:22:01] [INFO ] Computed and/alt/rep : 619/2342/619 causal constraints (skipped 917 transitions) in 84 ms.
[2022-05-15 21:22:13] [INFO ] Deduced a trap composed of 101 places in 391 ms of which 4 ms to minimize.
[2022-05-15 21:22:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 603 ms
[2022-05-15 21:22:13] [INFO ] Added : 437 causal constraints over 88 iterations in 12111 ms. Result :sat
Minimization took 605 ms.
[2022-05-15 21:22:14] [INFO ] [Real]Absence check using 42 positive place invariants in 20 ms returned sat
[2022-05-15 21:22:14] [INFO ] [Real]Absence check using 42 positive and 120 generalized place invariants in 54 ms returned sat
[2022-05-15 21:22:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:22:15] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2022-05-15 21:22:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:22:15] [INFO ] [Nat]Absence check using 42 positive place invariants in 12 ms returned sat
[2022-05-15 21:22:15] [INFO ] [Nat]Absence check using 42 positive and 120 generalized place invariants in 20 ms returned sat
[2022-05-15 21:22:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:22:16] [INFO ] [Nat]Absence check using state equation in 670 ms returned sat
[2022-05-15 21:22:16] [INFO ] Computed and/alt/rep : 619/2342/619 causal constraints (skipped 917 transitions) in 100 ms.
[2022-05-15 21:22:29] [INFO ] Added : 493 causal constraints over 99 iterations in 13287 ms. Result :sat
Minimization took 581 ms.
[2022-05-15 21:22:30] [INFO ] [Real]Absence check using 42 positive place invariants in 15 ms returned sat
[2022-05-15 21:22:30] [INFO ] [Real]Absence check using 42 positive and 120 generalized place invariants in 26 ms returned sat
[2022-05-15 21:22:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:22:30] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2022-05-15 21:22:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:22:30] [INFO ] [Nat]Absence check using 42 positive place invariants in 11 ms returned sat
[2022-05-15 21:22:30] [INFO ] [Nat]Absence check using 42 positive and 120 generalized place invariants in 20 ms returned sat
[2022-05-15 21:22:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:22:31] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2022-05-15 21:22:31] [INFO ] Computed and/alt/rep : 619/2342/619 causal constraints (skipped 917 transitions) in 92 ms.
[2022-05-15 21:22:43] [INFO ] Added : 462 causal constraints over 93 iterations in 12088 ms. Result :sat
Minimization took 666 ms.
[2022-05-15 21:22:44] [INFO ] [Real]Absence check using 42 positive place invariants in 16 ms returned sat
[2022-05-15 21:22:44] [INFO ] [Real]Absence check using 42 positive and 120 generalized place invariants in 32 ms returned sat
[2022-05-15 21:22:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:22:44] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2022-05-15 21:22:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:22:45] [INFO ] [Nat]Absence check using 42 positive place invariants in 16 ms returned sat
[2022-05-15 21:22:45] [INFO ] [Nat]Absence check using 42 positive and 120 generalized place invariants in 26 ms returned sat
[2022-05-15 21:22:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:22:45] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2022-05-15 21:22:46] [INFO ] Computed and/alt/rep : 619/2342/619 causal constraints (skipped 917 transitions) in 126 ms.
[2022-05-15 21:22:57] [INFO ] Added : 447 causal constraints over 90 iterations in 11950 ms. Result :sat
Minimization took 588 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 931 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 931/931 places, 1569/1569 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 931 transition count 1567
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 929 transition count 1567
Applied a total of 4 rules in 63 ms. Remains 929 /931 variables (removed 2) and now considering 1567/1569 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 929/931 places, 1567/1569 transitions.
// Phase 1: matrix 1567 rows 929 cols
[2022-05-15 21:23:01] [INFO ] Computed 162 place invariants in 33 ms
Incomplete random walk after 1000000 steps, including 11331 resets, run finished after 3258 ms. (steps per millisecond=306 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1852 resets, run finished after 1368 ms. (steps per millisecond=730 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1862 resets, run finished after 1089 ms. (steps per millisecond=918 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1872 resets, run finished after 1338 ms. (steps per millisecond=747 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1873 resets, run finished after 1319 ms. (steps per millisecond=758 ) properties (out of 4) seen :0
// Phase 1: matrix 1567 rows 929 cols
[2022-05-15 21:23:09] [INFO ] Computed 162 place invariants in 35 ms
[2022-05-15 21:23:09] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned sat
[2022-05-15 21:23:09] [INFO ] [Real]Absence check using 42 positive and 120 generalized place invariants in 27 ms returned sat
[2022-05-15 21:23:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:23:10] [INFO ] [Real]Absence check using state equation in 516 ms returned sat
[2022-05-15 21:23:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:23:10] [INFO ] [Nat]Absence check using 42 positive place invariants in 14 ms returned sat
[2022-05-15 21:23:10] [INFO ] [Nat]Absence check using 42 positive and 120 generalized place invariants in 25 ms returned sat
[2022-05-15 21:23:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:23:11] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2022-05-15 21:23:11] [INFO ] Deduced a trap composed of 234 places in 365 ms of which 14 ms to minimize.
[2022-05-15 21:23:12] [INFO ] Deduced a trap composed of 209 places in 371 ms of which 1 ms to minimize.
[2022-05-15 21:23:12] [INFO ] Deduced a trap composed of 233 places in 346 ms of which 1 ms to minimize.
[2022-05-15 21:23:12] [INFO ] Deduced a trap composed of 221 places in 266 ms of which 1 ms to minimize.
[2022-05-15 21:23:13] [INFO ] Deduced a trap composed of 202 places in 315 ms of which 1 ms to minimize.
[2022-05-15 21:23:13] [INFO ] Deduced a trap composed of 184 places in 248 ms of which 2 ms to minimize.
[2022-05-15 21:23:13] [INFO ] Deduced a trap composed of 241 places in 236 ms of which 1 ms to minimize.
[2022-05-15 21:23:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2582 ms
[2022-05-15 21:23:14] [INFO ] Computed and/alt/rep : 617/2340/617 causal constraints (skipped 917 transitions) in 107 ms.
[2022-05-15 21:23:22] [INFO ] Added : 436 causal constraints over 88 iterations in 8947 ms. Result :sat
Minimization took 399 ms.
[2022-05-15 21:23:23] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned sat
[2022-05-15 21:23:23] [INFO ] [Real]Absence check using 42 positive and 120 generalized place invariants in 25 ms returned sat
[2022-05-15 21:23:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:23:23] [INFO ] [Real]Absence check using state equation in 450 ms returned sat
[2022-05-15 21:23:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:23:24] [INFO ] [Nat]Absence check using 42 positive place invariants in 14 ms returned sat
[2022-05-15 21:23:24] [INFO ] [Nat]Absence check using 42 positive and 120 generalized place invariants in 24 ms returned sat
[2022-05-15 21:23:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:23:24] [INFO ] [Nat]Absence check using state equation in 654 ms returned sat
[2022-05-15 21:23:24] [INFO ] Computed and/alt/rep : 617/2340/617 causal constraints (skipped 917 transitions) in 109 ms.
[2022-05-15 21:23:36] [INFO ] Added : 442 causal constraints over 89 iterations in 11582 ms. Result :sat
Minimization took 563 ms.
[2022-05-15 21:23:37] [INFO ] [Real]Absence check using 42 positive place invariants in 15 ms returned sat
[2022-05-15 21:23:37] [INFO ] [Real]Absence check using 42 positive and 120 generalized place invariants in 26 ms returned sat
[2022-05-15 21:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:23:37] [INFO ] [Real]Absence check using state equation in 512 ms returned sat
[2022-05-15 21:23:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:23:37] [INFO ] [Nat]Absence check using 42 positive place invariants in 14 ms returned sat
[2022-05-15 21:23:37] [INFO ] [Nat]Absence check using 42 positive and 120 generalized place invariants in 25 ms returned sat
[2022-05-15 21:23:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:23:38] [INFO ] [Nat]Absence check using state equation in 464 ms returned sat
[2022-05-15 21:23:38] [INFO ] Computed and/alt/rep : 617/2340/617 causal constraints (skipped 917 transitions) in 72 ms.
[2022-05-15 21:23:51] [INFO ] Added : 474 causal constraints over 95 iterations in 12703 ms. Result :sat
Minimization took 470 ms.
[2022-05-15 21:23:51] [INFO ] [Real]Absence check using 42 positive place invariants in 14 ms returned sat
[2022-05-15 21:23:51] [INFO ] [Real]Absence check using 42 positive and 120 generalized place invariants in 26 ms returned sat
[2022-05-15 21:23:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:23:52] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2022-05-15 21:23:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:23:52] [INFO ] [Nat]Absence check using 42 positive place invariants in 15 ms returned sat
[2022-05-15 21:23:52] [INFO ] [Nat]Absence check using 42 positive and 120 generalized place invariants in 26 ms returned sat
[2022-05-15 21:23:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:23:53] [INFO ] [Nat]Absence check using state equation in 695 ms returned sat
[2022-05-15 21:23:53] [INFO ] Computed and/alt/rep : 617/2340/617 causal constraints (skipped 917 transitions) in 94 ms.
[2022-05-15 21:23:56] [INFO ] Added : 130 causal constraints over 26 iterations in 3442 ms. Result :sat
Minimization took 357 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 929 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 929/929 places, 1567/1567 transitions.
Applied a total of 0 rules in 39 ms. Remains 929 /929 variables (removed 0) and now considering 1567/1567 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 929/929 places, 1567/1567 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 929/929 places, 1567/1567 transitions.
Applied a total of 0 rules in 37 ms. Remains 929 /929 variables (removed 0) and now considering 1567/1567 (removed 0) transitions.
// Phase 1: matrix 1567 rows 929 cols
[2022-05-15 21:23:59] [INFO ] Computed 162 place invariants in 18 ms
[2022-05-15 21:24:00] [INFO ] Implicit Places using invariants in 750 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 224, 258, 262, 263, 274, 275, 277, 294, 312, 383, 387, 388, 399, 400, 402, 419, 437, 508, 513, 514, 525, 526, 528, 545, 563, 632, 636, 637, 648, 649, 651, 668, 686, 755, 759, 760, 763, 774, 775, 776, 794, 796, 800, 818, 819, 820, 821, 833, 839, 845, 851, 857, 863, 869, 875, 881, 887, 893]
Discarding 71 places :
Implicit Place search using SMT only with invariants took 761 ms to find 71 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 858/929 places, 1567/1567 transitions.
Drop transitions removed 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 858 transition count 1443
Reduce places removed 124 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 133 rules applied. Total rules applied 257 place count 734 transition count 1434
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 261 place count 730 transition count 1434
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 261 place count 730 transition count 1403
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 324 place count 698 transition count 1403
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 336 place count 694 transition count 1395
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 344 place count 686 transition count 1395
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 359 place count 671 transition count 1380
Iterating global reduction 5 with 15 rules applied. Total rules applied 374 place count 671 transition count 1380
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 377 place count 671 transition count 1377
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 377 place count 671 transition count 1376
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 379 place count 670 transition count 1376
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 382 place count 667 transition count 1370
Iterating global reduction 6 with 3 rules applied. Total rules applied 385 place count 667 transition count 1370
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 386 place count 666 transition count 1369
Iterating global reduction 6 with 1 rules applied. Total rules applied 387 place count 666 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 388 place count 665 transition count 1367
Iterating global reduction 6 with 1 rules applied. Total rules applied 389 place count 665 transition count 1367
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 2 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 479 place count 620 transition count 1322
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 483 place count 616 transition count 1318
Iterating global reduction 6 with 4 rules applied. Total rules applied 487 place count 616 transition count 1318
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 491 place count 616 transition count 1314
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 495 place count 614 transition count 1315
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 7 with 14 rules applied. Total rules applied 509 place count 614 transition count 1301
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 7 with 15 rules applied. Total rules applied 524 place count 599 transition count 1301
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 525 place count 599 transition count 1300
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 543 place count 599 transition count 1300
Applied a total of 543 rules in 267 ms. Remains 599 /858 variables (removed 259) and now considering 1300/1567 (removed 267) transitions.
// Phase 1: matrix 1300 rows 599 cols
[2022-05-15 21:24:00] [INFO ] Computed 85 place invariants in 12 ms
[2022-05-15 21:24:01] [INFO ] Implicit Places using invariants in 371 ms returned [72, 89, 95, 98, 100, 103, 104, 156, 175, 181, 184, 186, 191, 192, 262, 268, 271, 273, 279, 280, 350, 356, 359, 361, 368, 369, 421, 438, 444, 447, 449, 454, 455, 507, 524, 530, 533, 535]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 373 ms to find 38 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 561/929 places, 1300/1567 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 543 transition count 1282
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 543 transition count 1282
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 537 transition count 1276
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 537 transition count 1276
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 68 place count 527 transition count 1266
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 86 place count 527 transition count 1248
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 104 place count 509 transition count 1248
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 108 place count 509 transition count 1244
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 112 place count 505 transition count 1244
Applied a total of 112 rules in 96 ms. Remains 505 /561 variables (removed 56) and now considering 1244/1300 (removed 56) transitions.
// Phase 1: matrix 1244 rows 505 cols
[2022-05-15 21:24:01] [INFO ] Computed 47 place invariants in 13 ms
[2022-05-15 21:24:01] [INFO ] Implicit Places using invariants in 263 ms returned []
// Phase 1: matrix 1244 rows 505 cols
[2022-05-15 21:24:01] [INFO ] Computed 47 place invariants in 7 ms
[2022-05-15 21:24:02] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 505/929 places, 1244/1567 transitions.
Finished structural reductions, in 3 iterations. Remains : 505/929 places, 1244/1567 transitions.
Successfully produced net in file /tmp/petri1000_13216830884775761609.dot
Successfully produced net in file /tmp/petri1001_12998637117508639804.dot
Successfully produced net in file /tmp/petri1002_12540085868787723321.dot
Successfully produced net in file /tmp/petri1003_4953536899259499134.dot
Successfully produced net in file /tmp/petri1004_316005002695049168.dot
Successfully produced net in file /tmp/petri1005_4305029539130873635.dot
Drop transitions removed 6 transitions
Dominated transitions for bounds rules discarded 6 transitions
// Phase 1: matrix 1238 rows 505 cols
[2022-05-15 21:24:02] [INFO ] Computed 47 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 17559 resets, run finished after 2008 ms. (steps per millisecond=498 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3799 resets, run finished after 629 ms. (steps per millisecond=1589 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3819 resets, run finished after 630 ms. (steps per millisecond=1587 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3735 resets, run finished after 773 ms. (steps per millisecond=1293 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3762 resets, run finished after 730 ms. (steps per millisecond=1369 ) properties (out of 4) seen :0
// Phase 1: matrix 1238 rows 505 cols
[2022-05-15 21:24:07] [INFO ] Computed 47 place invariants in 21 ms
[2022-05-15 21:24:07] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-15 21:24:07] [INFO ] [Real]Absence check using 13 positive and 34 generalized place invariants in 10 ms returned sat
[2022-05-15 21:24:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:07] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2022-05-15 21:24:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:24:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 21:24:07] [INFO ] [Nat]Absence check using 13 positive and 34 generalized place invariants in 8 ms returned sat
[2022-05-15 21:24:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:07] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2022-05-15 21:24:07] [INFO ] Computed and/alt/rep : 280/1264/280 causal constraints (skipped 925 transitions) in 70 ms.
[2022-05-15 21:24:08] [INFO ] Added : 21 causal constraints over 5 iterations in 656 ms. Result :sat
Minimization took 190 ms.
[2022-05-15 21:24:08] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-15 21:24:08] [INFO ] [Real]Absence check using 13 positive and 34 generalized place invariants in 10 ms returned sat
[2022-05-15 21:24:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:09] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2022-05-15 21:24:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:24:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-15 21:24:09] [INFO ] [Nat]Absence check using 13 positive and 34 generalized place invariants in 11 ms returned sat
[2022-05-15 21:24:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:09] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2022-05-15 21:24:09] [INFO ] Computed and/alt/rep : 280/1264/280 causal constraints (skipped 925 transitions) in 91 ms.
[2022-05-15 21:24:10] [INFO ] Added : 25 causal constraints over 6 iterations in 651 ms. Result :sat
Minimization took 293 ms.
[2022-05-15 21:24:10] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-15 21:24:10] [INFO ] [Real]Absence check using 13 positive and 34 generalized place invariants in 11 ms returned sat
[2022-05-15 21:24:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:11] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2022-05-15 21:24:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:24:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 21:24:11] [INFO ] [Nat]Absence check using 13 positive and 34 generalized place invariants in 8 ms returned sat
[2022-05-15 21:24:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:11] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2022-05-15 21:24:11] [INFO ] Computed and/alt/rep : 280/1264/280 causal constraints (skipped 925 transitions) in 72 ms.
[2022-05-15 21:24:12] [INFO ] Added : 23 causal constraints over 5 iterations in 689 ms. Result :sat
Minimization took 238 ms.
[2022-05-15 21:24:12] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-15 21:24:12] [INFO ] [Real]Absence check using 13 positive and 34 generalized place invariants in 12 ms returned sat
[2022-05-15 21:24:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:12] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2022-05-15 21:24:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:24:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 21:24:13] [INFO ] [Nat]Absence check using 13 positive and 34 generalized place invariants in 9 ms returned sat
[2022-05-15 21:24:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:13] [INFO ] [Nat]Absence check using state equation in 757 ms returned sat
[2022-05-15 21:24:14] [INFO ] Computed and/alt/rep : 280/1264/280 causal constraints (skipped 925 transitions) in 92 ms.
[2022-05-15 21:24:14] [INFO ] Added : 20 causal constraints over 5 iterations in 628 ms. Result :sat
Minimization took 280 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 505 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 505/505 places, 1238/1238 transitions.
Graph (complete) has 3030 edges and 505 vertex of which 499 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Discarding 6 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 499 transition count 1238
Applied a total of 7 rules in 49 ms. Remains 499 /505 variables (removed 6) and now considering 1238/1238 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 499/505 places, 1238/1238 transitions.
// Phase 1: matrix 1238 rows 499 cols
[2022-05-15 21:24:15] [INFO ] Computed 47 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 17683 resets, run finished after 2088 ms. (steps per millisecond=478 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3778 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3786 resets, run finished after 632 ms. (steps per millisecond=1582 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3797 resets, run finished after 632 ms. (steps per millisecond=1582 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3807 resets, run finished after 628 ms. (steps per millisecond=1592 ) properties (out of 4) seen :0
// Phase 1: matrix 1238 rows 499 cols
[2022-05-15 21:24:20] [INFO ] Computed 47 place invariants in 19 ms
[2022-05-15 21:24:20] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2022-05-15 21:24:20] [INFO ] [Real]Absence check using 13 positive and 34 generalized place invariants in 7 ms returned sat
[2022-05-15 21:24:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:20] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2022-05-15 21:24:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:24:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 21:24:20] [INFO ] [Nat]Absence check using 13 positive and 34 generalized place invariants in 9 ms returned sat
[2022-05-15 21:24:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:21] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2022-05-15 21:24:21] [INFO ] Computed and/alt/rep : 280/1262/280 causal constraints (skipped 925 transitions) in 70 ms.
[2022-05-15 21:24:21] [INFO ] Added : 17 causal constraints over 5 iterations in 379 ms. Result :sat
Minimization took 229 ms.
[2022-05-15 21:24:21] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 21:24:21] [INFO ] [Real]Absence check using 13 positive and 34 generalized place invariants in 18 ms returned sat
[2022-05-15 21:24:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:22] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2022-05-15 21:24:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:24:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 21:24:22] [INFO ] [Nat]Absence check using 13 positive and 34 generalized place invariants in 8 ms returned sat
[2022-05-15 21:24:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:22] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2022-05-15 21:24:22] [INFO ] Computed and/alt/rep : 280/1262/280 causal constraints (skipped 925 transitions) in 85 ms.
[2022-05-15 21:24:23] [INFO ] Added : 32 causal constraints over 7 iterations in 951 ms. Result :sat
Minimization took 240 ms.
[2022-05-15 21:24:24] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-15 21:24:24] [INFO ] [Real]Absence check using 13 positive and 34 generalized place invariants in 11 ms returned sat
[2022-05-15 21:24:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:24] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2022-05-15 21:24:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:24:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-15 21:24:24] [INFO ] [Nat]Absence check using 13 positive and 34 generalized place invariants in 11 ms returned sat
[2022-05-15 21:24:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:25] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2022-05-15 21:24:25] [INFO ] Computed and/alt/rep : 280/1262/280 causal constraints (skipped 925 transitions) in 69 ms.
[2022-05-15 21:24:25] [INFO ] Added : 19 causal constraints over 4 iterations in 448 ms. Result :sat
Minimization took 169 ms.
[2022-05-15 21:24:25] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-15 21:24:25] [INFO ] [Real]Absence check using 13 positive and 34 generalized place invariants in 11 ms returned sat
[2022-05-15 21:24:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:26] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2022-05-15 21:24:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:24:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-15 21:24:26] [INFO ] [Nat]Absence check using 13 positive and 34 generalized place invariants in 10 ms returned sat
[2022-05-15 21:24:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:26] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2022-05-15 21:24:26] [INFO ] Computed and/alt/rep : 280/1262/280 causal constraints (skipped 925 transitions) in 71 ms.
[2022-05-15 21:24:27] [INFO ] Added : 37 causal constraints over 8 iterations in 969 ms. Result :sat
Minimization took 300 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA ASLink-PT-06b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-06b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 499 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 499/499 places, 1238/1238 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 499 transition count 1237
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 498 transition count 1237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 497 transition count 1236
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 497 transition count 1236
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 497 transition count 1235
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 496 transition count 1234
Applied a total of 7 rules in 53 ms. Remains 496 /499 variables (removed 3) and now considering 1234/1238 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 496/499 places, 1234/1238 transitions.
// Phase 1: matrix 1234 rows 496 cols
[2022-05-15 21:24:28] [INFO ] Computed 47 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 17814 resets, run finished after 2321 ms. (steps per millisecond=430 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3802 resets, run finished after 627 ms. (steps per millisecond=1594 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3777 resets, run finished after 623 ms. (steps per millisecond=1605 ) properties (out of 2) seen :0
// Phase 1: matrix 1234 rows 496 cols
[2022-05-15 21:24:32] [INFO ] Computed 47 place invariants in 11 ms
[2022-05-15 21:24:32] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2022-05-15 21:24:32] [INFO ] [Real]Absence check using 11 positive and 36 generalized place invariants in 9 ms returned sat
[2022-05-15 21:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:32] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2022-05-15 21:24:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:24:32] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-15 21:24:32] [INFO ] [Nat]Absence check using 11 positive and 36 generalized place invariants in 11 ms returned sat
[2022-05-15 21:24:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:33] [INFO ] [Nat]Absence check using state equation in 456 ms returned sat
[2022-05-15 21:24:33] [INFO ] Computed and/alt/rep : 283/1319/283 causal constraints (skipped 918 transitions) in 70 ms.
[2022-05-15 21:24:33] [INFO ] Added : 27 causal constraints over 6 iterations in 675 ms. Result :sat
Minimization took 341 ms.
[2022-05-15 21:24:34] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2022-05-15 21:24:34] [INFO ] [Real]Absence check using 11 positive and 36 generalized place invariants in 11 ms returned sat
[2022-05-15 21:24:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:34] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2022-05-15 21:24:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:24:34] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2022-05-15 21:24:34] [INFO ] [Nat]Absence check using 11 positive and 36 generalized place invariants in 10 ms returned sat
[2022-05-15 21:24:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:35] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2022-05-15 21:24:35] [INFO ] Computed and/alt/rep : 283/1319/283 causal constraints (skipped 918 transitions) in 84 ms.
[2022-05-15 21:24:35] [INFO ] Added : 17 causal constraints over 4 iterations in 436 ms. Result :sat
Minimization took 250 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 496 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 496/496 places, 1234/1234 transitions.
Applied a total of 0 rules in 19 ms. Remains 496 /496 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 496/496 places, 1234/1234 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 496/496 places, 1234/1234 transitions.
Applied a total of 0 rules in 19 ms. Remains 496 /496 variables (removed 0) and now considering 1234/1234 (removed 0) transitions.
// Phase 1: matrix 1234 rows 496 cols
[2022-05-15 21:24:36] [INFO ] Computed 47 place invariants in 20 ms
[2022-05-15 21:24:36] [INFO ] Implicit Places using invariants in 364 ms returned [281]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 365 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 495/496 places, 1234/1234 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 494 transition count 1233
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 494 transition count 1232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 493 transition count 1232
Applied a total of 4 rules in 53 ms. Remains 493 /495 variables (removed 2) and now considering 1232/1234 (removed 2) transitions.
// Phase 1: matrix 1232 rows 493 cols
[2022-05-15 21:24:36] [INFO ] Computed 46 place invariants in 15 ms
[2022-05-15 21:24:37] [INFO ] Implicit Places using invariants in 319 ms returned []
// Phase 1: matrix 1232 rows 493 cols
[2022-05-15 21:24:37] [INFO ] Computed 46 place invariants in 9 ms
[2022-05-15 21:24:38] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1176 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 493/496 places, 1232/1234 transitions.
Finished structural reductions, in 2 iterations. Remains : 493/496 places, 1232/1234 transitions.
// Phase 1: matrix 1232 rows 493 cols
[2022-05-15 21:24:38] [INFO ] Computed 46 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 17862 resets, run finished after 2265 ms. (steps per millisecond=441 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3779 resets, run finished after 858 ms. (steps per millisecond=1165 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3759 resets, run finished after 871 ms. (steps per millisecond=1148 ) properties (out of 2) seen :0
// Phase 1: matrix 1232 rows 493 cols
[2022-05-15 21:24:42] [INFO ] Computed 46 place invariants in 20 ms
[2022-05-15 21:24:42] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-15 21:24:42] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 10 ms returned sat
[2022-05-15 21:24:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:42] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2022-05-15 21:24:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:24:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 21:24:42] [INFO ] [Nat]Absence check using 13 positive and 33 generalized place invariants in 9 ms returned sat
[2022-05-15 21:24:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:43] [INFO ] [Nat]Absence check using state equation in 501 ms returned sat
[2022-05-15 21:24:43] [INFO ] Computed and/alt/rep : 274/1246/274 causal constraints (skipped 925 transitions) in 68 ms.
[2022-05-15 21:24:44] [INFO ] Added : 53 causal constraints over 11 iterations in 1068 ms. Result :sat
Minimization took 265 ms.
[2022-05-15 21:24:44] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-15 21:24:44] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 11 ms returned sat
[2022-05-15 21:24:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:45] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2022-05-15 21:24:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:24:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-15 21:24:45] [INFO ] [Nat]Absence check using 13 positive and 33 generalized place invariants in 12 ms returned sat
[2022-05-15 21:24:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:45] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2022-05-15 21:24:45] [INFO ] Computed and/alt/rep : 274/1246/274 causal constraints (skipped 925 transitions) in 98 ms.
[2022-05-15 21:24:46] [INFO ] Added : 22 causal constraints over 5 iterations in 807 ms. Result :sat
Minimization took 215 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 493 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 493/493 places, 1232/1232 transitions.
Applied a total of 0 rules in 20 ms. Remains 493 /493 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 493/493 places, 1232/1232 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 493/493 places, 1232/1232 transitions.
Applied a total of 0 rules in 19 ms. Remains 493 /493 variables (removed 0) and now considering 1232/1232 (removed 0) transitions.
// Phase 1: matrix 1232 rows 493 cols
[2022-05-15 21:24:47] [INFO ] Computed 46 place invariants in 19 ms
[2022-05-15 21:24:47] [INFO ] Implicit Places using invariants in 347 ms returned []
// Phase 1: matrix 1232 rows 493 cols
[2022-05-15 21:24:47] [INFO ] Computed 46 place invariants in 9 ms
[2022-05-15 21:24:48] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 1246 ms to find 0 implicit places.
[2022-05-15 21:24:48] [INFO ] Redundant transitions in 62 ms returned []
// Phase 1: matrix 1232 rows 493 cols
[2022-05-15 21:24:48] [INFO ] Computed 46 place invariants in 9 ms
[2022-05-15 21:24:49] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 493/493 places, 1232/1232 transitions.
Starting property specific reduction for ASLink-PT-06b-UpperBounds-05
// Phase 1: matrix 1232 rows 493 cols
[2022-05-15 21:24:49] [INFO ] Computed 46 place invariants in 10 ms
Incomplete random walk after 10000 steps, including 158 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 1232 rows 493 cols
[2022-05-15 21:24:49] [INFO ] Computed 46 place invariants in 10 ms
[2022-05-15 21:24:49] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 21:24:49] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 7 ms returned sat
[2022-05-15 21:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:49] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2022-05-15 21:24:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:24:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2022-05-15 21:24:49] [INFO ] [Nat]Absence check using 13 positive and 33 generalized place invariants in 6 ms returned sat
[2022-05-15 21:24:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:49] [INFO ] [Nat]Absence check using state equation in 388 ms returned sat
[2022-05-15 21:24:49] [INFO ] Computed and/alt/rep : 274/1246/274 causal constraints (skipped 925 transitions) in 68 ms.
[2022-05-15 21:24:50] [INFO ] Added : 53 causal constraints over 11 iterations in 1078 ms. Result :sat
Minimization took 262 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 493 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 493/493 places, 1232/1232 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 1 rules applied. Total rules applied 1 place count 493 transition count 1231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 492 transition count 1231
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 491 transition count 1230
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 491 transition count 1230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 491 transition count 1229
Applied a total of 5 rules in 38 ms. Remains 491 /493 variables (removed 2) and now considering 1229/1232 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 491/493 places, 1229/1232 transitions.
// Phase 1: matrix 1229 rows 491 cols
[2022-05-15 21:24:51] [INFO ] Computed 46 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 17669 resets, run finished after 2077 ms. (steps per millisecond=481 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3762 resets, run finished after 619 ms. (steps per millisecond=1615 ) properties (out of 1) seen :0
// Phase 1: matrix 1229 rows 491 cols
[2022-05-15 21:24:54] [INFO ] Computed 46 place invariants in 19 ms
[2022-05-15 21:24:54] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-15 21:24:54] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 11 ms returned sat
[2022-05-15 21:24:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:54] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2022-05-15 21:24:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:24:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2022-05-15 21:24:54] [INFO ] [Nat]Absence check using 13 positive and 33 generalized place invariants in 9 ms returned sat
[2022-05-15 21:24:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:24:55] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2022-05-15 21:24:55] [INFO ] Computed and/alt/rep : 278/1290/278 causal constraints (skipped 918 transitions) in 72 ms.
[2022-05-15 21:24:56] [INFO ] Added : 52 causal constraints over 11 iterations in 1656 ms. Result :sat
Minimization took 318 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 491 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 491/491 places, 1229/1229 transitions.
Applied a total of 0 rules in 19 ms. Remains 491 /491 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 491/491 places, 1229/1229 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 491/491 places, 1229/1229 transitions.
Applied a total of 0 rules in 19 ms. Remains 491 /491 variables (removed 0) and now considering 1229/1229 (removed 0) transitions.
// Phase 1: matrix 1229 rows 491 cols
[2022-05-15 21:24:57] [INFO ] Computed 46 place invariants in 18 ms
[2022-05-15 21:24:57] [INFO ] Implicit Places using invariants in 355 ms returned [208]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 357 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 490/491 places, 1229/1229 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 489 transition count 1228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 489 transition count 1227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 488 transition count 1227
Applied a total of 4 rules in 54 ms. Remains 488 /490 variables (removed 2) and now considering 1227/1229 (removed 2) transitions.
// Phase 1: matrix 1227 rows 488 cols
[2022-05-15 21:24:58] [INFO ] Computed 45 place invariants in 11 ms
[2022-05-15 21:24:58] [INFO ] Implicit Places using invariants in 315 ms returned []
// Phase 1: matrix 1227 rows 488 cols
[2022-05-15 21:24:58] [INFO ] Computed 45 place invariants in 14 ms
[2022-05-15 21:24:59] [INFO ] Implicit Places using invariants and state equation in 1177 ms returned []
Implicit Place search using SMT with State Equation took 1507 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 488/491 places, 1227/1229 transitions.
Finished structural reductions, in 2 iterations. Remains : 488/491 places, 1227/1229 transitions.
// Phase 1: matrix 1227 rows 488 cols
[2022-05-15 21:24:59] [INFO ] Computed 45 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 17836 resets, run finished after 2282 ms. (steps per millisecond=438 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3823 resets, run finished after 617 ms. (steps per millisecond=1620 ) properties (out of 1) seen :0
// Phase 1: matrix 1227 rows 488 cols
[2022-05-15 21:25:02] [INFO ] Computed 45 place invariants in 19 ms
[2022-05-15 21:25:02] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-15 21:25:02] [INFO ] [Real]Absence check using 13 positive and 32 generalized place invariants in 9 ms returned sat
[2022-05-15 21:25:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:25:02] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2022-05-15 21:25:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:25:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2022-05-15 21:25:02] [INFO ] [Nat]Absence check using 13 positive and 32 generalized place invariants in 6 ms returned sat
[2022-05-15 21:25:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:25:03] [INFO ] [Nat]Absence check using state equation in 476 ms returned sat
[2022-05-15 21:25:03] [INFO ] Computed and/alt/rep : 269/1217/269 causal constraints (skipped 925 transitions) in 75 ms.
[2022-05-15 21:25:04] [INFO ] Added : 33 causal constraints over 7 iterations in 741 ms. Result :sat
Minimization took 230 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 488 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 488/488 places, 1227/1227 transitions.
Applied a total of 0 rules in 19 ms. Remains 488 /488 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 488/488 places, 1227/1227 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 488/488 places, 1227/1227 transitions.
Applied a total of 0 rules in 19 ms. Remains 488 /488 variables (removed 0) and now considering 1227/1227 (removed 0) transitions.
// Phase 1: matrix 1227 rows 488 cols
[2022-05-15 21:25:04] [INFO ] Computed 45 place invariants in 17 ms
[2022-05-15 21:25:04] [INFO ] Implicit Places using invariants in 332 ms returned []
// Phase 1: matrix 1227 rows 488 cols
[2022-05-15 21:25:04] [INFO ] Computed 45 place invariants in 9 ms
[2022-05-15 21:25:06] [INFO ] Implicit Places using invariants and state equation in 1077 ms returned []
Implicit Place search using SMT with State Equation took 1409 ms to find 0 implicit places.
[2022-05-15 21:25:06] [INFO ] Redundant transitions in 66 ms returned []
// Phase 1: matrix 1227 rows 488 cols
[2022-05-15 21:25:06] [INFO ] Computed 45 place invariants in 17 ms
[2022-05-15 21:25:06] [INFO ] Dead Transitions using invariants and state equation in 490 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 488/488 places, 1227/1227 transitions.
Ending property specific reduction for ASLink-PT-06b-UpperBounds-05 in 17529 ms.
Starting property specific reduction for ASLink-PT-06b-UpperBounds-09
// Phase 1: matrix 1232 rows 493 cols
[2022-05-15 21:25:06] [INFO ] Computed 46 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 190 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 1232 rows 493 cols
[2022-05-15 21:25:06] [INFO ] Computed 46 place invariants in 10 ms
[2022-05-15 21:25:06] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2022-05-15 21:25:06] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 9 ms returned sat
[2022-05-15 21:25:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:25:06] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2022-05-15 21:25:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:25:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2022-05-15 21:25:07] [INFO ] [Nat]Absence check using 13 positive and 33 generalized place invariants in 7 ms returned sat
[2022-05-15 21:25:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:25:07] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2022-05-15 21:25:07] [INFO ] Computed and/alt/rep : 274/1246/274 causal constraints (skipped 925 transitions) in 75 ms.
[2022-05-15 21:25:08] [INFO ] Added : 22 causal constraints over 5 iterations in 662 ms. Result :sat
Minimization took 183 ms.
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 493 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 493/493 places, 1232/1232 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 1 rules applied. Total rules applied 1 place count 493 transition count 1231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 492 transition count 1231
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 492 transition count 1230
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 491 transition count 1230
Applied a total of 4 rules in 28 ms. Remains 491 /493 variables (removed 2) and now considering 1230/1232 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 491/493 places, 1230/1232 transitions.
// Phase 1: matrix 1230 rows 491 cols
[2022-05-15 21:25:08] [INFO ] Computed 46 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 17679 resets, run finished after 2233 ms. (steps per millisecond=447 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3783 resets, run finished after 619 ms. (steps per millisecond=1615 ) properties (out of 1) seen :0
// Phase 1: matrix 1230 rows 491 cols
[2022-05-15 21:25:11] [INFO ] Computed 46 place invariants in 19 ms
[2022-05-15 21:25:11] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2022-05-15 21:25:11] [INFO ] [Real]Absence check using 13 positive and 33 generalized place invariants in 14 ms returned sat
[2022-05-15 21:25:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 21:25:11] [INFO ] [Real]Absence check using state equation in 308 ms returned sat
[2022-05-15 21:25:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 21:25:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2022-05-15 21:25:11] [INFO ] [Nat]Absence check using 13 positive and 33 generalized place invariants in 11 ms returned sat
[2022-05-15 21:25:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 21:25:12] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2022-05-15 21:25:12] [INFO ] Computed and/alt/rep : 272/1244/272 causal constraints (skipped 925 transitions) in 57 ms.
[2022-05-15 21:25:12] [INFO ] Added : 14 causal constraints over 3 iterations in 302 ms. Result :sat
Minimization took 131 ms.
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 491 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 491/491 places, 1230/1230 transitions.
Applied a total of 0 rules in 19 ms. Remains 491 /491 variables (removed 0) and now considering 1230/1230 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 491/491 places, 1230/1230 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 491/491 places, 1230/1230 transitions.
Applied a total of 0 rules in 20 ms. Remains 491 /491 variables (removed 0) and now considering 1230/1230 (removed 0) transitions.
// Phase 1: matrix 1230 rows 491 cols
[2022-05-15 21:25:12] [INFO ] Computed 46 place invariants in 18 ms
[2022-05-15 21:25:13] [INFO ] Implicit Places using invariants in 334 ms returned []
// Phase 1: matrix 1230 rows 491 cols
[2022-05-15 21:25:13] [INFO ] Computed 46 place invariants in 8 ms
[2022-05-15 21:25:14] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1254 ms to find 0 implicit places.
[2022-05-15 21:25:14] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 1230 rows 491 cols
[2022-05-15 21:25:14] [INFO ] Computed 46 place invariants in 7 ms
[2022-05-15 21:25:14] [INFO ] Dead Transitions using invariants and state equation in 386 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 491/491 places, 1230/1230 transitions.
Ending property specific reduction for ASLink-PT-06b-UpperBounds-09 in 8035 ms.
[2022-05-15 21:25:14] [INFO ] Flatten gal took : 133 ms
[2022-05-15 21:25:14] [INFO ] Applying decomposition
[2022-05-15 21:25:15] [INFO ] Flatten gal took : 71 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7823400822917800278.txt' '-o' '/tmp/graph7823400822917800278.bin' '-w' '/tmp/graph7823400822917800278.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7823400822917800278.bin' '-l' '-1' '-v' '-w' '/tmp/graph7823400822917800278.weights' '-q' '0' '-e' '0.001'
[2022-05-15 21:25:15] [INFO ] Decomposing Gal with order
[2022-05-15 21:25:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:25:15] [INFO ] Removed a total of 2394 redundant transitions.
[2022-05-15 21:25:15] [INFO ] Flatten gal took : 200 ms
[2022-05-15 21:25:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 32 ms.
[2022-05-15 21:25:15] [INFO ] Time to serialize gal into /tmp/UpperBounds8616408863785020517.gal : 32 ms
[2022-05-15 21:25:15] [INFO ] Time to serialize properties into /tmp/UpperBounds13488040874941795332.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8616408863785020517.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13488040874941795332.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds13488040874941795332.prop.
Detected timeout of ITS tools.
[2022-05-15 21:46:40] [INFO ] Applying decomposition
[2022-05-15 21:46:40] [INFO ] Flatten gal took : 73 ms
[2022-05-15 21:46:40] [INFO ] Decomposing Gal with order
[2022-05-15 21:46:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 21:46:40] [INFO ] Removed a total of 2298 redundant transitions.
[2022-05-15 21:46:40] [INFO ] Flatten gal took : 152 ms
[2022-05-15 21:46:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 962 labels/synchronizations in 33 ms.
[2022-05-15 21:46:40] [INFO ] Time to serialize gal into /tmp/UpperBounds16899244003968388336.gal : 5 ms
[2022-05-15 21:46:40] [INFO ] Time to serialize properties into /tmp/UpperBounds3688215194957998264.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16899244003968388336.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3688215194957998264.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds3688215194957998264.prop.
Detected timeout of ITS tools.
[2022-05-15 22:08:05] [INFO ] Flatten gal took : 82 ms
[2022-05-15 22:08:05] [INFO ] Input system was already deterministic with 1232 transitions.
[2022-05-15 22:08:05] [INFO ] Transformed 493 places.
[2022-05-15 22:08:05] [INFO ] Transformed 1232 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-15 22:08:05] [INFO ] Time to serialize gal into /tmp/UpperBounds12598767552064810651.gal : 10 ms
[2022-05-15 22:08:05] [INFO ] Time to serialize properties into /tmp/UpperBounds1726549550592364498.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12598767552064810651.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1726549550592364498.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...341
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds1726549550592364498.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="ASLink-PT-06b"
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 ASLink-PT-06b, 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 r006-tajo-165245688800101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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