About the Execution of ITS-Tools for ASLink-PT-09a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16247.239 | 3600000.00 | 3152049.00 | 261274.20 | 1 1 1 1 1 1 1 1 1 1 1 ? 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r007-tall-162037989600141.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-09a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989600141
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 01:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 23 01:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 839K May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-09a-UpperBounds-00
FORMULA_NAME ASLink-PT-09a-UpperBounds-01
FORMULA_NAME ASLink-PT-09a-UpperBounds-02
FORMULA_NAME ASLink-PT-09a-UpperBounds-03
FORMULA_NAME ASLink-PT-09a-UpperBounds-04
FORMULA_NAME ASLink-PT-09a-UpperBounds-05
FORMULA_NAME ASLink-PT-09a-UpperBounds-06
FORMULA_NAME ASLink-PT-09a-UpperBounds-07
FORMULA_NAME ASLink-PT-09a-UpperBounds-08
FORMULA_NAME ASLink-PT-09a-UpperBounds-09
FORMULA_NAME ASLink-PT-09a-UpperBounds-10
FORMULA_NAME ASLink-PT-09a-UpperBounds-11
FORMULA_NAME ASLink-PT-09a-UpperBounds-12
FORMULA_NAME ASLink-PT-09a-UpperBounds-13
FORMULA_NAME ASLink-PT-09a-UpperBounds-14
FORMULA_NAME ASLink-PT-09a-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1620436625135
Running Version 0
[2021-05-08 01:17:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-08 01:17:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 01:17:06] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2021-05-08 01:17:06] [INFO ] Transformed 1991 places.
[2021-05-08 01:17:07] [INFO ] Transformed 2919 transitions.
[2021-05-08 01:17:07] [INFO ] Found NUPN structural information;
[2021-05-08 01:17:07] [INFO ] Parsed PT model containing 1991 places and 2919 transitions in 227 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 31 transitions
Reduce redundant transitions removed 31 transitions.
// Phase 1: matrix 2888 rows 1991 cols
[2021-05-08 01:17:07] [INFO ] Computed 384 place invariants in 426 ms
Incomplete random walk after 10000 steps, including 47 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 16) seen :10
FORMULA ASLink-PT-09a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
// Phase 1: matrix 2888 rows 1991 cols
[2021-05-08 01:17:07] [INFO ] Computed 384 place invariants in 94 ms
[2021-05-08 01:17:08] [INFO ] [Real]Absence check using 93 positive place invariants in 47 ms returned sat
[2021-05-08 01:17:08] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 88 ms returned sat
[2021-05-08 01:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:17:09] [INFO ] [Real]Absence check using state equation in 1306 ms returned sat
[2021-05-08 01:17:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:17:10] [INFO ] [Nat]Absence check using 93 positive place invariants in 45 ms returned sat
[2021-05-08 01:17:10] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 76 ms returned sat
[2021-05-08 01:17:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:17:14] [INFO ] [Nat]Absence check using state equation in 4638 ms returned unknown
[2021-05-08 01:17:15] [INFO ] [Real]Absence check using 93 positive place invariants in 43 ms returned sat
[2021-05-08 01:17:15] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 98 ms returned sat
[2021-05-08 01:17:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:17:16] [INFO ] [Real]Absence check using state equation in 1409 ms returned sat
[2021-05-08 01:17:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:17:17] [INFO ] [Nat]Absence check using 93 positive place invariants in 130 ms returned sat
[2021-05-08 01:17:17] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 123 ms returned sat
[2021-05-08 01:17:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:17:22] [INFO ] [Nat]Absence check using state equation in 4207 ms returned unknown
[2021-05-08 01:17:22] [INFO ] [Real]Absence check using 93 positive place invariants in 41 ms returned sat
[2021-05-08 01:17:22] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 75 ms returned sat
[2021-05-08 01:17:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:17:23] [INFO ] [Real]Absence check using state equation in 1142 ms returned sat
[2021-05-08 01:17:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:17:24] [INFO ] [Nat]Absence check using 93 positive place invariants in 43 ms returned sat
[2021-05-08 01:17:24] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 76 ms returned sat
[2021-05-08 01:17:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:17:28] [INFO ] [Nat]Absence check using state equation in 4597 ms returned unknown
[2021-05-08 01:17:29] [INFO ] [Real]Absence check using 93 positive place invariants in 81 ms returned sat
[2021-05-08 01:17:29] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 75 ms returned sat
[2021-05-08 01:17:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:17:30] [INFO ] [Real]Absence check using state equation in 1181 ms returned sat
[2021-05-08 01:17:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:17:30] [INFO ] [Nat]Absence check using 93 positive place invariants in 52 ms returned sat
[2021-05-08 01:17:31] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 77 ms returned sat
[2021-05-08 01:17:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:17:35] [INFO ] [Nat]Absence check using state equation in 4576 ms returned unknown
[2021-05-08 01:17:35] [INFO ] [Real]Absence check using 93 positive place invariants in 40 ms returned sat
[2021-05-08 01:17:35] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 74 ms returned sat
[2021-05-08 01:17:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:17:37] [INFO ] [Real]Absence check using state equation in 1254 ms returned sat
[2021-05-08 01:17:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:17:37] [INFO ] [Nat]Absence check using 93 positive place invariants in 43 ms returned sat
[2021-05-08 01:17:37] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 75 ms returned sat
[2021-05-08 01:17:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:17:42] [INFO ] [Nat]Absence check using state equation in 4609 ms returned unknown
[2021-05-08 01:17:42] [INFO ] [Real]Absence check using 93 positive place invariants in 42 ms returned sat
[2021-05-08 01:17:42] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 78 ms returned sat
[2021-05-08 01:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:17:44] [INFO ] [Real]Absence check using state equation in 1256 ms returned sat
[2021-05-08 01:17:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:17:44] [INFO ] [Nat]Absence check using 93 positive place invariants in 44 ms returned sat
[2021-05-08 01:17:44] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 77 ms returned sat
[2021-05-08 01:17:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:17:49] [INFO ] [Nat]Absence check using state equation in 4590 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 1991 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1991/1991 places, 2888/2888 transitions.
Ensure Unique test removed 36 places
Discarding 18 places :
Implicit places reduction removed 18 places
Drop transitions removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 0 with 238 rules applied. Total rules applied 238 place count 1937 transition count 2704
Reduce places removed 184 places and 0 transitions.
Iterating post reduction 1 with 184 rules applied. Total rules applied 422 place count 1753 transition count 2704
Performed 189 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 189 Pre rules applied. Total rules applied 422 place count 1753 transition count 2515
Deduced a syphon composed of 189 places in 5 ms
Ensure Unique test removed 75 places
Reduce places removed 264 places and 0 transitions.
Iterating global reduction 2 with 453 rules applied. Total rules applied 875 place count 1489 transition count 2515
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 876 place count 1489 transition count 2514
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 877 place count 1488 transition count 2514
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 889 place count 1476 transition count 2449
Ensure Unique test removed 1 places
Iterating global reduction 4 with 13 rules applied. Total rules applied 902 place count 1475 transition count 2449
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 908 place count 1474 transition count 2444
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 911 place count 1471 transition count 2444
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 912 place count 1470 transition count 2436
Iterating global reduction 6 with 1 rules applied. Total rules applied 913 place count 1470 transition count 2436
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 914 place count 1469 transition count 2428
Iterating global reduction 6 with 1 rules applied. Total rules applied 915 place count 1469 transition count 2428
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 916 place count 1468 transition count 2420
Iterating global reduction 6 with 1 rules applied. Total rules applied 917 place count 1468 transition count 2420
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 918 place count 1467 transition count 2412
Iterating global reduction 6 with 1 rules applied. Total rules applied 919 place count 1467 transition count 2412
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 920 place count 1466 transition count 2404
Iterating global reduction 6 with 1 rules applied. Total rules applied 921 place count 1466 transition count 2404
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 922 place count 1465 transition count 2396
Iterating global reduction 6 with 1 rules applied. Total rules applied 923 place count 1465 transition count 2396
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 924 place count 1464 transition count 2388
Iterating global reduction 6 with 1 rules applied. Total rules applied 925 place count 1464 transition count 2388
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 926 place count 1463 transition count 2380
Iterating global reduction 6 with 1 rules applied. Total rules applied 927 place count 1463 transition count 2380
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 928 place count 1462 transition count 2372
Iterating global reduction 6 with 1 rules applied. Total rules applied 929 place count 1462 transition count 2372
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 930 place count 1461 transition count 2364
Iterating global reduction 6 with 1 rules applied. Total rules applied 931 place count 1461 transition count 2364
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 932 place count 1460 transition count 2356
Iterating global reduction 6 with 1 rules applied. Total rules applied 933 place count 1460 transition count 2356
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 934 place count 1459 transition count 2348
Iterating global reduction 6 with 1 rules applied. Total rules applied 935 place count 1459 transition count 2348
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 936 place count 1458 transition count 2340
Iterating global reduction 6 with 1 rules applied. Total rules applied 937 place count 1458 transition count 2340
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 938 place count 1457 transition count 2332
Iterating global reduction 6 with 1 rules applied. Total rules applied 939 place count 1457 transition count 2332
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 940 place count 1456 transition count 2324
Iterating global reduction 6 with 1 rules applied. Total rules applied 941 place count 1456 transition count 2324
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 942 place count 1455 transition count 2316
Iterating global reduction 6 with 1 rules applied. Total rules applied 943 place count 1455 transition count 2316
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 3 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 6 with 124 rules applied. Total rules applied 1067 place count 1393 transition count 2254
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 6 with 8 rules applied. Total rules applied 1075 place count 1393 transition count 2246
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1083 place count 1385 transition count 2246
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 1093 place count 1385 transition count 2246
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1094 place count 1384 transition count 2245
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 7 with 18 rules applied. Total rules applied 1112 place count 1366 transition count 2245
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 36 Pre rules applied. Total rules applied 1112 place count 1366 transition count 2209
Deduced a syphon composed of 36 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 8 with 73 rules applied. Total rules applied 1185 place count 1329 transition count 2209
Discarding 10 places :
Implicit places reduction removed 10 places
Iterating post reduction 8 with 10 rules applied. Total rules applied 1195 place count 1319 transition count 2209
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1195 place count 1319 transition count 2208
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1197 place count 1318 transition count 2208
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 9 with 20 rules applied. Total rules applied 1217 place count 1308 transition count 2198
Discarding 9 places :
Symmetric choice reduction at 9 with 9 rule applications. Total rules 1226 place count 1299 transition count 2189
Iterating global reduction 9 with 9 rules applied. Total rules applied 1235 place count 1299 transition count 2189
Free-agglomeration rule applied 9 times.
Iterating global reduction 9 with 9 rules applied. Total rules applied 1244 place count 1299 transition count 2180
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 1253 place count 1290 transition count 2180
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 1262 place count 1290 transition count 2180
Applied a total of 1262 rules in 3235 ms. Remains 1290 /1991 variables (removed 701) and now considering 2180/2888 (removed 708) transitions.
Finished structural reductions, in 1 iterations. Remains : 1290/1991 places, 2180/2888 transitions.
// Phase 1: matrix 2180 rows 1290 cols
[2021-05-08 01:17:52] [INFO ] Computed 224 place invariants in 41 ms
Incomplete random walk after 1000000 steps, including 9960 resets, run finished after 4571 ms. (steps per millisecond=218 ) properties (out of 6) seen :1
FORMULA ASLink-PT-09a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1074 resets, run finished after 1798 ms. (steps per millisecond=556 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1078 resets, run finished after 1763 ms. (steps per millisecond=567 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1090 resets, run finished after 1781 ms. (steps per millisecond=561 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1084 resets, run finished after 1735 ms. (steps per millisecond=576 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1075 resets, run finished after 1750 ms. (steps per millisecond=571 ) properties (out of 5) seen :0
// Phase 1: matrix 2180 rows 1290 cols
[2021-05-08 01:18:05] [INFO ] Computed 224 place invariants in 42 ms
[2021-05-08 01:18:06] [INFO ] [Real]Absence check using 57 positive place invariants in 17 ms returned sat
[2021-05-08 01:18:06] [INFO ] [Real]Absence check using 57 positive and 167 generalized place invariants in 35 ms returned sat
[2021-05-08 01:18:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:18:06] [INFO ] [Real]Absence check using state equation in 703 ms returned sat
[2021-05-08 01:18:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:18:06] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2021-05-08 01:18:06] [INFO ] [Nat]Absence check using 57 positive and 167 generalized place invariants in 33 ms returned sat
[2021-05-08 01:18:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:18:07] [INFO ] [Nat]Absence check using state equation in 969 ms returned sat
[2021-05-08 01:18:08] [INFO ] Computed and/alt/rep : 868/3278/868 causal constraints (skipped 1267 transitions) in 247 ms.
[2021-05-08 01:18:22] [INFO ] Added : 668 causal constraints over 134 iterations in 14774 ms. Result :sat
Minimization took 752 ms.
[2021-05-08 01:18:23] [INFO ] [Real]Absence check using 57 positive place invariants in 59 ms returned sat
[2021-05-08 01:18:23] [INFO ] [Real]Absence check using 57 positive and 167 generalized place invariants in 59 ms returned sat
[2021-05-08 01:18:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:18:24] [INFO ] [Real]Absence check using state equation in 622 ms returned sat
[2021-05-08 01:18:24] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:18:24] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2021-05-08 01:18:24] [INFO ] [Nat]Absence check using 57 positive and 167 generalized place invariants in 32 ms returned sat
[2021-05-08 01:18:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:18:25] [INFO ] [Nat]Absence check using state equation in 894 ms returned sat
[2021-05-08 01:18:26] [INFO ] Deduced a trap composed of 159 places in 653 ms of which 5 ms to minimize.
[2021-05-08 01:18:27] [INFO ] Deduced a trap composed of 122 places in 1094 ms of which 2 ms to minimize.
[2021-05-08 01:18:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1956 ms
[2021-05-08 01:18:27] [INFO ] Computed and/alt/rep : 868/3278/868 causal constraints (skipped 1267 transitions) in 162 ms.
[2021-05-08 01:18:43] [INFO ] Added : 651 causal constraints over 131 iterations in 15796 ms. Result :sat
Minimization took 734 ms.
[2021-05-08 01:18:44] [INFO ] [Real]Absence check using 57 positive place invariants in 16 ms returned sat
[2021-05-08 01:18:44] [INFO ] [Real]Absence check using 57 positive and 167 generalized place invariants in 33 ms returned sat
[2021-05-08 01:18:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:18:45] [INFO ] [Real]Absence check using state equation in 606 ms returned sat
[2021-05-08 01:18:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:18:45] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2021-05-08 01:18:45] [INFO ] [Nat]Absence check using 57 positive and 167 generalized place invariants in 32 ms returned sat
[2021-05-08 01:18:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:18:46] [INFO ] [Nat]Absence check using state equation in 823 ms returned sat
[2021-05-08 01:18:46] [INFO ] Computed and/alt/rep : 868/3278/868 causal constraints (skipped 1267 transitions) in 127 ms.
[2021-05-08 01:18:58] [INFO ] Added : 310 causal constraints over 62 iterations in 12365 ms. Result :unknown
[2021-05-08 01:18:58] [INFO ] [Real]Absence check using 57 positive place invariants in 17 ms returned sat
[2021-05-08 01:18:58] [INFO ] [Real]Absence check using 57 positive and 167 generalized place invariants in 35 ms returned sat
[2021-05-08 01:18:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:18:59] [INFO ] [Real]Absence check using state equation in 669 ms returned sat
[2021-05-08 01:18:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:18:59] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2021-05-08 01:18:59] [INFO ] [Nat]Absence check using 57 positive and 167 generalized place invariants in 33 ms returned sat
[2021-05-08 01:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:19:00] [INFO ] [Nat]Absence check using state equation in 1092 ms returned sat
[2021-05-08 01:19:00] [INFO ] Computed and/alt/rep : 868/3278/868 causal constraints (skipped 1267 transitions) in 113 ms.
[2021-05-08 01:19:16] [INFO ] Added : 663 causal constraints over 133 iterations in 16111 ms. Result :sat
Minimization took 1120 ms.
[2021-05-08 01:19:18] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2021-05-08 01:19:18] [INFO ] [Real]Absence check using 57 positive and 167 generalized place invariants in 41 ms returned sat
[2021-05-08 01:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:19:18] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2021-05-08 01:19:18] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:19:19] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2021-05-08 01:19:19] [INFO ] [Nat]Absence check using 57 positive and 167 generalized place invariants in 34 ms returned sat
[2021-05-08 01:19:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:19:19] [INFO ] [Nat]Absence check using state equation in 846 ms returned sat
[2021-05-08 01:19:20] [INFO ] Computed and/alt/rep : 868/3278/868 causal constraints (skipped 1267 transitions) in 124 ms.
[2021-05-08 01:19:34] [INFO ] Added : 615 causal constraints over 123 iterations in 14224 ms. Result :sat
Minimization took 724 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 1300100 steps, including 9787 resets, run finished after 6025 ms. (steps per millisecond=215 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 302600 steps, including 3982 resets, run finished after 1388 ms. (steps per millisecond=218 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 1044900 steps, including 11888 resets, run finished after 5118 ms. (steps per millisecond=204 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 248100 steps, including 3089 resets, run finished after 1151 ms. (steps per millisecond=215 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 182300 steps, including 1883 resets, run finished after 853 ms. (steps per millisecond=213 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 5 out of 1290 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1290/1290 places, 2180/2180 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1289 transition count 2179
Applied a total of 2 rules in 78 ms. Remains 1289 /1290 variables (removed 1) and now considering 2179/2180 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 1289/1290 places, 2179/2180 transitions.
// Phase 1: matrix 2179 rows 1289 cols
[2021-05-08 01:19:49] [INFO ] Computed 224 place invariants in 54 ms
Incomplete random walk after 1000000 steps, including 9897 resets, run finished after 4652 ms. (steps per millisecond=214 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1075 resets, run finished after 1723 ms. (steps per millisecond=580 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1086 resets, run finished after 1646 ms. (steps per millisecond=607 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1090 resets, run finished after 1695 ms. (steps per millisecond=589 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1076 resets, run finished after 1745 ms. (steps per millisecond=573 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1074 resets, run finished after 1730 ms. (steps per millisecond=578 ) properties (out of 5) seen :0
// Phase 1: matrix 2179 rows 1289 cols
[2021-05-08 01:20:02] [INFO ] Computed 224 place invariants in 42 ms
[2021-05-08 01:20:03] [INFO ] [Real]Absence check using 56 positive place invariants in 19 ms returned sat
[2021-05-08 01:20:03] [INFO ] [Real]Absence check using 56 positive and 168 generalized place invariants in 36 ms returned sat
[2021-05-08 01:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:20:03] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2021-05-08 01:20:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:20:04] [INFO ] [Nat]Absence check using 56 positive place invariants in 19 ms returned sat
[2021-05-08 01:20:04] [INFO ] [Nat]Absence check using 56 positive and 168 generalized place invariants in 34 ms returned sat
[2021-05-08 01:20:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:20:04] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2021-05-08 01:20:05] [INFO ] Deduced a trap composed of 113 places in 528 ms of which 1 ms to minimize.
[2021-05-08 01:20:06] [INFO ] Deduced a trap composed of 113 places in 459 ms of which 1 ms to minimize.
[2021-05-08 01:20:06] [INFO ] Deduced a trap composed of 119 places in 487 ms of which 1 ms to minimize.
[2021-05-08 01:20:07] [INFO ] Deduced a trap composed of 103 places in 523 ms of which 1 ms to minimize.
[2021-05-08 01:20:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2334 ms
[2021-05-08 01:20:07] [INFO ] Computed and/alt/rep : 867/3277/867 causal constraints (skipped 1267 transitions) in 140 ms.
[2021-05-08 01:20:19] [INFO ] Added : 575 causal constraints over 115 iterations in 12336 ms. Result :sat
Minimization took 713 ms.
[2021-05-08 01:20:20] [INFO ] [Real]Absence check using 56 positive place invariants in 18 ms returned sat
[2021-05-08 01:20:20] [INFO ] [Real]Absence check using 56 positive and 168 generalized place invariants in 38 ms returned sat
[2021-05-08 01:20:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:20:21] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2021-05-08 01:20:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:20:21] [INFO ] [Nat]Absence check using 56 positive place invariants in 19 ms returned sat
[2021-05-08 01:20:21] [INFO ] [Nat]Absence check using 56 positive and 168 generalized place invariants in 36 ms returned sat
[2021-05-08 01:20:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:20:23] [INFO ] [Nat]Absence check using state equation in 1650 ms returned sat
[2021-05-08 01:20:23] [INFO ] Deduced a trap composed of 120 places in 340 ms of which 1 ms to minimize.
[2021-05-08 01:20:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 461 ms
[2021-05-08 01:20:23] [INFO ] Computed and/alt/rep : 867/3277/867 causal constraints (skipped 1267 transitions) in 120 ms.
[2021-05-08 01:20:32] [INFO ] Added : 110 causal constraints over 22 iterations in 8746 ms. Result :unknown
[2021-05-08 01:20:32] [INFO ] [Real]Absence check using 56 positive place invariants in 16 ms returned sat
[2021-05-08 01:20:32] [INFO ] [Real]Absence check using 56 positive and 168 generalized place invariants in 34 ms returned sat
[2021-05-08 01:20:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:20:33] [INFO ] [Real]Absence check using state equation in 607 ms returned sat
[2021-05-08 01:20:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:20:33] [INFO ] [Nat]Absence check using 56 positive place invariants in 17 ms returned sat
[2021-05-08 01:20:33] [INFO ] [Nat]Absence check using 56 positive and 168 generalized place invariants in 33 ms returned sat
[2021-05-08 01:20:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:20:34] [INFO ] [Nat]Absence check using state equation in 978 ms returned sat
[2021-05-08 01:20:34] [INFO ] Computed and/alt/rep : 867/3277/867 causal constraints (skipped 1267 transitions) in 126 ms.
[2021-05-08 01:20:45] [INFO ] Added : 392 causal constraints over 79 iterations in 10790 ms. Result :sat
Minimization took 826 ms.
[2021-05-08 01:20:46] [INFO ] [Real]Absence check using 56 positive place invariants in 17 ms returned sat
[2021-05-08 01:20:46] [INFO ] [Real]Absence check using 56 positive and 168 generalized place invariants in 36 ms returned sat
[2021-05-08 01:20:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:20:47] [INFO ] [Real]Absence check using state equation in 635 ms returned sat
[2021-05-08 01:20:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:20:47] [INFO ] [Nat]Absence check using 56 positive place invariants in 17 ms returned sat
[2021-05-08 01:20:47] [INFO ] [Nat]Absence check using 56 positive and 168 generalized place invariants in 34 ms returned sat
[2021-05-08 01:20:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:20:49] [INFO ] [Nat]Absence check using state equation in 2143 ms returned sat
[2021-05-08 01:20:49] [INFO ] Computed and/alt/rep : 867/3277/867 causal constraints (skipped 1267 transitions) in 120 ms.
[2021-05-08 01:20:54] [INFO ] Added : 170 causal constraints over 36 iterations in 4717 ms. Result :sat
Minimization took 749 ms.
[2021-05-08 01:20:55] [INFO ] [Real]Absence check using 56 positive place invariants in 16 ms returned sat
[2021-05-08 01:20:55] [INFO ] [Real]Absence check using 56 positive and 168 generalized place invariants in 34 ms returned sat
[2021-05-08 01:20:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:20:55] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2021-05-08 01:20:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:20:56] [INFO ] [Nat]Absence check using 56 positive place invariants in 18 ms returned sat
[2021-05-08 01:20:56] [INFO ] [Nat]Absence check using 56 positive and 168 generalized place invariants in 34 ms returned sat
[2021-05-08 01:20:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:20:56] [INFO ] [Nat]Absence check using state equation in 773 ms returned sat
[2021-05-08 01:20:57] [INFO ] Computed and/alt/rep : 867/3277/867 causal constraints (skipped 1267 transitions) in 120 ms.
[2021-05-08 01:21:07] [INFO ] Added : 515 causal constraints over 103 iterations in 11038 ms. Result :sat
Minimization took 787 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 360500 steps, including 4524 resets, run finished after 1721 ms. (steps per millisecond=209 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 426000 steps, including 5106 resets, run finished after 2021 ms. (steps per millisecond=210 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 224200 steps, including 3218 resets, run finished after 1040 ms. (steps per millisecond=215 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 916100 steps, including 5958 resets, run finished after 4084 ms. (steps per millisecond=224 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 176100 steps, including 1897 resets, run finished after 767 ms. (steps per millisecond=229 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 5 out of 1289 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1289/1289 places, 2179/2179 transitions.
Applied a total of 0 rules in 59 ms. Remains 1289 /1289 variables (removed 0) and now considering 2179/2179 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1289/1289 places, 2179/2179 transitions.
Starting structural reductions, iteration 0 : 1289/1289 places, 2179/2179 transitions.
Applied a total of 0 rules in 43 ms. Remains 1289 /1289 variables (removed 0) and now considering 2179/2179 (removed 0) transitions.
// Phase 1: matrix 2179 rows 1289 cols
[2021-05-08 01:21:18] [INFO ] Computed 224 place invariants in 42 ms
[2021-05-08 01:21:19] [INFO ] Implicit Places using invariants in 988 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 271, 272, 273, 291, 309, 378, 382, 383, 394, 395, 396, 414, 432, 501, 505, 506, 517, 518, 519, 537, 555, 624, 628, 629, 640, 641, 642, 660, 678, 747, 751, 752, 763, 764, 765, 783, 801, 870, 874, 875, 886, 887, 888, 906, 924, 993, 997, 998, 1009, 1010, 1011, 1029, 1047, 1116, 1120, 1121, 1124, 1135, 1136, 1137, 1155, 1157, 1160, 1178, 1179, 1180, 1181, 1193, 1199, 1205, 1211, 1217, 1223, 1229, 1235, 1241, 1247, 1253]
Discarding 94 places :
Implicit Place search using SMT only with invariants took 992 ms to find 94 implicit places.
[2021-05-08 01:21:19] [INFO ] Redundant transitions in 151 ms returned []
// Phase 1: matrix 2179 rows 1195 cols
[2021-05-08 01:21:19] [INFO ] Computed 130 place invariants in 25 ms
[2021-05-08 01:21:20] [INFO ] Dead Transitions using invariants and state equation in 952 ms returned []
Starting structural reductions, iteration 1 : 1195/1289 places, 2179/2179 transitions.
Drop transitions removed 166 transitions
Trivial Post-agglo rules discarded 166 transitions
Performed 166 trivial Post agglomeration. Transition count delta: 166
Iterating post reduction 0 with 166 rules applied. Total rules applied 166 place count 1195 transition count 2013
Reduce places removed 166 places and 0 transitions.
Iterating post reduction 1 with 166 rules applied. Total rules applied 332 place count 1029 transition count 2013
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 43 Pre rules applied. Total rules applied 332 place count 1029 transition count 1970
Deduced a syphon composed of 43 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 87 rules applied. Total rules applied 419 place count 985 transition count 1970
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 2 with 12 rules applied. Total rules applied 431 place count 981 transition count 1962
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 439 place count 973 transition count 1962
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 454 place count 958 transition count 1947
Iterating global reduction 4 with 15 rules applied. Total rules applied 469 place count 958 transition count 1947
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 472 place count 958 transition count 1944
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 472 place count 958 transition count 1943
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 474 place count 957 transition count 1943
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 477 place count 954 transition count 1940
Iterating global reduction 5 with 3 rules applied. Total rules applied 480 place count 954 transition count 1940
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 481 place count 953 transition count 1939
Iterating global reduction 5 with 1 rules applied. Total rules applied 482 place count 953 transition count 1939
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 483 place count 952 transition count 1938
Iterating global reduction 5 with 1 rules applied. Total rules applied 484 place count 952 transition count 1938
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 2 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 630 place count 879 transition count 1865
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 638 place count 879 transition count 1857
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 646 place count 871 transition count 1849
Iterating global reduction 6 with 8 rules applied. Total rules applied 654 place count 871 transition count 1849
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 662 place count 871 transition count 1841
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 663 place count 871 transition count 1840
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 7 with 20 rules applied. Total rules applied 683 place count 871 transition count 1820
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 704 place count 850 transition count 1820
Partial Free-agglomeration rule applied 27 times.
Drop transitions removed 27 transitions
Iterating global reduction 8 with 27 rules applied. Total rules applied 731 place count 850 transition count 1820
Applied a total of 731 rules in 419 ms. Remains 850 /1195 variables (removed 345) and now considering 1820/2179 (removed 359) transitions.
// Phase 1: matrix 1820 rows 850 cols
[2021-05-08 01:21:21] [INFO ] Computed 124 place invariants in 22 ms
[2021-05-08 01:21:21] [INFO ] Implicit Places using invariants in 556 ms returned [72, 89, 95, 98, 100, 103, 104, 156, 173, 179, 182, 184, 189, 190, 242, 259, 265, 268, 270, 275, 276, 328, 345, 351, 354, 356, 361, 362, 414, 431, 437, 440, 442, 447, 448, 517, 523, 526, 528, 534, 535, 587, 604, 610, 613, 615, 620, 621, 673, 690, 696, 699, 701, 706, 707, 759, 776, 782, 785, 787]
Discarding 60 places :
Implicit Place search using SMT only with invariants took 560 ms to find 60 implicit places.
Starting structural reductions, iteration 2 : 790/1289 places, 1820/2179 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 764 transition count 1794
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 764 transition count 1794
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 756 transition count 1786
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 756 transition count 1786
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 0 with 34 rules applied. Total rules applied 102 place count 739 transition count 1769
Free-agglomeration rule applied 27 times.
Iterating global reduction 0 with 27 rules applied. Total rules applied 129 place count 739 transition count 1742
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 156 place count 712 transition count 1742
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 164 place count 712 transition count 1734
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 172 place count 704 transition count 1734
Applied a total of 172 rules in 159 ms. Remains 704 /790 variables (removed 86) and now considering 1734/1820 (removed 86) transitions.
// Phase 1: matrix 1734 rows 704 cols
[2021-05-08 01:21:21] [INFO ] Computed 64 place invariants in 18 ms
[2021-05-08 01:21:22] [INFO ] Implicit Places using invariants in 517 ms returned []
// Phase 1: matrix 1734 rows 704 cols
[2021-05-08 01:21:22] [INFO ] Computed 64 place invariants in 18 ms
[2021-05-08 01:21:23] [INFO ] Implicit Places using invariants and state equation in 1565 ms returned []
Implicit Place search using SMT with State Equation took 2095 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 704/1289 places, 1734/2179 transitions.
Successfully produced net in file /tmp/petri1000_753399452051488871.dot
Successfully produced net in file /tmp/petri1001_5142441190725043978.dot
Successfully produced net in file /tmp/petri1002_407198729858545738.dot
Successfully produced net in file /tmp/petri1003_7109345637228738274.dot
Successfully produced net in file /tmp/petri1004_2426214864709148107.dot
Successfully produced net in file /tmp/petri1005_9279283648904486809.dot
Successfully produced net in file /tmp/petri1006_15663233231230380223.dot
Successfully produced net in file /tmp/petri1007_9010860177305358827.dot
Successfully produced net in file /tmp/petri1008_15185535891229746581.dot
Successfully produced net in file /tmp/petri1009_3817173617738480755.dot
Drop transitions removed 10 transitions
Dominated transitions for bounds rules discarded 10 transitions
// Phase 1: matrix 1724 rows 704 cols
[2021-05-08 01:21:24] [INFO ] Computed 64 place invariants in 30 ms
Incomplete random walk after 1000000 steps, including 16642 resets, run finished after 3584 ms. (steps per millisecond=279 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2527 resets, run finished after 1022 ms. (steps per millisecond=978 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2545 resets, run finished after 1035 ms. (steps per millisecond=966 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2530 resets, run finished after 1026 ms. (steps per millisecond=974 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2544 resets, run finished after 1024 ms. (steps per millisecond=976 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2530 resets, run finished after 1023 ms. (steps per millisecond=977 ) properties (out of 5) seen :0
// Phase 1: matrix 1724 rows 704 cols
[2021-05-08 01:21:32] [INFO ] Computed 64 place invariants in 28 ms
[2021-05-08 01:21:32] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:21:32] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 13 ms returned sat
[2021-05-08 01:21:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:21:33] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2021-05-08 01:21:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:21:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2021-05-08 01:21:33] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 14 ms returned sat
[2021-05-08 01:21:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:21:33] [INFO ] [Nat]Absence check using state equation in 416 ms returned sat
[2021-05-08 01:21:33] [INFO ] Computed and/alt/rep : 396/1690/396 causal constraints (skipped 1286 transitions) in 110 ms.
[2021-05-08 01:21:34] [INFO ] Added : 19 causal constraints over 4 iterations in 438 ms. Result :sat
Minimization took 175 ms.
[2021-05-08 01:21:34] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:21:34] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 13 ms returned sat
[2021-05-08 01:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:21:35] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2021-05-08 01:21:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:21:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:21:35] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 13 ms returned sat
[2021-05-08 01:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:21:35] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2021-05-08 01:21:35] [INFO ] Computed and/alt/rep : 396/1690/396 causal constraints (skipped 1286 transitions) in 114 ms.
[2021-05-08 01:21:36] [INFO ] Added : 40 causal constraints over 8 iterations in 952 ms. Result :sat
Minimization took 203 ms.
[2021-05-08 01:21:37] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:21:37] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 14 ms returned sat
[2021-05-08 01:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:21:37] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2021-05-08 01:21:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:21:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:21:37] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 13 ms returned sat
[2021-05-08 01:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:21:38] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2021-05-08 01:21:38] [INFO ] Computed and/alt/rep : 396/1690/396 causal constraints (skipped 1286 transitions) in 100 ms.
[2021-05-08 01:21:39] [INFO ] Added : 78 causal constraints over 16 iterations in 1406 ms. Result :sat
Minimization took 328 ms.
[2021-05-08 01:21:40] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:21:40] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 13 ms returned sat
[2021-05-08 01:21:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:21:40] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2021-05-08 01:21:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:21:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:21:40] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 13 ms returned sat
[2021-05-08 01:21:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:21:41] [INFO ] [Nat]Absence check using state equation in 795 ms returned sat
[2021-05-08 01:21:41] [INFO ] Computed and/alt/rep : 396/1690/396 causal constraints (skipped 1286 transitions) in 87 ms.
[2021-05-08 01:21:42] [INFO ] Added : 65 causal constraints over 13 iterations in 1333 ms. Result :sat
Minimization took 375 ms.
[2021-05-08 01:21:43] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:21:43] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 12 ms returned sat
[2021-05-08 01:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:21:43] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2021-05-08 01:21:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:21:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:21:44] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 13 ms returned sat
[2021-05-08 01:21:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:21:44] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2021-05-08 01:21:44] [INFO ] Computed and/alt/rep : 396/1690/396 causal constraints (skipped 1286 transitions) in 90 ms.
[2021-05-08 01:21:46] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2021-05-08 01:21:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2021-05-08 01:21:46] [INFO ] Added : 82 causal constraints over 17 iterations in 1936 ms. Result :sat
Minimization took 185 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 167600 steps, including 2620 resets, run finished after 615 ms. (steps per millisecond=272 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 151200 steps, including 2687 resets, run finished after 554 ms. (steps per millisecond=272 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 146500 steps, including 3500 resets, run finished after 520 ms. (steps per millisecond=281 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 64200 steps, including 1364 resets, run finished after 231 ms. (steps per millisecond=277 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 57200 steps, including 1571 resets, run finished after 178 ms. (steps per millisecond=321 ) properties (out of 5) seen :0 could not realise parikh vector
Support contains 5 out of 704 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 704/704 places, 1724/1724 transitions.
Graph (complete) has 4279 edges and 704 vertex of which 695 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.3 ms
Discarding 9 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 10 place count 695 transition count 1724
Applied a total of 10 rules in 54 ms. Remains 695 /704 variables (removed 9) and now considering 1724/1724 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 695/704 places, 1724/1724 transitions.
// Phase 1: matrix 1724 rows 695 cols
[2021-05-08 01:21:48] [INFO ] Computed 64 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 16673 resets, run finished after 3598 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2538 resets, run finished after 985 ms. (steps per millisecond=1015 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2521 resets, run finished after 977 ms. (steps per millisecond=1023 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2550 resets, run finished after 976 ms. (steps per millisecond=1024 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2533 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 2555 resets, run finished after 983 ms. (steps per millisecond=1017 ) properties (out of 5) seen :0
// Phase 1: matrix 1724 rows 695 cols
[2021-05-08 01:21:57] [INFO ] Computed 64 place invariants in 18 ms
[2021-05-08 01:21:57] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-08 01:21:57] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 13 ms returned sat
[2021-05-08 01:21:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:21:58] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2021-05-08 01:21:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:21:58] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:21:58] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 12 ms returned sat
[2021-05-08 01:21:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:21:58] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2021-05-08 01:21:58] [INFO ] Computed and/alt/rep : 396/1688/396 causal constraints (skipped 1286 transitions) in 106 ms.
[2021-05-08 01:21:59] [INFO ] Added : 34 causal constraints over 8 iterations in 971 ms. Result :sat
Minimization took 238 ms.
[2021-05-08 01:21:59] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:21:59] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 13 ms returned sat
[2021-05-08 01:21:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:00] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2021-05-08 01:22:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:22:00] [INFO ] [Nat]Absence check using 14 positive place invariants in 11 ms returned sat
[2021-05-08 01:22:00] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 14 ms returned sat
[2021-05-08 01:22:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:01] [INFO ] [Nat]Absence check using state equation in 909 ms returned sat
[2021-05-08 01:22:01] [INFO ] Computed and/alt/rep : 396/1688/396 causal constraints (skipped 1286 transitions) in 95 ms.
[2021-05-08 01:22:03] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2021-05-08 01:22:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2021-05-08 01:22:03] [INFO ] Added : 69 causal constraints over 14 iterations in 2091 ms. Result :sat
Minimization took 370 ms.
[2021-05-08 01:22:04] [INFO ] [Real]Absence check using 14 positive place invariants in 42 ms returned sat
[2021-05-08 01:22:04] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 13 ms returned sat
[2021-05-08 01:22:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:04] [INFO ] [Real]Absence check using state equation in 400 ms returned sat
[2021-05-08 01:22:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:22:04] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:22:04] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 12 ms returned sat
[2021-05-08 01:22:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:05] [INFO ] [Nat]Absence check using state equation in 444 ms returned sat
[2021-05-08 01:22:05] [INFO ] Computed and/alt/rep : 396/1688/396 causal constraints (skipped 1286 transitions) in 92 ms.
[2021-05-08 01:22:06] [INFO ] Added : 21 causal constraints over 5 iterations in 778 ms. Result :sat
Minimization took 245 ms.
[2021-05-08 01:22:06] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:22:06] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 13 ms returned sat
[2021-05-08 01:22:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:06] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2021-05-08 01:22:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:22:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:22:06] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 13 ms returned sat
[2021-05-08 01:22:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:07] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2021-05-08 01:22:07] [INFO ] Computed and/alt/rep : 396/1688/396 causal constraints (skipped 1286 transitions) in 125 ms.
[2021-05-08 01:22:09] [INFO ] Added : 62 causal constraints over 13 iterations in 1815 ms. Result :sat
Minimization took 477 ms.
[2021-05-08 01:22:09] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:22:09] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 13 ms returned sat
[2021-05-08 01:22:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:10] [INFO ] [Real]Absence check using state equation in 373 ms returned sat
[2021-05-08 01:22:10] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:22:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:22:10] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 12 ms returned sat
[2021-05-08 01:22:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:10] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2021-05-08 01:22:10] [INFO ] Computed and/alt/rep : 396/1688/396 causal constraints (skipped 1286 transitions) in 92 ms.
[2021-05-08 01:22:12] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2021-05-08 01:22:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 186 ms
[2021-05-08 01:22:12] [INFO ] Added : 61 causal constraints over 13 iterations in 1365 ms. Result :sat
Minimization took 371 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 162500 steps, including 3412 resets, run finished after 704 ms. (steps per millisecond=230 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 180100 steps, including 3760 resets, run finished after 664 ms. (steps per millisecond=271 ) properties (out of 5) seen :2 could not realise parikh vector
FORMULA ASLink-PT-09a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-09a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 96400 steps, including 2510 resets, run finished after 346 ms. (steps per millisecond=278 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 163700 steps, including 1823 resets, run finished after 592 ms. (steps per millisecond=276 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 138200 steps, including 4460 resets, run finished after 490 ms. (steps per millisecond=282 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 695 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 695/695 places, 1724/1724 transitions.
Applied a total of 0 rules in 26 ms. Remains 695 /695 variables (removed 0) and now considering 1724/1724 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 695/695 places, 1724/1724 transitions.
// Phase 1: matrix 1724 rows 695 cols
[2021-05-08 01:22:15] [INFO ] Computed 64 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 16554 resets, run finished after 3409 ms. (steps per millisecond=293 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2538 resets, run finished after 1063 ms. (steps per millisecond=940 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2529 resets, run finished after 1000 ms. (steps per millisecond=1000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2533 resets, run finished after 1008 ms. (steps per millisecond=992 ) properties (out of 3) seen :0
// Phase 1: matrix 1724 rows 695 cols
[2021-05-08 01:22:22] [INFO ] Computed 64 place invariants in 17 ms
[2021-05-08 01:22:22] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:22:22] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 21 ms returned sat
[2021-05-08 01:22:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:22] [INFO ] [Real]Absence check using state equation in 471 ms returned sat
[2021-05-08 01:22:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:22:22] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2021-05-08 01:22:22] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 13 ms returned sat
[2021-05-08 01:22:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:23] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2021-05-08 01:22:23] [INFO ] Computed and/alt/rep : 396/1688/396 causal constraints (skipped 1286 transitions) in 107 ms.
[2021-05-08 01:22:24] [INFO ] Added : 34 causal constraints over 8 iterations in 964 ms. Result :sat
Minimization took 241 ms.
[2021-05-08 01:22:24] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2021-05-08 01:22:24] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 16 ms returned sat
[2021-05-08 01:22:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:24] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2021-05-08 01:22:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:22:25] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2021-05-08 01:22:25] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 12 ms returned sat
[2021-05-08 01:22:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:25] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2021-05-08 01:22:25] [INFO ] Computed and/alt/rep : 396/1688/396 causal constraints (skipped 1286 transitions) in 89 ms.
[2021-05-08 01:22:27] [INFO ] Added : 62 causal constraints over 13 iterations in 1778 ms. Result :sat
Minimization took 476 ms.
[2021-05-08 01:22:28] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:22:28] [INFO ] [Real]Absence check using 14 positive and 50 generalized place invariants in 13 ms returned sat
[2021-05-08 01:22:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:28] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2021-05-08 01:22:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:22:28] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2021-05-08 01:22:28] [INFO ] [Nat]Absence check using 14 positive and 50 generalized place invariants in 12 ms returned sat
[2021-05-08 01:22:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:28] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2021-05-08 01:22:29] [INFO ] Computed and/alt/rep : 396/1688/396 causal constraints (skipped 1286 transitions) in 94 ms.
[2021-05-08 01:22:30] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2021-05-08 01:22:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2021-05-08 01:22:30] [INFO ] Added : 61 causal constraints over 13 iterations in 1275 ms. Result :sat
Minimization took 375 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 162500 steps, including 3422 resets, run finished after 558 ms. (steps per millisecond=291 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 180100 steps, including 3768 resets, run finished after 656 ms. (steps per millisecond=274 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA ASLink-PT-09a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 138200 steps, including 4473 resets, run finished after 456 ms. (steps per millisecond=303 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 695 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 695/695 places, 1724/1724 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 694 transition count 1723
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 694 transition count 1723
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 694 transition count 1722
Applied a total of 3 rules in 55 ms. Remains 694 /695 variables (removed 1) and now considering 1722/1724 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 694/695 places, 1722/1724 transitions.
// Phase 1: matrix 1722 rows 694 cols
[2021-05-08 01:22:32] [INFO ] Computed 64 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 16579 resets, run finished after 3471 ms. (steps per millisecond=288 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2529 resets, run finished after 998 ms. (steps per millisecond=1002 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2530 resets, run finished after 990 ms. (steps per millisecond=1010 ) properties (out of 2) seen :0
// Phase 1: matrix 1722 rows 694 cols
[2021-05-08 01:22:37] [INFO ] Computed 64 place invariants in 18 ms
[2021-05-08 01:22:37] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2021-05-08 01:22:38] [INFO ] [Real]Absence check using 16 positive and 48 generalized place invariants in 13 ms returned sat
[2021-05-08 01:22:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:38] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2021-05-08 01:22:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:22:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2021-05-08 01:22:38] [INFO ] [Nat]Absence check using 16 positive and 48 generalized place invariants in 11 ms returned sat
[2021-05-08 01:22:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:39] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2021-05-08 01:22:39] [INFO ] Computed and/alt/rep : 401/1733/401 causal constraints (skipped 1279 transitions) in 94 ms.
[2021-05-08 01:22:41] [INFO ] Added : 52 causal constraints over 11 iterations in 2113 ms. Result :sat
Minimization took 499 ms.
[2021-05-08 01:22:41] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2021-05-08 01:22:41] [INFO ] [Real]Absence check using 16 positive and 48 generalized place invariants in 12 ms returned sat
[2021-05-08 01:22:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:42] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2021-05-08 01:22:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:22:42] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2021-05-08 01:22:42] [INFO ] [Nat]Absence check using 16 positive and 48 generalized place invariants in 12 ms returned sat
[2021-05-08 01:22:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:42] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2021-05-08 01:22:42] [INFO ] Computed and/alt/rep : 401/1733/401 causal constraints (skipped 1279 transitions) in 107 ms.
[2021-05-08 01:22:44] [INFO ] Added : 89 causal constraints over 19 iterations in 1455 ms. Result :sat
Minimization took 182 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 135900 steps, including 2860 resets, run finished after 492 ms. (steps per millisecond=276 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 145500 steps, including 4432 resets, run finished after 506 ms. (steps per millisecond=287 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 694 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 694/694 places, 1722/1722 transitions.
Applied a total of 0 rules in 27 ms. Remains 694 /694 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 694/694 places, 1722/1722 transitions.
Starting structural reductions, iteration 0 : 694/694 places, 1722/1722 transitions.
Applied a total of 0 rules in 28 ms. Remains 694 /694 variables (removed 0) and now considering 1722/1722 (removed 0) transitions.
// Phase 1: matrix 1722 rows 694 cols
[2021-05-08 01:22:45] [INFO ] Computed 64 place invariants in 28 ms
[2021-05-08 01:22:46] [INFO ] Implicit Places using invariants in 431 ms returned [412]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 446 ms to find 1 implicit places.
[2021-05-08 01:22:46] [INFO ] Redundant transitions in 86 ms returned []
// Phase 1: matrix 1722 rows 693 cols
[2021-05-08 01:22:46] [INFO ] Computed 63 place invariants in 19 ms
[2021-05-08 01:22:46] [INFO ] Dead Transitions using invariants and state equation in 730 ms returned []
Starting structural reductions, iteration 1 : 693/694 places, 1722/1722 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 692 transition count 1721
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 692 transition count 1720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 691 transition count 1720
Applied a total of 4 rules in 70 ms. Remains 691 /693 variables (removed 2) and now considering 1720/1722 (removed 2) transitions.
// Phase 1: matrix 1720 rows 691 cols
[2021-05-08 01:22:46] [INFO ] Computed 63 place invariants in 21 ms
[2021-05-08 01:22:47] [INFO ] Implicit Places using invariants in 455 ms returned []
// Phase 1: matrix 1720 rows 691 cols
[2021-05-08 01:22:47] [INFO ] Computed 63 place invariants in 19 ms
[2021-05-08 01:22:48] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 1891 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 691/694 places, 1720/1722 transitions.
// Phase 1: matrix 1720 rows 691 cols
[2021-05-08 01:22:48] [INFO ] Computed 63 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 16521 resets, run finished after 3401 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2531 resets, run finished after 996 ms. (steps per millisecond=1004 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2519 resets, run finished after 1004 ms. (steps per millisecond=996 ) properties (out of 2) seen :0
// Phase 1: matrix 1720 rows 691 cols
[2021-05-08 01:22:54] [INFO ] Computed 63 place invariants in 17 ms
[2021-05-08 01:22:54] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:22:54] [INFO ] [Real]Absence check using 14 positive and 49 generalized place invariants in 13 ms returned sat
[2021-05-08 01:22:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:54] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2021-05-08 01:22:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:22:54] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-08 01:22:54] [INFO ] [Nat]Absence check using 14 positive and 49 generalized place invariants in 12 ms returned sat
[2021-05-08 01:22:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:55] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2021-05-08 01:22:55] [INFO ] Computed and/alt/rep : 392/1660/392 causal constraints (skipped 1286 transitions) in 87 ms.
[2021-05-08 01:22:56] [INFO ] Added : 33 causal constraints over 7 iterations in 697 ms. Result :sat
Minimization took 360 ms.
[2021-05-08 01:22:56] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-08 01:22:56] [INFO ] [Real]Absence check using 14 positive and 49 generalized place invariants in 12 ms returned sat
[2021-05-08 01:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:57] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2021-05-08 01:22:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:22:57] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-08 01:22:57] [INFO ] [Nat]Absence check using 14 positive and 49 generalized place invariants in 12 ms returned sat
[2021-05-08 01:22:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:22:57] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2021-05-08 01:22:57] [INFO ] Computed and/alt/rep : 392/1660/392 causal constraints (skipped 1286 transitions) in 90 ms.
[2021-05-08 01:23:00] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 0 ms to minimize.
[2021-05-08 01:23:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2021-05-08 01:23:00] [INFO ] Added : 118 causal constraints over 24 iterations in 2518 ms. Result :sat
Minimization took 213 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 197000 steps, including 4313 resets, run finished after 703 ms. (steps per millisecond=280 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 126100 steps, including 2014 resets, run finished after 437 ms. (steps per millisecond=288 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA ASLink-PT-09a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 691/691 places, 1720/1720 transitions.
Applied a total of 0 rules in 25 ms. Remains 691 /691 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 691/691 places, 1720/1720 transitions.
// Phase 1: matrix 1720 rows 691 cols
[2021-05-08 01:23:01] [INFO ] Computed 63 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 16435 resets, run finished after 3449 ms. (steps per millisecond=289 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2564 resets, run finished after 996 ms. (steps per millisecond=1004 ) properties (out of 1) seen :0
// Phase 1: matrix 1720 rows 691 cols
[2021-05-08 01:23:06] [INFO ] Computed 63 place invariants in 18 ms
[2021-05-08 01:23:06] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-08 01:23:06] [INFO ] [Real]Absence check using 14 positive and 49 generalized place invariants in 23 ms returned sat
[2021-05-08 01:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:23:06] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2021-05-08 01:23:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:23:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:23:06] [INFO ] [Nat]Absence check using 14 positive and 49 generalized place invariants in 13 ms returned sat
[2021-05-08 01:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:23:07] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2021-05-08 01:23:07] [INFO ] Computed and/alt/rep : 392/1660/392 causal constraints (skipped 1286 transitions) in 105 ms.
[2021-05-08 01:23:09] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 0 ms to minimize.
[2021-05-08 01:23:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2021-05-08 01:23:09] [INFO ] Added : 118 causal constraints over 24 iterations in 2591 ms. Result :sat
Minimization took 215 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 197000 steps, including 4300 resets, run finished after 697 ms. (steps per millisecond=282 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 691/691 places, 1720/1720 transitions.
Applied a total of 0 rules in 27 ms. Remains 691 /691 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 691/691 places, 1720/1720 transitions.
Starting structural reductions, iteration 0 : 691/691 places, 1720/1720 transitions.
Applied a total of 0 rules in 27 ms. Remains 691 /691 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
// Phase 1: matrix 1720 rows 691 cols
[2021-05-08 01:23:10] [INFO ] Computed 63 place invariants in 18 ms
[2021-05-08 01:23:11] [INFO ] Implicit Places using invariants in 463 ms returned []
// Phase 1: matrix 1720 rows 691 cols
[2021-05-08 01:23:11] [INFO ] Computed 63 place invariants in 17 ms
[2021-05-08 01:23:12] [INFO ] Implicit Places using invariants and state equation in 1362 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
[2021-05-08 01:23:12] [INFO ] Redundant transitions in 33 ms returned []
// Phase 1: matrix 1720 rows 691 cols
[2021-05-08 01:23:12] [INFO ] Computed 63 place invariants in 17 ms
[2021-05-08 01:23:13] [INFO ] Dead Transitions using invariants and state equation in 655 ms returned []
Finished structural reductions, in 1 iterations. Remains : 691/691 places, 1720/1720 transitions.
Starting property specific reduction for ASLink-PT-09a-UpperBounds-11
// Phase 1: matrix 1720 rows 691 cols
[2021-05-08 01:23:13] [INFO ] Computed 63 place invariants in 18 ms
Incomplete random walk after 10000 steps, including 171 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 1720 rows 691 cols
[2021-05-08 01:23:13] [INFO ] Computed 63 place invariants in 17 ms
[2021-05-08 01:23:13] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:23:13] [INFO ] [Real]Absence check using 14 positive and 49 generalized place invariants in 13 ms returned sat
[2021-05-08 01:23:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:23:13] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2021-05-08 01:23:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:23:14] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:23:14] [INFO ] [Nat]Absence check using 14 positive and 49 generalized place invariants in 13 ms returned sat
[2021-05-08 01:23:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:23:14] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2021-05-08 01:23:14] [INFO ] Computed and/alt/rep : 392/1660/392 causal constraints (skipped 1286 transitions) in 110 ms.
[2021-05-08 01:23:16] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 0 ms to minimize.
[2021-05-08 01:23:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2021-05-08 01:23:17] [INFO ] Added : 118 causal constraints over 24 iterations in 2573 ms. Result :sat
Minimization took 216 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 197000 steps, including 4261 resets, run finished after 706 ms. (steps per millisecond=279 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 691/691 places, 1720/1720 transitions.
Applied a total of 0 rules in 25 ms. Remains 691 /691 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 691/691 places, 1720/1720 transitions.
// Phase 1: matrix 1720 rows 691 cols
[2021-05-08 01:23:18] [INFO ] Computed 63 place invariants in 30 ms
Incomplete random walk after 1000000 steps, including 16688 resets, run finished after 3418 ms. (steps per millisecond=292 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2523 resets, run finished after 1001 ms. (steps per millisecond=999 ) properties (out of 1) seen :0
// Phase 1: matrix 1720 rows 691 cols
[2021-05-08 01:23:22] [INFO ] Computed 63 place invariants in 17 ms
[2021-05-08 01:23:22] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2021-05-08 01:23:22] [INFO ] [Real]Absence check using 14 positive and 49 generalized place invariants in 12 ms returned sat
[2021-05-08 01:23:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:23:23] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2021-05-08 01:23:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:23:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2021-05-08 01:23:23] [INFO ] [Nat]Absence check using 14 positive and 49 generalized place invariants in 12 ms returned sat
[2021-05-08 01:23:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:23:23] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2021-05-08 01:23:23] [INFO ] Computed and/alt/rep : 392/1660/392 causal constraints (skipped 1286 transitions) in 89 ms.
[2021-05-08 01:23:25] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 0 ms to minimize.
[2021-05-08 01:23:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2021-05-08 01:23:26] [INFO ] Added : 118 causal constraints over 24 iterations in 2582 ms. Result :sat
Minimization took 214 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 197000 steps, including 4276 resets, run finished after 703 ms. (steps per millisecond=280 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 691/691 places, 1720/1720 transitions.
Applied a total of 0 rules in 27 ms. Remains 691 /691 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 691/691 places, 1720/1720 transitions.
Starting structural reductions, iteration 0 : 691/691 places, 1720/1720 transitions.
Applied a total of 0 rules in 27 ms. Remains 691 /691 variables (removed 0) and now considering 1720/1720 (removed 0) transitions.
// Phase 1: matrix 1720 rows 691 cols
[2021-05-08 01:23:27] [INFO ] Computed 63 place invariants in 17 ms
[2021-05-08 01:23:27] [INFO ] Implicit Places using invariants in 391 ms returned []
// Phase 1: matrix 1720 rows 691 cols
[2021-05-08 01:23:27] [INFO ] Computed 63 place invariants in 18 ms
[2021-05-08 01:23:28] [INFO ] Implicit Places using invariants and state equation in 1340 ms returned []
Implicit Place search using SMT with State Equation took 1760 ms to find 0 implicit places.
[2021-05-08 01:23:28] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 1720 rows 691 cols
[2021-05-08 01:23:28] [INFO ] Computed 63 place invariants in 17 ms
[2021-05-08 01:23:29] [INFO ] Dead Transitions using invariants and state equation in 642 ms returned []
Finished structural reductions, in 1 iterations. Remains : 691/691 places, 1720/1720 transitions.
Ending property specific reduction for ASLink-PT-09a-UpperBounds-11 in 16263 ms.
[2021-05-08 01:23:29] [INFO ] Flatten gal took : 201 ms
[2021-05-08 01:23:30] [INFO ] Applying decomposition
[2021-05-08 01:23:30] [INFO ] Flatten gal took : 121 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph15495090203162391845.txt, -o, /tmp/graph15495090203162391845.bin, -w, /tmp/graph15495090203162391845.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph15495090203162391845.bin, -l, -1, -v, -w, /tmp/graph15495090203162391845.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 01:23:30] [INFO ] Decomposing Gal with order
[2021-05-08 01:23:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 01:23:30] [INFO ] Removed a total of 3438 redundant transitions.
[2021-05-08 01:23:30] [INFO ] Flatten gal took : 221 ms
[2021-05-08 01:23:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 35 ms.
[2021-05-08 01:23:30] [INFO ] Time to serialize gal into /tmp/UpperBounds12234922691054511697.gal : 18 ms
[2021-05-08 01:23:30] [INFO ] Time to serialize properties into /tmp/UpperBounds5440922287727918418.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds12234922691054511697.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds5440922287727918418.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds12234922691054511697.gal -t CGAL -reachable-file /tmp/UpperBounds5440922287727918418.prop --nowitness
Loading property file /tmp/UpperBounds5440922287727918418.prop.
Detected timeout of ITS tools.
[2021-05-08 01:45:42] [INFO ] Applying decomposition
[2021-05-08 01:45:42] [INFO ] Flatten gal took : 443 ms
[2021-05-08 01:45:42] [INFO ] Decomposing Gal with order
[2021-05-08 01:45:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 01:45:43] [INFO ] Removed a total of 3256 redundant transitions.
[2021-05-08 01:45:43] [INFO ] Flatten gal took : 471 ms
[2021-05-08 01:45:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 628 labels/synchronizations in 103 ms.
[2021-05-08 01:45:43] [INFO ] Time to serialize gal into /tmp/UpperBounds7115709358054675425.gal : 22 ms
[2021-05-08 01:45:43] [INFO ] Time to serialize properties into /tmp/UpperBounds14084116597644230477.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds7115709358054675425.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14084116597644230477.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds7115709358054675425.gal -t CGAL -reachable-file /tmp/UpperBounds14084116597644230477.prop --nowitness
Loading property file /tmp/UpperBounds14084116597644230477.prop.
Detected timeout of ITS tools.
[2021-05-08 02:07:51] [INFO ] Flatten gal took : 241 ms
[2021-05-08 02:07:54] [INFO ] Input system was already deterministic with 1720 transitions.
[2021-05-08 02:07:54] [INFO ] Transformed 691 places.
[2021-05-08 02:07:54] [INFO ] Transformed 1720 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-08 02:07:54] [INFO ] Time to serialize gal into /tmp/UpperBounds12890251124973554533.gal : 18 ms
[2021-05-08 02:07:54] [INFO ] Time to serialize properties into /tmp/UpperBounds13057491064828595543.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds12890251124973554533.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds13057491064828595543.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds12890251124973554533.gal -t CGAL -reachable-file /tmp/UpperBounds13057491064828595543.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds13057491064828595543.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-09a"
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-09a, 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 r007-tall-162037989600141"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-09a.tgz
mv ASLink-PT-09a execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;