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-165245688900165.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-10b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245688900165
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 6.3K Apr 30 07:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 30 07:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 30 07:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K 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 4.0K May 9 07:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 07:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:01 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 1.4M 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-10b-UpperBounds-00
FORMULA_NAME ASLink-PT-10b-UpperBounds-01
FORMULA_NAME ASLink-PT-10b-UpperBounds-02
FORMULA_NAME ASLink-PT-10b-UpperBounds-03
FORMULA_NAME ASLink-PT-10b-UpperBounds-04
FORMULA_NAME ASLink-PT-10b-UpperBounds-05
FORMULA_NAME ASLink-PT-10b-UpperBounds-06
FORMULA_NAME ASLink-PT-10b-UpperBounds-07
FORMULA_NAME ASLink-PT-10b-UpperBounds-08
FORMULA_NAME ASLink-PT-10b-UpperBounds-09
FORMULA_NAME ASLink-PT-10b-UpperBounds-10
FORMULA_NAME ASLink-PT-10b-UpperBounds-11
FORMULA_NAME ASLink-PT-10b-UpperBounds-12
FORMULA_NAME ASLink-PT-10b-UpperBounds-13
FORMULA_NAME ASLink-PT-10b-UpperBounds-14
FORMULA_NAME ASLink-PT-10b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652656933420

Running Version 202205111006
[2022-05-15 23:22:14] [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 23:22:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 23:22:14] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2022-05-15 23:22:14] [INFO ] Transformed 4410 places.
[2022-05-15 23:22:14] [INFO ] Transformed 5405 transitions.
[2022-05-15 23:22:14] [INFO ] Found NUPN structural information;
[2022-05-15 23:22:15] [INFO ] Parsed PT model containing 4410 places and 5405 transitions in 394 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 5405 rows 4410 cols
[2022-05-15 23:22:15] [INFO ] Computed 433 place invariants in 229 ms
Incomplete random walk after 10000 steps, including 14 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 16) seen :8
FORMULA ASLink-PT-10b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
// Phase 1: matrix 5405 rows 4410 cols
[2022-05-15 23:22:15] [INFO ] Computed 433 place invariants in 191 ms
[2022-05-15 23:22:16] [INFO ] [Real]Absence check using 102 positive place invariants in 142 ms returned sat
[2022-05-15 23:22:16] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 162 ms returned sat
[2022-05-15 23:22:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:22:19] [INFO ] [Real]Absence check using state equation in 3015 ms returned sat
[2022-05-15 23:22:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:22:20] [INFO ] [Nat]Absence check using 102 positive place invariants in 116 ms returned sat
[2022-05-15 23:22:21] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 121 ms returned sat
[2022-05-15 23:22:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:22:25] [INFO ] [Nat]Absence check using state equation in 4181 ms returned unknown
[2022-05-15 23:22:25] [INFO ] [Real]Absence check using 102 positive place invariants in 84 ms returned sat
[2022-05-15 23:22:26] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 128 ms returned sat
[2022-05-15 23:22:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:22:29] [INFO ] [Real]Absence check using state equation in 3363 ms returned sat
[2022-05-15 23:22:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:22:30] [INFO ] [Nat]Absence check using 102 positive place invariants in 127 ms returned sat
[2022-05-15 23:22:30] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 144 ms returned sat
[2022-05-15 23:22:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:22:34] [INFO ] [Nat]Absence check using state equation in 4104 ms returned unknown
[2022-05-15 23:22:35] [INFO ] [Real]Absence check using 102 positive place invariants in 186 ms returned sat
[2022-05-15 23:22:35] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 162 ms returned sat
[2022-05-15 23:22:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:22:38] [INFO ] [Real]Absence check using state equation in 3041 ms returned sat
[2022-05-15 23:22:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:22:39] [INFO ] [Nat]Absence check using 102 positive place invariants in 85 ms returned sat
[2022-05-15 23:22:39] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 118 ms returned sat
[2022-05-15 23:22:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:22:43] [INFO ] [Nat]Absence check using state equation in 4243 ms returned unknown
[2022-05-15 23:22:44] [INFO ] [Real]Absence check using 102 positive place invariants in 93 ms returned sat
[2022-05-15 23:22:44] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 120 ms returned sat
[2022-05-15 23:22:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:22:47] [INFO ] [Real]Absence check using state equation in 2550 ms returned sat
[2022-05-15 23:22:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:22:48] [INFO ] [Nat]Absence check using 102 positive place invariants in 114 ms returned sat
[2022-05-15 23:22:48] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 142 ms returned sat
[2022-05-15 23:22:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:22:52] [INFO ] [Nat]Absence check using state equation in 4039 ms returned unknown
[2022-05-15 23:22:53] [INFO ] [Real]Absence check using 102 positive place invariants in 88 ms returned sat
[2022-05-15 23:22:53] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 202 ms returned sat
[2022-05-15 23:22:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:22:57] [INFO ] [Real]Absence check using state equation in 3677 ms returned sat
[2022-05-15 23:22:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:22:58] [INFO ] [Nat]Absence check using 102 positive place invariants in 115 ms returned sat
[2022-05-15 23:22:58] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 174 ms returned sat
[2022-05-15 23:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:23:02] [INFO ] [Nat]Absence check using state equation in 4016 ms returned unknown
[2022-05-15 23:23:03] [INFO ] [Real]Absence check using 102 positive place invariants in 152 ms returned sat
[2022-05-15 23:23:03] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 198 ms returned sat
[2022-05-15 23:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:23:07] [INFO ] [Real]Absence check using state equation in 3868 ms returned unknown
[2022-05-15 23:23:08] [INFO ] [Real]Absence check using 102 positive place invariants in 87 ms returned sat
[2022-05-15 23:23:08] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 119 ms returned sat
[2022-05-15 23:23:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:23:11] [INFO ] [Real]Absence check using state equation in 2923 ms returned sat
[2022-05-15 23:23:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:23:12] [INFO ] [Nat]Absence check using 102 positive place invariants in 88 ms returned sat
[2022-05-15 23:23:12] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 115 ms returned sat
[2022-05-15 23:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:23:16] [INFO ] [Nat]Absence check using state equation in 4145 ms returned unknown
[2022-05-15 23:23:17] [INFO ] [Real]Absence check using 102 positive place invariants in 113 ms returned sat
[2022-05-15 23:23:17] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 156 ms returned sat
[2022-05-15 23:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:23:20] [INFO ] [Real]Absence check using state equation in 3011 ms returned sat
[2022-05-15 23:23:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:23:21] [INFO ] [Nat]Absence check using 102 positive place invariants in 84 ms returned sat
[2022-05-15 23:23:21] [INFO ] [Nat]Absence check using 102 positive and 331 generalized place invariants in 114 ms returned sat
[2022-05-15 23:23:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:23:25] [INFO ] [Nat]Absence check using state equation in 4150 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 4410 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4410/4410 places, 5405/5405 transitions.
Drop transitions removed 1026 transitions
Trivial Post-agglo rules discarded 1026 transitions
Performed 1026 trivial Post agglomeration. Transition count delta: 1026
Iterating post reduction 0 with 1026 rules applied. Total rules applied 1026 place count 4410 transition count 4379
Reduce places removed 1026 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 1072 rules applied. Total rules applied 2098 place count 3384 transition count 4333
Reduce places removed 12 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 16 rules applied. Total rules applied 2114 place count 3372 transition count 4329
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 2118 place count 3368 transition count 4329
Performed 1023 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1023 Pre rules applied. Total rules applied 2118 place count 3368 transition count 3306
Deduced a syphon composed of 1023 places in 28 ms
Ensure Unique test removed 101 places
Reduce places removed 1124 places and 0 transitions.
Iterating global reduction 4 with 2147 rules applied. Total rules applied 4265 place count 2244 transition count 3306
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 4 with 73 rules applied. Total rules applied 4338 place count 2234 transition count 3243
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 5 with 63 rules applied. Total rules applied 4401 place count 2171 transition count 3243
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 38 Pre rules applied. Total rules applied 4401 place count 2171 transition count 3205
Deduced a syphon composed of 38 places in 22 ms
Ensure Unique test removed 37 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 6 with 113 rules applied. Total rules applied 4514 place count 2096 transition count 3205
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 37 Pre rules applied. Total rules applied 4514 place count 2096 transition count 3168
Deduced a syphon composed of 37 places in 33 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 4588 place count 2059 transition count 3168
Discarding 141 places :
Symmetric choice reduction at 6 with 141 rule applications. Total rules 4729 place count 1918 transition count 3027
Iterating global reduction 6 with 141 rules applied. Total rules applied 4870 place count 1918 transition count 3027
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4871 place count 1918 transition count 3026
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 46 Pre rules applied. Total rules applied 4871 place count 1918 transition count 2980
Deduced a syphon composed of 46 places in 7 ms
Ensure Unique test removed 1 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 7 with 93 rules applied. Total rules applied 4964 place count 1871 transition count 2980
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4964 place count 1871 transition count 2979
Deduced a syphon composed of 1 places in 7 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 4967 place count 1869 transition count 2979
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 4978 place count 1858 transition count 2910
Iterating global reduction 7 with 11 rules applied. Total rules applied 4989 place count 1858 transition count 2910
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 4989 place count 1858 transition count 2901
Deduced a syphon composed of 9 places in 7 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 5007 place count 1849 transition count 2901
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5008 place count 1848 transition count 2893
Iterating global reduction 7 with 1 rules applied. Total rules applied 5009 place count 1848 transition count 2893
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5010 place count 1847 transition count 2885
Iterating global reduction 7 with 1 rules applied. Total rules applied 5011 place count 1847 transition count 2885
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5012 place count 1846 transition count 2877
Iterating global reduction 7 with 1 rules applied. Total rules applied 5013 place count 1846 transition count 2877
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5014 place count 1845 transition count 2869
Iterating global reduction 7 with 1 rules applied. Total rules applied 5015 place count 1845 transition count 2869
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5016 place count 1844 transition count 2861
Iterating global reduction 7 with 1 rules applied. Total rules applied 5017 place count 1844 transition count 2861
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5018 place count 1843 transition count 2853
Iterating global reduction 7 with 1 rules applied. Total rules applied 5019 place count 1843 transition count 2853
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5020 place count 1842 transition count 2845
Iterating global reduction 7 with 1 rules applied. Total rules applied 5021 place count 1842 transition count 2845
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5022 place count 1841 transition count 2837
Iterating global reduction 7 with 1 rules applied. Total rules applied 5023 place count 1841 transition count 2837
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5024 place count 1840 transition count 2829
Iterating global reduction 7 with 1 rules applied. Total rules applied 5025 place count 1840 transition count 2829
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5026 place count 1839 transition count 2821
Iterating global reduction 7 with 1 rules applied. Total rules applied 5027 place count 1839 transition count 2821
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5028 place count 1838 transition count 2813
Iterating global reduction 7 with 1 rules applied. Total rules applied 5029 place count 1838 transition count 2813
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5030 place count 1837 transition count 2805
Iterating global reduction 7 with 1 rules applied. Total rules applied 5031 place count 1837 transition count 2805
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5032 place count 1836 transition count 2797
Iterating global reduction 7 with 1 rules applied. Total rules applied 5033 place count 1836 transition count 2797
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5034 place count 1835 transition count 2789
Iterating global reduction 7 with 1 rules applied. Total rules applied 5035 place count 1835 transition count 2789
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5036 place count 1834 transition count 2781
Iterating global reduction 7 with 1 rules applied. Total rules applied 5037 place count 1834 transition count 2781
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5038 place count 1833 transition count 2773
Iterating global reduction 7 with 1 rules applied. Total rules applied 5039 place count 1833 transition count 2773
Performed 264 Post agglomeration using F-continuation condition.Transition count delta: 264
Deduced a syphon composed of 264 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 266 places and 0 transitions.
Iterating global reduction 7 with 530 rules applied. Total rules applied 5569 place count 1567 transition count 2509
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5570 place count 1566 transition count 2508
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 5572 place count 1565 transition count 2508
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5573 place count 1564 transition count 2507
Iterating global reduction 7 with 1 rules applied. Total rules applied 5574 place count 1564 transition count 2507
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 5576 place count 1564 transition count 2505
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 5577 place count 1563 transition count 2505
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 5579 place count 1562 transition count 2514
Free-agglomeration rule applied 11 times.
Iterating global reduction 9 with 11 rules applied. Total rules applied 5590 place count 1562 transition count 2503
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 5601 place count 1551 transition count 2503
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 5611 place count 1551 transition count 2493
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 5621 place count 1541 transition count 2493
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 5622 place count 1540 transition count 2492
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 11 with 30 rules applied. Total rules applied 5652 place count 1520 transition count 2482
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 12 with 10 rules applied. Total rules applied 5662 place count 1510 transition count 2482
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 29 Pre rules applied. Total rules applied 5662 place count 1510 transition count 2453
Deduced a syphon composed of 29 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 13 with 59 rules applied. Total rules applied 5721 place count 1480 transition count 2453
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 13 with 11 rules applied. Total rules applied 5732 place count 1469 transition count 2453
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 5732 place count 1469 transition count 2452
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 5734 place count 1468 transition count 2452
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 5 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 14 with 42 rules applied. Total rules applied 5776 place count 1447 transition count 2431
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 5785 place count 1438 transition count 2422
Iterating global reduction 14 with 9 rules applied. Total rules applied 5794 place count 1438 transition count 2422
Free-agglomeration rule applied 10 times.
Iterating global reduction 14 with 10 rules applied. Total rules applied 5804 place count 1438 transition count 2412
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 14 with 10 rules applied. Total rules applied 5814 place count 1428 transition count 2412
Applied a total of 5814 rules in 3071 ms. Remains 1428 /4410 variables (removed 2982) and now considering 2412/5405 (removed 2993) transitions.
Finished structural reductions, in 1 iterations. Remains : 1428/4410 places, 2412/5405 transitions.
// Phase 1: matrix 2412 rows 1428 cols
[2022-05-15 23:23:29] [INFO ] Computed 248 place invariants in 23 ms
Incomplete random walk after 1000000 steps, including 9454 resets, run finished after 3664 ms. (steps per millisecond=272 ) properties (out of 8) seen :2
FORMULA ASLink-PT-10b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 911 resets, run finished after 1732 ms. (steps per millisecond=577 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 925 resets, run finished after 1730 ms. (steps per millisecond=578 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 922 resets, run finished after 1497 ms. (steps per millisecond=668 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 925 resets, run finished after 1506 ms. (steps per millisecond=664 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 927 resets, run finished after 1771 ms. (steps per millisecond=564 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 914 resets, run finished after 2031 ms. (steps per millisecond=492 ) properties (out of 6) seen :0
// Phase 1: matrix 2412 rows 1428 cols
[2022-05-15 23:23:43] [INFO ] Computed 248 place invariants in 32 ms
[2022-05-15 23:23:43] [INFO ] [Real]Absence check using 60 positive place invariants in 27 ms returned sat
[2022-05-15 23:23:43] [INFO ] [Real]Absence check using 60 positive and 188 generalized place invariants in 62 ms returned sat
[2022-05-15 23:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:23:44] [INFO ] [Real]Absence check using state equation in 855 ms returned sat
[2022-05-15 23:23:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:23:44] [INFO ] [Nat]Absence check using 60 positive place invariants in 46 ms returned sat
[2022-05-15 23:23:44] [INFO ] [Nat]Absence check using 60 positive and 188 generalized place invariants in 57 ms returned sat
[2022-05-15 23:23:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:23:45] [INFO ] [Nat]Absence check using state equation in 1123 ms returned sat
[2022-05-15 23:23:46] [INFO ] Computed and/alt/rep : 965/3710/965 causal constraints (skipped 1398 transitions) in 167 ms.
[2022-05-15 23:24:06] [INFO ] Added : 545 causal constraints over 109 iterations in 20107 ms.(timeout) Result :sat
Minimization took 1463 ms.
[2022-05-15 23:24:07] [INFO ] [Real]Absence check using 60 positive place invariants in 36 ms returned sat
[2022-05-15 23:24:07] [INFO ] [Real]Absence check using 60 positive and 188 generalized place invariants in 42 ms returned sat
[2022-05-15 23:24:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:24:08] [INFO ] [Real]Absence check using state equation in 657 ms returned sat
[2022-05-15 23:24:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:24:08] [INFO ] [Nat]Absence check using 60 positive place invariants in 43 ms returned sat
[2022-05-15 23:24:08] [INFO ] [Nat]Absence check using 60 positive and 188 generalized place invariants in 58 ms returned sat
[2022-05-15 23:24:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:24:09] [INFO ] [Nat]Absence check using state equation in 953 ms returned sat
[2022-05-15 23:24:10] [INFO ] Computed and/alt/rep : 965/3710/965 causal constraints (skipped 1398 transitions) in 183 ms.
[2022-05-15 23:24:30] [INFO ] Added : 565 causal constraints over 113 iterations in 20132 ms.(timeout) Result :sat
Minimization took 1609 ms.
[2022-05-15 23:24:32] [INFO ] [Real]Absence check using 60 positive place invariants in 23 ms returned sat
[2022-05-15 23:24:32] [INFO ] [Real]Absence check using 60 positive and 188 generalized place invariants in 47 ms returned sat
[2022-05-15 23:24:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:24:32] [INFO ] [Real]Absence check using state equation in 908 ms returned sat
[2022-05-15 23:24:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:24:33] [INFO ] [Nat]Absence check using 60 positive place invariants in 19 ms returned sat
[2022-05-15 23:24:33] [INFO ] [Nat]Absence check using 60 positive and 188 generalized place invariants in 35 ms returned sat
[2022-05-15 23:24:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:24:34] [INFO ] [Nat]Absence check using state equation in 897 ms returned sat
[2022-05-15 23:24:34] [INFO ] Computed and/alt/rep : 965/3710/965 causal constraints (skipped 1398 transitions) in 164 ms.
[2022-05-15 23:24:54] [INFO ] Added : 580 causal constraints over 116 iterations in 20207 ms.(timeout) Result :sat
Minimization took 2405 ms.
[2022-05-15 23:24:57] [INFO ] [Real]Absence check using 60 positive place invariants in 22 ms returned sat
[2022-05-15 23:24:57] [INFO ] [Real]Absence check using 60 positive and 188 generalized place invariants in 51 ms returned sat
[2022-05-15 23:24:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:24:57] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2022-05-15 23:24:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:24:58] [INFO ] [Nat]Absence check using 60 positive place invariants in 17 ms returned sat
[2022-05-15 23:24:58] [INFO ] [Nat]Absence check using 60 positive and 188 generalized place invariants in 34 ms returned sat
[2022-05-15 23:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:24:59] [INFO ] [Nat]Absence check using state equation in 1043 ms returned sat
[2022-05-15 23:24:59] [INFO ] Computed and/alt/rep : 965/3710/965 causal constraints (skipped 1398 transitions) in 173 ms.
[2022-05-15 23:25:19] [INFO ] Added : 585 causal constraints over 117 iterations in 20063 ms.(timeout) Result :sat
Minimization took 1084 ms.
[2022-05-15 23:25:20] [INFO ] [Real]Absence check using 60 positive place invariants in 16 ms returned sat
[2022-05-15 23:25:20] [INFO ] [Real]Absence check using 60 positive and 188 generalized place invariants in 33 ms returned sat
[2022-05-15 23:25:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:25:21] [INFO ] [Real]Absence check using state equation in 775 ms returned sat
[2022-05-15 23:25:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:25:21] [INFO ] [Nat]Absence check using 60 positive place invariants in 23 ms returned sat
[2022-05-15 23:25:21] [INFO ] [Nat]Absence check using 60 positive and 188 generalized place invariants in 46 ms returned sat
[2022-05-15 23:25:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:25:23] [INFO ] [Nat]Absence check using state equation in 1996 ms returned sat
[2022-05-15 23:25:24] [INFO ] Computed and/alt/rep : 965/3710/965 causal constraints (skipped 1398 transitions) in 134 ms.
[2022-05-15 23:25:33] [INFO ] Added : 234 causal constraints over 47 iterations in 9806 ms. Result :sat
Minimization took 1105 ms.
[2022-05-15 23:25:35] [INFO ] [Real]Absence check using 60 positive place invariants in 17 ms returned sat
[2022-05-15 23:25:35] [INFO ] [Real]Absence check using 60 positive and 188 generalized place invariants in 70 ms returned sat
[2022-05-15 23:25:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:25:36] [INFO ] [Real]Absence check using state equation in 904 ms returned sat
[2022-05-15 23:25:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:25:36] [INFO ] [Nat]Absence check using 60 positive place invariants in 22 ms returned sat
[2022-05-15 23:25:36] [INFO ] [Nat]Absence check using 60 positive and 188 generalized place invariants in 39 ms returned sat
[2022-05-15 23:25:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:25:37] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2022-05-15 23:25:37] [INFO ] Computed and/alt/rep : 965/3710/965 causal constraints (skipped 1398 transitions) in 164 ms.
[2022-05-15 23:25:57] [INFO ] Added : 540 causal constraints over 108 iterations in 20071 ms.(timeout) Result :sat
Minimization took 1286 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-10b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 1428 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1428/1428 places, 2412/2412 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 1428 transition count 2411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1427 transition count 2411
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 1427 transition count 2410
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1426 transition count 2410
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 1425 transition count 2409
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 1424 transition count 2408
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 1424 transition count 2408
Applied a total of 8 rules in 155 ms. Remains 1424 /1428 variables (removed 4) and now considering 2408/2412 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 1424/1428 places, 2408/2412 transitions.
// Phase 1: matrix 2408 rows 1424 cols
[2022-05-15 23:26:24] [INFO ] Computed 248 place invariants in 31 ms
Incomplete random walk after 1000000 steps, including 9463 resets, run finished after 3930 ms. (steps per millisecond=254 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 912 resets, run finished after 1895 ms. (steps per millisecond=527 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 917 resets, run finished after 1733 ms. (steps per millisecond=577 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 924 resets, run finished after 1511 ms. (steps per millisecond=661 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 923 resets, run finished after 1694 ms. (steps per millisecond=590 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 930 resets, run finished after 1806 ms. (steps per millisecond=553 ) properties (out of 5) seen :0
// Phase 1: matrix 2408 rows 1424 cols
[2022-05-15 23:26:37] [INFO ] Computed 248 place invariants in 56 ms
[2022-05-15 23:26:37] [INFO ] [Real]Absence check using 66 positive place invariants in 23 ms returned sat
[2022-05-15 23:26:37] [INFO ] [Real]Absence check using 66 positive and 182 generalized place invariants in 49 ms returned sat
[2022-05-15 23:26:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:26:38] [INFO ] [Real]Absence check using state equation in 801 ms returned sat
[2022-05-15 23:26:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:26:38] [INFO ] [Nat]Absence check using 66 positive place invariants in 21 ms returned sat
[2022-05-15 23:26:38] [INFO ] [Nat]Absence check using 66 positive and 182 generalized place invariants in 29 ms returned sat
[2022-05-15 23:26:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:26:40] [INFO ] [Nat]Absence check using state equation in 1558 ms returned sat
[2022-05-15 23:26:40] [INFO ] Computed and/alt/rep : 961/3697/961 causal constraints (skipped 1398 transitions) in 174 ms.
[2022-05-15 23:27:00] [INFO ] Added : 615 causal constraints over 123 iterations in 20189 ms.(timeout) Result :sat
Minimization took 1156 ms.
[2022-05-15 23:27:01] [INFO ] [Real]Absence check using 66 positive place invariants in 23 ms returned sat
[2022-05-15 23:27:01] [INFO ] [Real]Absence check using 66 positive and 182 generalized place invariants in 42 ms returned sat
[2022-05-15 23:27:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:27:02] [INFO ] [Real]Absence check using state equation in 723 ms returned sat
[2022-05-15 23:27:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:27:02] [INFO ] [Nat]Absence check using 66 positive place invariants in 17 ms returned sat
[2022-05-15 23:27:02] [INFO ] [Nat]Absence check using 66 positive and 182 generalized place invariants in 30 ms returned sat
[2022-05-15 23:27:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:27:03] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2022-05-15 23:27:03] [INFO ] Computed and/alt/rep : 961/3697/961 causal constraints (skipped 1398 transitions) in 98 ms.
[2022-05-15 23:27:07] [INFO ] Added : 107 causal constraints over 22 iterations in 3922 ms. Result :sat
Minimization took 886 ms.
[2022-05-15 23:27:08] [INFO ] [Real]Absence check using 66 positive place invariants in 18 ms returned sat
[2022-05-15 23:27:08] [INFO ] [Real]Absence check using 66 positive and 182 generalized place invariants in 66 ms returned sat
[2022-05-15 23:27:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:27:09] [INFO ] [Real]Absence check using state equation in 830 ms returned sat
[2022-05-15 23:27:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:27:09] [INFO ] [Nat]Absence check using 66 positive place invariants in 18 ms returned sat
[2022-05-15 23:27:09] [INFO ] [Nat]Absence check using 66 positive and 182 generalized place invariants in 32 ms returned sat
[2022-05-15 23:27:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:27:10] [INFO ] [Nat]Absence check using state equation in 893 ms returned sat
[2022-05-15 23:27:10] [INFO ] Computed and/alt/rep : 961/3697/961 causal constraints (skipped 1398 transitions) in 177 ms.
[2022-05-15 23:27:31] [INFO ] Added : 580 causal constraints over 116 iterations in 20342 ms.(timeout) Result :sat
Minimization took 843 ms.
[2022-05-15 23:27:32] [INFO ] [Real]Absence check using 66 positive place invariants in 17 ms returned sat
[2022-05-15 23:27:32] [INFO ] [Real]Absence check using 66 positive and 182 generalized place invariants in 33 ms returned sat
[2022-05-15 23:27:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:27:33] [INFO ] [Real]Absence check using state equation in 819 ms returned sat
[2022-05-15 23:27:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:27:33] [INFO ] [Nat]Absence check using 66 positive place invariants in 18 ms returned sat
[2022-05-15 23:27:33] [INFO ] [Nat]Absence check using 66 positive and 182 generalized place invariants in 33 ms returned sat
[2022-05-15 23:27:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:27:34] [INFO ] [Nat]Absence check using state equation in 927 ms returned sat
[2022-05-15 23:27:34] [INFO ] Computed and/alt/rep : 961/3697/961 causal constraints (skipped 1398 transitions) in 147 ms.
[2022-05-15 23:27:54] [INFO ] Added : 585 causal constraints over 117 iterations in 20176 ms.(timeout) Result :sat
Minimization took 1637 ms.
[2022-05-15 23:27:56] [INFO ] [Real]Absence check using 66 positive place invariants in 22 ms returned sat
[2022-05-15 23:27:56] [INFO ] [Real]Absence check using 66 positive and 182 generalized place invariants in 57 ms returned sat
[2022-05-15 23:27:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:27:57] [INFO ] [Real]Absence check using state equation in 782 ms returned sat
[2022-05-15 23:27:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:27:57] [INFO ] [Nat]Absence check using 66 positive place invariants in 18 ms returned sat
[2022-05-15 23:27:57] [INFO ] [Nat]Absence check using 66 positive and 182 generalized place invariants in 31 ms returned sat
[2022-05-15 23:27:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:27:58] [INFO ] [Nat]Absence check using state equation in 863 ms returned sat
[2022-05-15 23:27:58] [INFO ] Computed and/alt/rep : 961/3697/961 causal constraints (skipped 1398 transitions) in 159 ms.
[2022-05-15 23:28:17] [INFO ] Added : 569 causal constraints over 114 iterations in 19411 ms. Result :sat
Minimization took 565 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 1424 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1424/1424 places, 2408/2408 transitions.
Applied a total of 0 rules in 70 ms. Remains 1424 /1424 variables (removed 0) and now considering 2408/2408 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1424/1424 places, 2408/2408 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1424/1424 places, 2408/2408 transitions.
Applied a total of 0 rules in 69 ms. Remains 1424 /1424 variables (removed 0) and now considering 2408/2408 (removed 0) transitions.
// Phase 1: matrix 2408 rows 1424 cols
[2022-05-15 23:28:34] [INFO ] Computed 248 place invariants in 63 ms
[2022-05-15 23:28:35] [INFO ] Implicit Places using invariants in 1192 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 271, 272, 274, 291, 309, 378, 382, 383, 394, 395, 397, 414, 432, 470, 504, 508, 509, 520, 521, 523, 540, 558, 627, 631, 632, 643, 644, 646, 663, 681, 719, 753, 757, 758, 769, 770, 772, 789, 807, 882, 883, 894, 895, 897, 914, 932, 1001, 1005, 1006, 1017, 1018, 1020, 1037, 1055, 1090, 1127, 1131, 1132, 1143, 1144, 1146, 1163, 1181, 1250, 1254, 1255, 1258, 1269, 1270, 1271, 1289, 1291, 1295, 1313, 1314, 1315, 1316, 1328, 1334, 1340, 1346, 1352, 1358, 1364, 1370, 1376, 1382, 1388]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 1199 ms to find 104 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1320/1424 places, 2408/2408 transitions.
Drop transitions removed 187 transitions
Trivial Post-agglo rules discarded 187 transitions
Performed 187 trivial Post agglomeration. Transition count delta: 187
Iterating post reduction 0 with 187 rules applied. Total rules applied 187 place count 1320 transition count 2221
Reduce places removed 187 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 200 rules applied. Total rules applied 387 place count 1133 transition count 2208
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 390 place count 1130 transition count 2208
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 390 place count 1130 transition count 2161
Deduced a syphon composed of 47 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 485 place count 1082 transition count 2161
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 497 place count 1078 transition count 2153
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 505 place count 1070 transition count 2153
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 520 place count 1055 transition count 2138
Iterating global reduction 5 with 15 rules applied. Total rules applied 535 place count 1055 transition count 2138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 538 place count 1055 transition count 2135
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 538 place count 1055 transition count 2134
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 540 place count 1054 transition count 2134
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 543 place count 1051 transition count 2128
Iterating global reduction 6 with 3 rules applied. Total rules applied 546 place count 1051 transition count 2128
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 547 place count 1050 transition count 2127
Iterating global reduction 6 with 1 rules applied. Total rules applied 548 place count 1050 transition count 2127
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 549 place count 1049 transition count 2125
Iterating global reduction 6 with 1 rules applied. Total rules applied 550 place count 1049 transition count 2125
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 3 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 690 place count 979 transition count 2055
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 699 place count 970 transition count 2046
Iterating global reduction 6 with 9 rules applied. Total rules applied 708 place count 970 transition count 2046
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 717 place count 970 transition count 2037
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 721 place count 968 transition count 2038
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 7 with 21 rules applied. Total rules applied 742 place count 968 transition count 2017
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 7 with 22 rules applied. Total rules applied 764 place count 946 transition count 2017
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 8 with 30 rules applied. Total rules applied 794 place count 946 transition count 2017
Applied a total of 794 rules in 363 ms. Remains 946 /1320 variables (removed 374) and now considering 2017/2408 (removed 391) transitions.
// Phase 1: matrix 2017 rows 946 cols
[2022-05-15 23:28:36] [INFO ] Computed 138 place invariants in 27 ms
[2022-05-15 23:28:36] [INFO ] Implicit Places using invariants in 587 ms returned [72, 89, 95, 98, 100, 103, 104, 156, 173, 179, 182, 184, 189, 190, 242, 259, 265, 268, 270, 275, 276, 328, 347, 353, 356, 358, 363, 364, 416, 433, 439, 442, 444, 449, 450, 502, 521, 527, 530, 532, 537, 538, 608, 614, 617, 619, 622, 627, 628, 680, 697, 703, 706, 708, 713, 714, 766, 785, 791, 794, 796, 801, 802, 854, 871, 877, 880, 882]
Discarding 68 places :
Implicit Place search using SMT only with invariants took 590 ms to find 68 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 878/1424 places, 2017/2408 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 848 transition count 1987
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 848 transition count 1987
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 838 transition count 1977
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 838 transition count 1977
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 3 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 118 place count 819 transition count 1958
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 148 place count 819 transition count 1928
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 178 place count 789 transition count 1928
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 1 with 9 rules applied. Total rules applied 187 place count 789 transition count 1919
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 196 place count 780 transition count 1919
Applied a total of 196 rules in 158 ms. Remains 780 /878 variables (removed 98) and now considering 1919/2017 (removed 98) transitions.
// Phase 1: matrix 1919 rows 780 cols
[2022-05-15 23:28:36] [INFO ] Computed 70 place invariants in 29 ms
[2022-05-15 23:28:37] [INFO ] Implicit Places using invariants in 432 ms returned []
// Phase 1: matrix 1919 rows 780 cols
[2022-05-15 23:28:37] [INFO ] Computed 70 place invariants in 15 ms
[2022-05-15 23:28:38] [INFO ] Implicit Places using invariants and state equation in 1590 ms returned []
Implicit Place search using SMT with State Equation took 2025 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 780/1424 places, 1919/2408 transitions.
Finished structural reductions, in 3 iterations. Remains : 780/1424 places, 1919/2408 transitions.
Successfully produced net in file /tmp/petri1000_16805145771553995807.dot
Successfully produced net in file /tmp/petri1001_8046201204922474147.dot
Successfully produced net in file /tmp/petri1002_2023881334987775241.dot
Successfully produced net in file /tmp/petri1003_13719811599795419556.dot
Successfully produced net in file /tmp/petri1004_9359581298044969991.dot
Successfully produced net in file /tmp/petri1005_6916990690270498351.dot
Successfully produced net in file /tmp/petri1006_4305771956481323503.dot
Successfully produced net in file /tmp/petri1007_16171822111927153404.dot
Successfully produced net in file /tmp/petri1008_12874952381336260081.dot
Successfully produced net in file /tmp/petri1009_9792724440182650037.dot
Drop transitions removed 10 transitions
Dominated transitions for bounds rules discarded 10 transitions
// Phase 1: matrix 1909 rows 780 cols
[2022-05-15 23:28:38] [INFO ] Computed 70 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 15954 resets, run finished after 2806 ms. (steps per millisecond=356 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2132 resets, run finished after 720 ms. (steps per millisecond=1388 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2139 resets, run finished after 829 ms. (steps per millisecond=1206 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2143 resets, run finished after 1091 ms. (steps per millisecond=916 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2116 resets, run finished after 984 ms. (steps per millisecond=1016 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2123 resets, run finished after 824 ms. (steps per millisecond=1213 ) properties (out of 5) seen :0
// Phase 1: matrix 1909 rows 780 cols
[2022-05-15 23:28:46] [INFO ] Computed 70 place invariants in 34 ms
[2022-05-15 23:28:46] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2022-05-15 23:28:46] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 16 ms returned sat
[2022-05-15 23:28:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:28:46] [INFO ] [Real]Absence check using state equation in 510 ms returned sat
[2022-05-15 23:28:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:28:47] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-05-15 23:28:47] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 14 ms returned sat
[2022-05-15 23:28:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:28:47] [INFO ] [Nat]Absence check using state equation in 762 ms returned sat
[2022-05-15 23:28:47] [INFO ] Computed and/alt/rep : 459/1988/459 causal constraints (skipped 1401 transitions) in 119 ms.
[2022-05-15 23:28:51] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 3 ms to minimize.
[2022-05-15 23:28:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 388 ms
[2022-05-15 23:28:51] [INFO ] Added : 85 causal constraints over 18 iterations in 3992 ms. Result :sat
Minimization took 338 ms.
[2022-05-15 23:28:52] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2022-05-15 23:28:52] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 26 ms returned sat
[2022-05-15 23:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:28:52] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2022-05-15 23:28:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:28:53] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2022-05-15 23:28:53] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 17 ms returned sat
[2022-05-15 23:28:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:28:53] [INFO ] [Nat]Absence check using state equation in 745 ms returned sat
[2022-05-15 23:28:54] [INFO ] Computed and/alt/rep : 459/1988/459 causal constraints (skipped 1401 transitions) in 142 ms.
[2022-05-15 23:28:57] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 2 ms to minimize.
[2022-05-15 23:28:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2022-05-15 23:28:57] [INFO ] Added : 83 causal constraints over 17 iterations in 3735 ms. Result :sat
Minimization took 356 ms.
[2022-05-15 23:28:58] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-05-15 23:28:58] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 17 ms returned sat
[2022-05-15 23:28:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:28:58] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2022-05-15 23:28:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:28:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-05-15 23:28:59] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 12 ms returned sat
[2022-05-15 23:28:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:28:59] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2022-05-15 23:28:59] [INFO ] Computed and/alt/rep : 459/1988/459 causal constraints (skipped 1401 transitions) in 100 ms.
[2022-05-15 23:29:01] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 1 ms to minimize.
[2022-05-15 23:29:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2022-05-15 23:29:01] [INFO ] Added : 43 causal constraints over 9 iterations in 1936 ms. Result :sat
Minimization took 277 ms.
[2022-05-15 23:29:01] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-05-15 23:29:01] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 16 ms returned sat
[2022-05-15 23:29:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:29:02] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2022-05-15 23:29:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:29:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2022-05-15 23:29:02] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 28 ms returned sat
[2022-05-15 23:29:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:29:03] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2022-05-15 23:29:03] [INFO ] Computed and/alt/rep : 459/1988/459 causal constraints (skipped 1401 transitions) in 157 ms.
[2022-05-15 23:29:06] [INFO ] Added : 63 causal constraints over 13 iterations in 2358 ms. Result :sat
Minimization took 408 ms.
[2022-05-15 23:29:06] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-05-15 23:29:06] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 16 ms returned sat
[2022-05-15 23:29:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:29:07] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2022-05-15 23:29:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:29:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-05-15 23:29:07] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 12 ms returned sat
[2022-05-15 23:29:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:29:07] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2022-05-15 23:29:08] [INFO ] Computed and/alt/rep : 459/1988/459 causal constraints (skipped 1401 transitions) in 123 ms.
[2022-05-15 23:29:10] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 3 ms to minimize.
[2022-05-15 23:29:10] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2022-05-15 23:29:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 468 ms
[2022-05-15 23:29:11] [INFO ] Added : 72 causal constraints over 18 iterations in 3314 ms. Result :sat
Minimization took 414 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA ASLink-PT-10b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 780 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 780/780 places, 1909/1909 transitions.
Graph (complete) has 4715 edges and 780 vertex of which 770 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.10 ms
Discarding 10 places :
Also discarding 0 output transitions
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 770 transition count 1907
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 768 transition count 1907
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6 place count 767 transition count 1906
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 767 transition count 1906
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 767 transition count 1905
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 18 place count 767 transition count 1905
Applied a total of 18 rules in 114 ms. Remains 767 /780 variables (removed 13) and now considering 1905/1909 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 767/780 places, 1905/1909 transitions.
// Phase 1: matrix 1905 rows 767 cols
[2022-05-15 23:29:13] [INFO ] Computed 70 place invariants in 32 ms
Incomplete random walk after 1000000 steps, including 16139 resets, run finished after 3012 ms. (steps per millisecond=332 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2118 resets, run finished after 729 ms. (steps per millisecond=1371 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2145 resets, run finished after 975 ms. (steps per millisecond=1025 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2135 resets, run finished after 841 ms. (steps per millisecond=1189 ) properties (out of 3) seen :0
// Phase 1: matrix 1905 rows 767 cols
[2022-05-15 23:29:19] [INFO ] Computed 70 place invariants in 30 ms
[2022-05-15 23:29:19] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-15 23:29:19] [INFO ] [Real]Absence check using 17 positive and 53 generalized place invariants in 17 ms returned sat
[2022-05-15 23:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:29:20] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2022-05-15 23:29:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:29:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-15 23:29:20] [INFO ] [Nat]Absence check using 17 positive and 53 generalized place invariants in 15 ms returned sat
[2022-05-15 23:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:29:21] [INFO ] [Nat]Absence check using state equation in 735 ms returned sat
[2022-05-15 23:29:21] [INFO ] Computed and/alt/rep : 454/1950/454 causal constraints (skipped 1402 transitions) in 109 ms.
[2022-05-15 23:29:23] [INFO ] Added : 65 causal constraints over 13 iterations in 2066 ms. Result :sat
Minimization took 502 ms.
[2022-05-15 23:29:23] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-15 23:29:23] [INFO ] [Real]Absence check using 17 positive and 53 generalized place invariants in 17 ms returned sat
[2022-05-15 23:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:29:24] [INFO ] [Real]Absence check using state equation in 554 ms returned sat
[2022-05-15 23:29:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:29:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-15 23:29:24] [INFO ] [Nat]Absence check using 17 positive and 53 generalized place invariants in 15 ms returned sat
[2022-05-15 23:29:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:29:25] [INFO ] [Nat]Absence check using state equation in 644 ms returned sat
[2022-05-15 23:29:25] [INFO ] Computed and/alt/rep : 454/1950/454 causal constraints (skipped 1402 transitions) in 122 ms.
[2022-05-15 23:29:28] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2022-05-15 23:29:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 223 ms
[2022-05-15 23:29:28] [INFO ] Added : 82 causal constraints over 17 iterations in 3127 ms. Result :sat
Minimization took 477 ms.
[2022-05-15 23:29:29] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-15 23:29:29] [INFO ] [Real]Absence check using 17 positive and 53 generalized place invariants in 16 ms returned sat
[2022-05-15 23:29:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:29:29] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2022-05-15 23:29:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:29:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-15 23:29:30] [INFO ] [Nat]Absence check using 17 positive and 53 generalized place invariants in 16 ms returned sat
[2022-05-15 23:29:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:29:31] [INFO ] [Nat]Absence check using state equation in 1397 ms returned sat
[2022-05-15 23:29:31] [INFO ] Computed and/alt/rep : 454/1950/454 causal constraints (skipped 1402 transitions) in 129 ms.
[2022-05-15 23:29:34] [INFO ] Added : 61 causal constraints over 13 iterations in 2992 ms. Result :sat
Minimization took 683 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 767 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 767/767 places, 1905/1905 transitions.
Applied a total of 0 rules in 41 ms. Remains 767 /767 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 767/767 places, 1905/1905 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 767/767 places, 1905/1905 transitions.
Applied a total of 0 rules in 36 ms. Remains 767 /767 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
// Phase 1: matrix 1905 rows 767 cols
[2022-05-15 23:29:37] [INFO ] Computed 70 place invariants in 34 ms
[2022-05-15 23:29:37] [INFO ] Implicit Places using invariants in 561 ms returned [482]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 563 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 766/767 places, 1905/1905 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 765 transition count 1904
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 765 transition count 1903
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 764 transition count 1903
Applied a total of 4 rules in 97 ms. Remains 764 /766 variables (removed 2) and now considering 1903/1905 (removed 2) transitions.
// Phase 1: matrix 1903 rows 764 cols
[2022-05-15 23:29:37] [INFO ] Computed 69 place invariants in 32 ms
[2022-05-15 23:29:38] [INFO ] Implicit Places using invariants in 607 ms returned []
// Phase 1: matrix 1903 rows 764 cols
[2022-05-15 23:29:38] [INFO ] Computed 69 place invariants in 16 ms
[2022-05-15 23:29:40] [INFO ] Implicit Places using invariants and state equation in 1790 ms returned []
Implicit Place search using SMT with State Equation took 2400 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 764/767 places, 1903/1905 transitions.
Finished structural reductions, in 2 iterations. Remains : 764/767 places, 1903/1905 transitions.
// Phase 1: matrix 1903 rows 764 cols
[2022-05-15 23:29:40] [INFO ] Computed 69 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 15824 resets, run finished after 3130 ms. (steps per millisecond=319 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2148 resets, run finished after 868 ms. (steps per millisecond=1152 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2136 resets, run finished after 850 ms. (steps per millisecond=1176 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2132 resets, run finished after 757 ms. (steps per millisecond=1321 ) properties (out of 3) seen :0
// Phase 1: matrix 1903 rows 764 cols
[2022-05-15 23:29:45] [INFO ] Computed 69 place invariants in 32 ms
[2022-05-15 23:29:45] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2022-05-15 23:29:45] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 17 ms returned sat
[2022-05-15 23:29:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:29:46] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2022-05-15 23:29:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:29:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-05-15 23:29:46] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 13 ms returned sat
[2022-05-15 23:29:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:29:47] [INFO ] [Nat]Absence check using state equation in 1127 ms returned sat
[2022-05-15 23:29:47] [INFO ] Computed and/alt/rep : 445/1877/445 causal constraints (skipped 1409 transitions) in 107 ms.
[2022-05-15 23:29:48] [INFO ] Added : 37 causal constraints over 9 iterations in 1090 ms. Result :sat
Minimization took 480 ms.
[2022-05-15 23:29:49] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-05-15 23:29:49] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 18 ms returned sat
[2022-05-15 23:29:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:29:50] [INFO ] [Real]Absence check using state equation in 590 ms returned sat
[2022-05-15 23:29:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:29:50] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2022-05-15 23:29:50] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 17 ms returned sat
[2022-05-15 23:29:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:29:51] [INFO ] [Nat]Absence check using state equation in 999 ms returned sat
[2022-05-15 23:29:51] [INFO ] Computed and/alt/rep : 445/1877/445 causal constraints (skipped 1409 transitions) in 116 ms.
[2022-05-15 23:29:53] [INFO ] Added : 54 causal constraints over 11 iterations in 1680 ms. Result :sat
Minimization took 288 ms.
[2022-05-15 23:29:53] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-05-15 23:29:53] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 17 ms returned sat
[2022-05-15 23:29:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:29:54] [INFO ] [Real]Absence check using state equation in 635 ms returned sat
[2022-05-15 23:29:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:29:54] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-05-15 23:29:54] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 13 ms returned sat
[2022-05-15 23:29:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:29:55] [INFO ] [Nat]Absence check using state equation in 880 ms returned sat
[2022-05-15 23:29:55] [INFO ] Computed and/alt/rep : 445/1877/445 causal constraints (skipped 1409 transitions) in 121 ms.
[2022-05-15 23:29:56] [INFO ] Added : 60 causal constraints over 12 iterations in 1460 ms. Result :sat
Minimization took 349 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 764 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 764/764 places, 1903/1903 transitions.
Applied a total of 0 rules in 34 ms. Remains 764 /764 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 764/764 places, 1903/1903 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 764/764 places, 1903/1903 transitions.
Applied a total of 0 rules in 35 ms. Remains 764 /764 variables (removed 0) and now considering 1903/1903 (removed 0) transitions.
// Phase 1: matrix 1903 rows 764 cols
[2022-05-15 23:29:58] [INFO ] Computed 69 place invariants in 33 ms
[2022-05-15 23:29:58] [INFO ] Implicit Places using invariants in 518 ms returned []
// Phase 1: matrix 1903 rows 764 cols
[2022-05-15 23:29:58] [INFO ] Computed 69 place invariants in 16 ms
[2022-05-15 23:30:00] [INFO ] Implicit Places using invariants and state equation in 1895 ms returned []
Implicit Place search using SMT with State Equation took 2415 ms to find 0 implicit places.
[2022-05-15 23:30:00] [INFO ] Redundant transitions in 137 ms returned []
// Phase 1: matrix 1903 rows 764 cols
[2022-05-15 23:30:00] [INFO ] Computed 69 place invariants in 14 ms
[2022-05-15 23:30:01] [INFO ] Dead Transitions using invariants and state equation in 758 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 764/764 places, 1903/1903 transitions.
Starting property specific reduction for ASLink-PT-10b-UpperBounds-04
// Phase 1: matrix 1903 rows 764 cols
[2022-05-15 23:30:01] [INFO ] Computed 69 place invariants in 15 ms
Incomplete random walk after 10000 steps, including 160 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 1903 rows 764 cols
[2022-05-15 23:30:01] [INFO ] Computed 69 place invariants in 12 ms
[2022-05-15 23:30:01] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-05-15 23:30:01] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 13 ms returned sat
[2022-05-15 23:30:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:02] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2022-05-15 23:30:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:30:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2022-05-15 23:30:02] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 17 ms returned sat
[2022-05-15 23:30:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:03] [INFO ] [Nat]Absence check using state equation in 1158 ms returned sat
[2022-05-15 23:30:03] [INFO ] Computed and/alt/rep : 445/1877/445 causal constraints (skipped 1409 transitions) in 143 ms.
[2022-05-15 23:30:05] [INFO ] Added : 37 causal constraints over 9 iterations in 1386 ms. Result :sat
Minimization took 435 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 764 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 764/764 places, 1903/1903 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 764 transition count 1901
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 762 transition count 1901
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 762 transition count 1899
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 760 transition count 1899
Applied a total of 8 rules in 49 ms. Remains 760 /764 variables (removed 4) and now considering 1899/1903 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 760/764 places, 1899/1903 transitions.
// Phase 1: matrix 1899 rows 760 cols
[2022-05-15 23:30:05] [INFO ] Computed 69 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 16185 resets, run finished after 3032 ms. (steps per millisecond=329 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2143 resets, run finished after 890 ms. (steps per millisecond=1123 ) properties (out of 1) seen :0
// Phase 1: matrix 1899 rows 760 cols
[2022-05-15 23:30:09] [INFO ] Computed 69 place invariants in 33 ms
[2022-05-15 23:30:10] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2022-05-15 23:30:10] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 18 ms returned sat
[2022-05-15 23:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:10] [INFO ] [Real]Absence check using state equation in 578 ms returned sat
[2022-05-15 23:30:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:30:10] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2022-05-15 23:30:10] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 18 ms returned sat
[2022-05-15 23:30:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:11] [INFO ] [Nat]Absence check using state equation in 849 ms returned sat
[2022-05-15 23:30:11] [INFO ] Computed and/alt/rep : 441/1873/441 causal constraints (skipped 1409 transitions) in 121 ms.
[2022-05-15 23:30:13] [INFO ] Added : 40 causal constraints over 8 iterations in 1566 ms. Result :sat
Minimization took 447 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 760 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 760/760 places, 1899/1899 transitions.
Applied a total of 0 rules in 56 ms. Remains 760 /760 variables (removed 0) and now considering 1899/1899 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 760/760 places, 1899/1899 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 760/760 places, 1899/1899 transitions.
Applied a total of 0 rules in 44 ms. Remains 760 /760 variables (removed 0) and now considering 1899/1899 (removed 0) transitions.
// Phase 1: matrix 1899 rows 760 cols
[2022-05-15 23:30:14] [INFO ] Computed 69 place invariants in 31 ms
[2022-05-15 23:30:14] [INFO ] Implicit Places using invariants in 535 ms returned []
// Phase 1: matrix 1899 rows 760 cols
[2022-05-15 23:30:14] [INFO ] Computed 69 place invariants in 16 ms
[2022-05-15 23:30:16] [INFO ] Implicit Places using invariants and state equation in 1759 ms returned []
Implicit Place search using SMT with State Equation took 2295 ms to find 0 implicit places.
[2022-05-15 23:30:16] [INFO ] Redundant transitions in 97 ms returned []
// Phase 1: matrix 1899 rows 760 cols
[2022-05-15 23:30:16] [INFO ] Computed 69 place invariants in 11 ms
[2022-05-15 23:30:17] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 760/760 places, 1899/1899 transitions.
Ending property specific reduction for ASLink-PT-10b-UpperBounds-04 in 15672 ms.
Starting property specific reduction for ASLink-PT-10b-UpperBounds-11
// Phase 1: matrix 1903 rows 764 cols
[2022-05-15 23:30:17] [INFO ] Computed 69 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 164 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 1903 rows 764 cols
[2022-05-15 23:30:17] [INFO ] Computed 69 place invariants in 13 ms
[2022-05-15 23:30:17] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2022-05-15 23:30:17] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 11 ms returned sat
[2022-05-15 23:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:17] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2022-05-15 23:30:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:30:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-05-15 23:30:18] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 11 ms returned sat
[2022-05-15 23:30:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:18] [INFO ] [Nat]Absence check using state equation in 819 ms returned sat
[2022-05-15 23:30:19] [INFO ] Computed and/alt/rep : 445/1877/445 causal constraints (skipped 1409 transitions) in 115 ms.
[2022-05-15 23:30:20] [INFO ] Added : 54 causal constraints over 11 iterations in 1649 ms. Result :sat
Minimization took 289 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 764 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 764/764 places, 1903/1903 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 764 transition count 1901
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 762 transition count 1901
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 762 transition count 1899
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 760 transition count 1899
Applied a total of 8 rules in 49 ms. Remains 760 /764 variables (removed 4) and now considering 1899/1903 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 760/764 places, 1899/1903 transitions.
// Phase 1: matrix 1899 rows 760 cols
[2022-05-15 23:30:21] [INFO ] Computed 69 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 16072 resets, run finished after 3210 ms. (steps per millisecond=311 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2126 resets, run finished after 883 ms. (steps per millisecond=1132 ) properties (out of 1) seen :0
// Phase 1: matrix 1899 rows 760 cols
[2022-05-15 23:30:25] [INFO ] Computed 69 place invariants in 30 ms
[2022-05-15 23:30:25] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-05-15 23:30:25] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 28 ms returned sat
[2022-05-15 23:30:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:26] [INFO ] [Real]Absence check using state equation in 589 ms returned sat
[2022-05-15 23:30:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:30:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-05-15 23:30:26] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 25 ms returned sat
[2022-05-15 23:30:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:27] [INFO ] [Nat]Absence check using state equation in 873 ms returned sat
[2022-05-15 23:30:27] [INFO ] Computed and/alt/rep : 441/1873/441 causal constraints (skipped 1409 transitions) in 119 ms.
[2022-05-15 23:30:29] [INFO ] Added : 55 causal constraints over 13 iterations in 2368 ms. Result :sat
Minimization took 265 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 760 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 760/760 places, 1899/1899 transitions.
Applied a total of 0 rules in 34 ms. Remains 760 /760 variables (removed 0) and now considering 1899/1899 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 760/760 places, 1899/1899 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 760/760 places, 1899/1899 transitions.
Applied a total of 0 rules in 34 ms. Remains 760 /760 variables (removed 0) and now considering 1899/1899 (removed 0) transitions.
// Phase 1: matrix 1899 rows 760 cols
[2022-05-15 23:30:30] [INFO ] Computed 69 place invariants in 33 ms
[2022-05-15 23:30:30] [INFO ] Implicit Places using invariants in 547 ms returned []
// Phase 1: matrix 1899 rows 760 cols
[2022-05-15 23:30:30] [INFO ] Computed 69 place invariants in 16 ms
[2022-05-15 23:30:32] [INFO ] Implicit Places using invariants and state equation in 1552 ms returned []
Implicit Place search using SMT with State Equation took 2103 ms to find 0 implicit places.
[2022-05-15 23:30:32] [INFO ] Redundant transitions in 41 ms returned []
// Phase 1: matrix 1899 rows 760 cols
[2022-05-15 23:30:32] [INFO ] Computed 69 place invariants in 26 ms
[2022-05-15 23:30:33] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 760/760 places, 1899/1899 transitions.
Ending property specific reduction for ASLink-PT-10b-UpperBounds-11 in 15879 ms.
Starting property specific reduction for ASLink-PT-10b-UpperBounds-12
// Phase 1: matrix 1903 rows 764 cols
[2022-05-15 23:30:33] [INFO ] Computed 69 place invariants in 16 ms
Incomplete random walk after 10000 steps, including 172 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 1903 rows 764 cols
[2022-05-15 23:30:33] [INFO ] Computed 69 place invariants in 13 ms
[2022-05-15 23:30:33] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-05-15 23:30:33] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 14 ms returned sat
[2022-05-15 23:30:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:33] [INFO ] [Real]Absence check using state equation in 522 ms returned sat
[2022-05-15 23:30:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:30:34] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-05-15 23:30:34] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 15 ms returned sat
[2022-05-15 23:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:34] [INFO ] [Nat]Absence check using state equation in 881 ms returned sat
[2022-05-15 23:30:35] [INFO ] Computed and/alt/rep : 445/1877/445 causal constraints (skipped 1409 transitions) in 137 ms.
[2022-05-15 23:30:36] [INFO ] Added : 60 causal constraints over 12 iterations in 1819 ms. Result :sat
Minimization took 305 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 764 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 764/764 places, 1903/1903 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 764 transition count 1901
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 762 transition count 1901
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 762 transition count 1899
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 760 transition count 1899
Applied a total of 8 rules in 75 ms. Remains 760 /764 variables (removed 4) and now considering 1899/1903 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 760/764 places, 1899/1903 transitions.
// Phase 1: matrix 1899 rows 760 cols
[2022-05-15 23:30:37] [INFO ] Computed 69 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 16084 resets, run finished after 2421 ms. (steps per millisecond=413 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2130 resets, run finished after 997 ms. (steps per millisecond=1003 ) properties (out of 1) seen :0
// Phase 1: matrix 1899 rows 760 cols
[2022-05-15 23:30:41] [INFO ] Computed 69 place invariants in 17 ms
[2022-05-15 23:30:41] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2022-05-15 23:30:41] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 16 ms returned sat
[2022-05-15 23:30:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:42] [INFO ] [Real]Absence check using state equation in 558 ms returned sat
[2022-05-15 23:30:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 23:30:42] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2022-05-15 23:30:42] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 13 ms returned sat
[2022-05-15 23:30:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 23:30:42] [INFO ] [Nat]Absence check using state equation in 518 ms returned sat
[2022-05-15 23:30:42] [INFO ] Computed and/alt/rep : 441/1873/441 causal constraints (skipped 1409 transitions) in 102 ms.
[2022-05-15 23:30:44] [INFO ] Added : 53 causal constraints over 11 iterations in 1660 ms. Result :sat
Minimization took 313 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 760 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 760/760 places, 1899/1899 transitions.
Applied a total of 0 rules in 34 ms. Remains 760 /760 variables (removed 0) and now considering 1899/1899 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 760/760 places, 1899/1899 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 760/760 places, 1899/1899 transitions.
Applied a total of 0 rules in 34 ms. Remains 760 /760 variables (removed 0) and now considering 1899/1899 (removed 0) transitions.
// Phase 1: matrix 1899 rows 760 cols
[2022-05-15 23:30:45] [INFO ] Computed 69 place invariants in 32 ms
[2022-05-15 23:30:45] [INFO ] Implicit Places using invariants in 545 ms returned []
// Phase 1: matrix 1899 rows 760 cols
[2022-05-15 23:30:45] [INFO ] Computed 69 place invariants in 16 ms
[2022-05-15 23:30:47] [INFO ] Implicit Places using invariants and state equation in 1459 ms returned []
Implicit Place search using SMT with State Equation took 2005 ms to find 0 implicit places.
[2022-05-15 23:30:47] [INFO ] Redundant transitions in 30 ms returned []
// Phase 1: matrix 1899 rows 760 cols
[2022-05-15 23:30:47] [INFO ] Computed 69 place invariants in 15 ms
[2022-05-15 23:30:47] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 760/760 places, 1899/1899 transitions.
Ending property specific reduction for ASLink-PT-10b-UpperBounds-12 in 14558 ms.
[2022-05-15 23:30:48] [INFO ] Flatten gal took : 179 ms
[2022-05-15 23:30:48] [INFO ] Applying decomposition
[2022-05-15 23:30:48] [INFO ] Flatten gal took : 97 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/graph5071839429269594737.txt' '-o' '/tmp/graph5071839429269594737.bin' '-w' '/tmp/graph5071839429269594737.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5071839429269594737.bin' '-l' '-1' '-v' '-w' '/tmp/graph5071839429269594737.weights' '-q' '0' '-e' '0.001'
[2022-05-15 23:30:48] [INFO ] Decomposing Gal with order
[2022-05-15 23:30:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 23:30:48] [INFO ] Removed a total of 3801 redundant transitions.
[2022-05-15 23:30:48] [INFO ] Flatten gal took : 244 ms
[2022-05-15 23:30:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 47 ms.
[2022-05-15 23:30:49] [INFO ] Time to serialize gal into /tmp/UpperBounds14181090001335475200.gal : 28 ms
[2022-05-15 23:30:49] [INFO ] Time to serialize properties into /tmp/UpperBounds9120084861099913144.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/UpperBounds14181090001335475200.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9120084861099913144.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/UpperBounds9120084861099913144.prop.
Detected timeout of ITS tools.
[2022-05-15 23:53:42] [INFO ] Applying decomposition
[2022-05-15 23:53:43] [INFO ] Flatten gal took : 604 ms
[2022-05-15 23:53:43] [INFO ] Decomposing Gal with order
[2022-05-15 23:53:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 23:53:44] [INFO ] Removed a total of 3618 redundant transitions.
[2022-05-15 23:53:44] [INFO ] Flatten gal took : 1061 ms
[2022-05-15 23:53:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1510 labels/synchronizations in 235 ms.
[2022-05-15 23:53:45] [INFO ] Time to serialize gal into /tmp/UpperBounds7283387826135970118.gal : 55 ms
[2022-05-15 23:53:45] [INFO ] Time to serialize properties into /tmp/UpperBounds10377067128495807343.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/UpperBounds7283387826135970118.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds10377067128495807343.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/UpperBounds10377067128495807343.prop.
Detected timeout of ITS tools.
[2022-05-16 00:16:37] [INFO ] Flatten gal took : 302 ms
[2022-05-16 00:16:41] [INFO ] Input system was already deterministic with 1903 transitions.
[2022-05-16 00:16:41] [INFO ] Transformed 764 places.
[2022-05-16 00:16:41] [INFO ] Transformed 1903 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-16 00:16:42] [INFO ] Time to serialize gal into /tmp/UpperBounds8796620998709836656.gal : 40 ms
[2022-05-16 00:16:42] [INFO ] Time to serialize properties into /tmp/UpperBounds18110336848906200796.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/UpperBounds8796620998709836656.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds18110336848906200796.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/UpperBounds18110336848906200796.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-10b"
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-10b, 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-165245688900165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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