fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r005-oct2-167813592700141
Last Updated
May 14, 2023

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
13787.479 3600000.00 3715304.00 844.50 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/mcc2023-input.r005-oct2-167813592700141.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
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 r005-oct2-167813592700141
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.3K Feb 26 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 13:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 13:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 839K Mar 5 18:22 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 1678501840015

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09a
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-11 02:30:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 02:30:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 02:30:43] [INFO ] Load time of PNML (sax parser for PT used): 214 ms
[2023-03-11 02:30:43] [INFO ] Transformed 1991 places.
[2023-03-11 02:30:43] [INFO ] Transformed 2919 transitions.
[2023-03-11 02:30:43] [INFO ] Found NUPN structural information;
[2023-03-11 02:30:43] [INFO ] Parsed PT model containing 1991 places and 2919 transitions and 10953 arcs in 448 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 31 transitions
Reduce redundant transitions removed 31 transitions.
// Phase 1: matrix 2888 rows 1991 cols
[2023-03-11 02:30:43] [INFO ] Computed 384 place invariants in 109 ms
Incomplete random walk after 10000 steps, including 43 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 16) seen :9
FORMULA ASLink-PT-09a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :1
FORMULA ASLink-PT-09a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
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 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 22 ms. (steps per millisecond=454 ) 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
[2023-03-11 02:30:43] [INFO ] Invariant cache hit.
[2023-03-11 02:30:44] [INFO ] [Real]Absence check using 93 positive place invariants in 53 ms returned sat
[2023-03-11 02:30:44] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 122 ms returned sat
[2023-03-11 02:30:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:30:46] [INFO ] [Real]Absence check using state equation in 2179 ms returned sat
[2023-03-11 02:30:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:30:47] [INFO ] [Nat]Absence check using 93 positive place invariants in 46 ms returned sat
[2023-03-11 02:30:47] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 107 ms returned sat
[2023-03-11 02:30:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:30:51] [INFO ] [Nat]Absence check using state equation in 4521 ms returned unknown
[2023-03-11 02:30:52] [INFO ] [Real]Absence check using 93 positive place invariants in 46 ms returned sat
[2023-03-11 02:30:52] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 127 ms returned sat
[2023-03-11 02:30:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:30:54] [INFO ] [Real]Absence check using state equation in 2015 ms returned sat
[2023-03-11 02:30:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:30:54] [INFO ] [Nat]Absence check using 93 positive place invariants in 41 ms returned sat
[2023-03-11 02:30:55] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 161 ms returned sat
[2023-03-11 02:30:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:30:59] [INFO ] [Nat]Absence check using state equation in 4469 ms returned unknown
[2023-03-11 02:31:00] [INFO ] [Real]Absence check using 93 positive place invariants in 41 ms returned sat
[2023-03-11 02:31:00] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 95 ms returned sat
[2023-03-11 02:31:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:31:01] [INFO ] [Real]Absence check using state equation in 1688 ms returned sat
[2023-03-11 02:31:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:31:02] [INFO ] [Nat]Absence check using 93 positive place invariants in 60 ms returned sat
[2023-03-11 02:31:02] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 232 ms returned sat
[2023-03-11 02:31:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:31:07] [INFO ] [Nat]Absence check using state equation in 4352 ms returned unknown
[2023-03-11 02:31:07] [INFO ] [Real]Absence check using 93 positive place invariants in 153 ms returned sat
[2023-03-11 02:31:07] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 130 ms returned sat
[2023-03-11 02:31:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:31:09] [INFO ] [Real]Absence check using state equation in 1509 ms returned sat
[2023-03-11 02:31:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:31:10] [INFO ] [Nat]Absence check using 93 positive place invariants in 218 ms returned sat
[2023-03-11 02:31:10] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 146 ms returned sat
[2023-03-11 02:31:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:31:14] [INFO ] [Nat]Absence check using state equation in 4199 ms returned unknown
[2023-03-11 02:31:14] [INFO ] [Real]Absence check using 93 positive place invariants in 60 ms returned sat
[2023-03-11 02:31:15] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 108 ms returned sat
[2023-03-11 02:31:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:31:16] [INFO ] [Real]Absence check using state equation in 1887 ms returned sat
[2023-03-11 02:31:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:31:17] [INFO ] [Nat]Absence check using 93 positive place invariants in 42 ms returned sat
[2023-03-11 02:31:17] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 92 ms returned sat
[2023-03-11 02:31:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:31:22] [INFO ] [Nat]Absence check using state equation in 4532 ms returned unknown
[2023-03-11 02:31:22] [INFO ] [Real]Absence check using 93 positive place invariants in 40 ms returned sat
[2023-03-11 02:31:22] [INFO ] [Real]Absence check using 93 positive and 291 generalized place invariants in 143 ms returned sat
[2023-03-11 02:31:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:31:24] [INFO ] [Real]Absence check using state equation in 1741 ms returned sat
[2023-03-11 02:31:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:31:24] [INFO ] [Nat]Absence check using 93 positive place invariants in 40 ms returned sat
[2023-03-11 02:31:25] [INFO ] [Nat]Absence check using 93 positive and 291 generalized place invariants in 151 ms returned sat
[2023-03-11 02:31:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:31:29] [INFO ] [Nat]Absence check using state equation in 4517 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 in REACHABILITY mode, 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 181 transitions
Trivial Post-agglo rules discarded 181 transitions
Performed 181 trivial Post agglomeration. Transition count delta: 181
Iterating post reduction 0 with 235 rules applied. Total rules applied 235 place count 1937 transition count 2707
Reduce places removed 181 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 182 rules applied. Total rules applied 417 place count 1756 transition count 2706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 418 place count 1755 transition count 2706
Performed 188 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 188 Pre rules applied. Total rules applied 418 place count 1755 transition count 2518
Deduced a syphon composed of 188 places in 7 ms
Ensure Unique test removed 74 places
Reduce places removed 262 places and 0 transitions.
Iterating global reduction 3 with 450 rules applied. Total rules applied 868 place count 1493 transition count 2518
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 869 place count 1493 transition count 2517
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 870 place count 1492 transition count 2517
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 882 place count 1480 transition count 2452
Ensure Unique test removed 1 places
Iterating global reduction 5 with 13 rules applied. Total rules applied 895 place count 1479 transition count 2452
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 5 with 6 rules applied. Total rules applied 901 place count 1478 transition count 2447
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 904 place count 1475 transition count 2447
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 905 place count 1474 transition count 2439
Iterating global reduction 7 with 1 rules applied. Total rules applied 906 place count 1474 transition count 2439
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 907 place count 1473 transition count 2431
Iterating global reduction 7 with 1 rules applied. Total rules applied 908 place count 1473 transition count 2431
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 909 place count 1472 transition count 2423
Iterating global reduction 7 with 1 rules applied. Total rules applied 910 place count 1472 transition count 2423
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 911 place count 1471 transition count 2415
Iterating global reduction 7 with 1 rules applied. Total rules applied 912 place count 1471 transition count 2415
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 913 place count 1470 transition count 2407
Iterating global reduction 7 with 1 rules applied. Total rules applied 914 place count 1470 transition count 2407
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 915 place count 1469 transition count 2399
Iterating global reduction 7 with 1 rules applied. Total rules applied 916 place count 1469 transition count 2399
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 917 place count 1468 transition count 2391
Iterating global reduction 7 with 1 rules applied. Total rules applied 918 place count 1468 transition count 2391
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 919 place count 1467 transition count 2383
Iterating global reduction 7 with 1 rules applied. Total rules applied 920 place count 1467 transition count 2383
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 921 place count 1466 transition count 2375
Iterating global reduction 7 with 1 rules applied. Total rules applied 922 place count 1466 transition count 2375
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 923 place count 1465 transition count 2367
Iterating global reduction 7 with 1 rules applied. Total rules applied 924 place count 1465 transition count 2367
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 925 place count 1464 transition count 2359
Iterating global reduction 7 with 1 rules applied. Total rules applied 926 place count 1464 transition count 2359
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 927 place count 1463 transition count 2351
Iterating global reduction 7 with 1 rules applied. Total rules applied 928 place count 1463 transition count 2351
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 929 place count 1462 transition count 2343
Iterating global reduction 7 with 1 rules applied. Total rules applied 930 place count 1462 transition count 2343
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 931 place count 1461 transition count 2335
Iterating global reduction 7 with 1 rules applied. Total rules applied 932 place count 1461 transition count 2335
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 933 place count 1460 transition count 2327
Iterating global reduction 7 with 1 rules applied. Total rules applied 934 place count 1460 transition count 2327
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 935 place count 1459 transition count 2319
Iterating global reduction 7 with 1 rules applied. Total rules applied 936 place count 1459 transition count 2319
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 3 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 7 with 126 rules applied. Total rules applied 1062 place count 1396 transition count 2256
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 1070 place count 1396 transition count 2248
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1078 place count 1388 transition count 2248
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 1088 place count 1388 transition count 2248
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1089 place count 1387 transition count 2247
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 1105 place count 1371 transition count 2247
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 32 Pre rules applied. Total rules applied 1105 place count 1371 transition count 2215
Deduced a syphon composed of 32 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 9 with 65 rules applied. Total rules applied 1170 place count 1338 transition count 2215
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 9 with 9 rules applied. Total rules applied 1179 place count 1329 transition count 2215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1179 place count 1329 transition count 2214
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1181 place count 1328 transition count 2214
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 10 with 18 rules applied. Total rules applied 1199 place count 1319 transition count 2205
Discarding 8 places :
Symmetric choice reduction at 10 with 8 rule applications. Total rules 1207 place count 1311 transition count 2197
Iterating global reduction 10 with 8 rules applied. Total rules applied 1215 place count 1311 transition count 2197
Free-agglomeration rule applied 8 times.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1223 place count 1311 transition count 2189
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 1231 place count 1303 transition count 2189
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 1239 place count 1303 transition count 2189
Applied a total of 1239 rules in 2290 ms. Remains 1303 /1991 variables (removed 688) and now considering 2189/2888 (removed 699) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2291 ms. Remains : 1303/1991 places, 2189/2888 transitions.
// Phase 1: matrix 2189 rows 1303 cols
[2023-03-11 02:31:31] [INFO ] Computed 228 place invariants in 80 ms
Incomplete random walk after 1000000 steps, including 9659 resets, run finished after 4409 ms. (steps per millisecond=226 ) properties (out of 6) seen :1
FORMULA ASLink-PT-09a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1067 resets, run finished after 1823 ms. (steps per millisecond=548 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1061 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 1064 resets, run finished after 1759 ms. (steps per millisecond=568 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1061 resets, run finished after 1838 ms. (steps per millisecond=544 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1069 resets, run finished after 1684 ms. (steps per millisecond=593 ) properties (out of 5) seen :0
[2023-03-11 02:31:45] [INFO ] Invariant cache hit.
[2023-03-11 02:31:45] [INFO ] [Real]Absence check using 55 positive place invariants in 17 ms returned sat
[2023-03-11 02:31:45] [INFO ] [Real]Absence check using 55 positive and 173 generalized place invariants in 81 ms returned sat
[2023-03-11 02:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:31:46] [INFO ] [Real]Absence check using state equation in 841 ms returned sat
[2023-03-11 02:31:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:31:46] [INFO ] [Nat]Absence check using 55 positive place invariants in 24 ms returned sat
[2023-03-11 02:31:46] [INFO ] [Nat]Absence check using 55 positive and 173 generalized place invariants in 38 ms returned sat
[2023-03-11 02:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:31:48] [INFO ] [Nat]Absence check using state equation in 1911 ms returned sat
[2023-03-11 02:31:48] [INFO ] Computed and/alt/rep : 876/3285/876 causal constraints (skipped 1267 transitions) in 193 ms.
[2023-03-11 02:32:08] [INFO ] Added : 640 causal constraints over 128 iterations in 20161 ms.(timeout) Result :sat
Minimization took 841 ms.
[2023-03-11 02:32:10] [INFO ] [Real]Absence check using 55 positive place invariants in 75 ms returned sat
[2023-03-11 02:32:10] [INFO ] [Real]Absence check using 55 positive and 173 generalized place invariants in 221 ms returned sat
[2023-03-11 02:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:32:11] [INFO ] [Real]Absence check using state equation in 961 ms returned sat
[2023-03-11 02:32:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:32:11] [INFO ] [Nat]Absence check using 55 positive place invariants in 19 ms returned sat
[2023-03-11 02:32:11] [INFO ] [Nat]Absence check using 55 positive and 173 generalized place invariants in 74 ms returned sat
[2023-03-11 02:32:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:32:13] [INFO ] [Nat]Absence check using state equation in 1909 ms returned sat
[2023-03-11 02:32:13] [INFO ] Computed and/alt/rep : 876/3285/876 causal constraints (skipped 1267 transitions) in 152 ms.
[2023-03-11 02:32:23] [INFO ] Added : 100 causal constraints over 20 iterations in 9814 ms. Result :unknown
[2023-03-11 02:32:23] [INFO ] [Real]Absence check using 55 positive place invariants in 40 ms returned sat
[2023-03-11 02:32:23] [INFO ] [Real]Absence check using 55 positive and 173 generalized place invariants in 63 ms returned sat
[2023-03-11 02:32:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:32:24] [INFO ] [Real]Absence check using state equation in 954 ms returned sat
[2023-03-11 02:32:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:32:25] [INFO ] [Nat]Absence check using 55 positive place invariants in 32 ms returned sat
[2023-03-11 02:32:25] [INFO ] [Nat]Absence check using 55 positive and 173 generalized place invariants in 134 ms returned sat
[2023-03-11 02:32:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:32:26] [INFO ] [Nat]Absence check using state equation in 1129 ms returned sat
[2023-03-11 02:32:26] [INFO ] Computed and/alt/rep : 876/3285/876 causal constraints (skipped 1267 transitions) in 162 ms.
[2023-03-11 02:32:46] [INFO ] Added : 675 causal constraints over 135 iterations in 20204 ms.(timeout) Result :sat
Minimization took 813 ms.
[2023-03-11 02:32:47] [INFO ] [Real]Absence check using 55 positive place invariants in 23 ms returned sat
[2023-03-11 02:32:47] [INFO ] [Real]Absence check using 55 positive and 173 generalized place invariants in 99 ms returned sat
[2023-03-11 02:32:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:32:48] [INFO ] [Real]Absence check using state equation in 850 ms returned sat
[2023-03-11 02:32:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:32:49] [INFO ] [Nat]Absence check using 55 positive place invariants in 20 ms returned sat
[2023-03-11 02:32:49] [INFO ] [Nat]Absence check using 55 positive and 173 generalized place invariants in 72 ms returned sat
[2023-03-11 02:32:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:32:50] [INFO ] [Nat]Absence check using state equation in 1358 ms returned sat
[2023-03-11 02:32:50] [INFO ] Computed and/alt/rep : 876/3285/876 causal constraints (skipped 1267 transitions) in 180 ms.
[2023-03-11 02:33:10] [INFO ] Added : 665 causal constraints over 133 iterations in 20058 ms.(timeout) Result :sat
Minimization took 568 ms.
[2023-03-11 02:33:11] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned sat
[2023-03-11 02:33:11] [INFO ] [Real]Absence check using 55 positive and 173 generalized place invariants in 63 ms returned sat
[2023-03-11 02:33:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:33:12] [INFO ] [Real]Absence check using state equation in 776 ms returned sat
[2023-03-11 02:33:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:33:12] [INFO ] [Nat]Absence check using 55 positive place invariants in 17 ms returned sat
[2023-03-11 02:33:12] [INFO ] [Nat]Absence check using 55 positive and 173 generalized place invariants in 53 ms returned sat
[2023-03-11 02:33:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:33:13] [INFO ] [Nat]Absence check using state equation in 762 ms returned sat
[2023-03-11 02:33:13] [INFO ] Computed and/alt/rep : 876/3285/876 causal constraints (skipped 1267 transitions) in 171 ms.
[2023-03-11 02:33:33] [INFO ] Added : 595 causal constraints over 119 iterations in 20077 ms.(timeout) Result :sat
Minimization took 804 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 1303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1303/1303 places, 2189/2189 transitions.
Applied a total of 0 rules in 47 ms. Remains 1303 /1303 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 1303/1303 places, 2189/2189 transitions.
[2023-03-11 02:33:39] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 9757 resets, run finished after 4212 ms. (steps per millisecond=237 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1067 resets, run finished after 1686 ms. (steps per millisecond=593 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1069 resets, run finished after 1853 ms. (steps per millisecond=539 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1073 resets, run finished after 1779 ms. (steps per millisecond=562 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1063 resets, run finished after 1737 ms. (steps per millisecond=575 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1067 resets, run finished after 1725 ms. (steps per millisecond=579 ) properties (out of 5) seen :0
[2023-03-11 02:33:52] [INFO ] Invariant cache hit.
[2023-03-11 02:33:52] [INFO ] [Real]Absence check using 55 positive place invariants in 17 ms returned sat
[2023-03-11 02:33:53] [INFO ] [Real]Absence check using 55 positive and 173 generalized place invariants in 83 ms returned sat
[2023-03-11 02:33:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:33:54] [INFO ] [Real]Absence check using state equation in 933 ms returned sat
[2023-03-11 02:33:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:33:54] [INFO ] [Nat]Absence check using 55 positive place invariants in 20 ms returned sat
[2023-03-11 02:33:54] [INFO ] [Nat]Absence check using 55 positive and 173 generalized place invariants in 55 ms returned sat
[2023-03-11 02:33:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:33:56] [INFO ] [Nat]Absence check using state equation in 1759 ms returned sat
[2023-03-11 02:33:56] [INFO ] Computed and/alt/rep : 876/3285/876 causal constraints (skipped 1267 transitions) in 197 ms.
[2023-03-11 02:34:16] [INFO ] Added : 610 causal constraints over 122 iterations in 20058 ms.(timeout) Result :sat
Minimization took 864 ms.
[2023-03-11 02:34:17] [INFO ] [Real]Absence check using 55 positive place invariants in 17 ms returned sat
[2023-03-11 02:34:17] [INFO ] [Real]Absence check using 55 positive and 173 generalized place invariants in 88 ms returned sat
[2023-03-11 02:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:34:18] [INFO ] [Real]Absence check using state equation in 937 ms returned sat
[2023-03-11 02:34:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:34:18] [INFO ] [Nat]Absence check using 55 positive place invariants in 34 ms returned sat
[2023-03-11 02:34:19] [INFO ] [Nat]Absence check using 55 positive and 173 generalized place invariants in 138 ms returned sat
[2023-03-11 02:34:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:34:21] [INFO ] [Nat]Absence check using state equation in 2097 ms returned sat
[2023-03-11 02:34:21] [INFO ] Computed and/alt/rep : 876/3285/876 causal constraints (skipped 1267 transitions) in 156 ms.
[2023-03-11 02:34:31] [INFO ] Added : 100 causal constraints over 20 iterations in 10095 ms. Result :unknown
[2023-03-11 02:34:31] [INFO ] [Real]Absence check using 55 positive place invariants in 27 ms returned sat
[2023-03-11 02:34:31] [INFO ] [Real]Absence check using 55 positive and 173 generalized place invariants in 108 ms returned sat
[2023-03-11 02:34:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:34:32] [INFO ] [Real]Absence check using state equation in 871 ms returned sat
[2023-03-11 02:34:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:34:32] [INFO ] [Nat]Absence check using 55 positive place invariants in 19 ms returned sat
[2023-03-11 02:34:32] [INFO ] [Nat]Absence check using 55 positive and 173 generalized place invariants in 83 ms returned sat
[2023-03-11 02:34:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:34:33] [INFO ] [Nat]Absence check using state equation in 868 ms returned sat
[2023-03-11 02:34:34] [INFO ] Computed and/alt/rep : 876/3285/876 causal constraints (skipped 1267 transitions) in 145 ms.
[2023-03-11 02:34:54] [INFO ] Added : 645 causal constraints over 129 iterations in 20123 ms.(timeout) Result :sat
Minimization took 767 ms.
[2023-03-11 02:34:55] [INFO ] [Real]Absence check using 55 positive place invariants in 18 ms returned sat
[2023-03-11 02:34:55] [INFO ] [Real]Absence check using 55 positive and 173 generalized place invariants in 111 ms returned sat
[2023-03-11 02:34:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:34:56] [INFO ] [Real]Absence check using state equation in 907 ms returned sat
[2023-03-11 02:34:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:34:56] [INFO ] [Nat]Absence check using 55 positive place invariants in 34 ms returned sat
[2023-03-11 02:34:56] [INFO ] [Nat]Absence check using 55 positive and 173 generalized place invariants in 81 ms returned sat
[2023-03-11 02:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:34:57] [INFO ] [Nat]Absence check using state equation in 1358 ms returned sat
[2023-03-11 02:34:58] [INFO ] Computed and/alt/rep : 876/3285/876 causal constraints (skipped 1267 transitions) in 170 ms.
[2023-03-11 02:35:18] [INFO ] Added : 660 causal constraints over 132 iterations in 20031 ms.(timeout) Result :sat
Minimization took 582 ms.
[2023-03-11 02:35:18] [INFO ] [Real]Absence check using 55 positive place invariants in 18 ms returned sat
[2023-03-11 02:35:18] [INFO ] [Real]Absence check using 55 positive and 173 generalized place invariants in 72 ms returned sat
[2023-03-11 02:35:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:35:19] [INFO ] [Real]Absence check using state equation in 755 ms returned sat
[2023-03-11 02:35:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:35:20] [INFO ] [Nat]Absence check using 55 positive place invariants in 22 ms returned sat
[2023-03-11 02:35:20] [INFO ] [Nat]Absence check using 55 positive and 173 generalized place invariants in 92 ms returned sat
[2023-03-11 02:35:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:35:21] [INFO ] [Nat]Absence check using state equation in 720 ms returned sat
[2023-03-11 02:35:21] [INFO ] Computed and/alt/rep : 876/3285/876 causal constraints (skipped 1267 transitions) in 124 ms.
[2023-03-11 02:35:41] [INFO ] Added : 610 causal constraints over 122 iterations in 20144 ms.(timeout) Result :sat
Minimization took 764 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 1303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1303/1303 places, 2189/2189 transitions.
Applied a total of 0 rules in 45 ms. Remains 1303 /1303 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1303/1303 places, 2189/2189 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1303/1303 places, 2189/2189 transitions.
Applied a total of 0 rules in 41 ms. Remains 1303 /1303 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
[2023-03-11 02:35:50] [INFO ] Invariant cache hit.
[2023-03-11 02:35:51] [INFO ] Implicit Places using invariants in 1148 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 271, 272, 273, 291, 309, 346, 380, 384, 385, 396, 397, 398, 416, 434, 503, 507, 508, 519, 520, 521, 539, 557, 626, 630, 631, 642, 643, 644, 662, 680, 755, 759, 760, 771, 772, 773, 774, 792, 810, 885, 900, 901, 902, 920, 938, 1007, 1011, 1012, 1023, 1024, 1025, 1043, 1061, 1130, 1134, 1135, 1138, 1149, 1150, 1151, 1169, 1171, 1174, 1192, 1193, 1194, 1195, 1207, 1213, 1219, 1225, 1231, 1237, 1243, 1249, 1255, 1261, 1267]
Discarding 94 places :
Implicit Place search using SMT only with invariants took 1153 ms to find 94 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1209/1303 places, 2189/2189 transitions.
Drop transitions removed 165 transitions
Trivial Post-agglo rules discarded 165 transitions
Performed 165 trivial Post agglomeration. Transition count delta: 165
Iterating post reduction 0 with 165 rules applied. Total rules applied 165 place count 1209 transition count 2024
Reduce places removed 165 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 166 rules applied. Total rules applied 331 place count 1044 transition count 2023
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 332 place count 1043 transition count 2023
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 332 place count 1043 transition count 1980
Deduced a syphon composed of 43 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 87 rules applied. Total rules applied 419 place count 999 transition count 1980
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 13 rules applied. Total rules applied 432 place count 994 transition count 1972
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 440 place count 986 transition count 1972
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 455 place count 971 transition count 1957
Iterating global reduction 5 with 15 rules applied. Total rules applied 470 place count 971 transition count 1957
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 473 place count 971 transition count 1954
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 473 place count 971 transition count 1953
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 475 place count 970 transition count 1953
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 478 place count 967 transition count 1950
Iterating global reduction 6 with 3 rules applied. Total rules applied 481 place count 967 transition count 1950
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 482 place count 966 transition count 1949
Iterating global reduction 6 with 1 rules applied. Total rules applied 483 place count 966 transition count 1949
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 484 place count 965 transition count 1948
Iterating global reduction 6 with 1 rules applied. Total rules applied 485 place count 965 transition count 1948
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 6 with 150 rules applied. Total rules applied 635 place count 890 transition count 1873
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 642 place count 890 transition count 1866
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 650 place count 882 transition count 1858
Iterating global reduction 7 with 8 rules applied. Total rules applied 658 place count 882 transition count 1858
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 666 place count 882 transition count 1850
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 667 place count 882 transition count 1849
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 668 place count 881 transition count 1849
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 9 with 21 rules applied. Total rules applied 689 place count 881 transition count 1828
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 9 with 22 rules applied. Total rules applied 711 place count 859 transition count 1828
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 712 place count 859 transition count 1827
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 10 with 28 rules applied. Total rules applied 740 place count 859 transition count 1827
Applied a total of 740 rules in 507 ms. Remains 859 /1209 variables (removed 350) and now considering 1827/2189 (removed 362) transitions.
// Phase 1: matrix 1827 rows 859 cols
[2023-03-11 02:35:51] [INFO ] Computed 127 place invariants in 45 ms
[2023-03-11 02:35:52] [INFO ] Implicit Places using invariants in 772 ms returned [72, 89, 95, 98, 100, 103, 104, 156, 173, 179, 182, 184, 189, 190, 242, 261, 267, 270, 272, 277, 278, 330, 347, 353, 356, 358, 363, 364, 416, 433, 439, 442, 444, 449, 450, 503, 520, 526, 529, 531, 536, 537, 606, 612, 615, 617, 620, 627, 628, 682, 699, 705, 708, 710, 715, 716, 768, 785, 791, 794, 796]
Discarding 61 places :
Implicit Place search using SMT only with invariants took 780 ms to find 61 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 798/1303 places, 1827/2189 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 770 transition count 1799
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 770 transition count 1799
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 761 transition count 1790
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 761 transition count 1790
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 108 place count 744 transition count 1773
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 109 place count 744 transition count 1772
Free-agglomeration rule applied 27 times.
Iterating global reduction 0 with 27 rules applied. Total rules applied 136 place count 744 transition count 1745
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 163 place count 717 transition count 1745
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 171 place count 717 transition count 1737
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 179 place count 709 transition count 1737
Applied a total of 179 rules in 199 ms. Remains 709 /798 variables (removed 89) and now considering 1737/1827 (removed 90) transitions.
// Phase 1: matrix 1737 rows 709 cols
[2023-03-11 02:35:52] [INFO ] Computed 66 place invariants in 13 ms
[2023-03-11 02:35:53] [INFO ] Implicit Places using invariants in 647 ms returned []
[2023-03-11 02:35:53] [INFO ] Invariant cache hit.
[2023-03-11 02:35:55] [INFO ] Implicit Places using invariants and state equation in 1814 ms returned []
Implicit Place search using SMT with State Equation took 2472 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 709/1303 places, 1737/2189 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 5163 ms. Remains : 709/1303 places, 1737/2189 transitions.
Successfully produced net in file /tmp/petri1000_12362345419892165166.dot
Successfully produced net in file /tmp/petri1001_7261894125418814091.dot
Successfully produced net in file /tmp/petri1002_17282451860677377708.dot
Successfully produced net in file /tmp/petri1003_10270536229704231802.dot
Successfully produced net in file /tmp/petri1004_16343611214105705424.dot
Successfully produced net in file /tmp/petri1005_7135596121757429966.dot
Successfully produced net in file /tmp/petri1006_13835580411647547617.dot
Successfully produced net in file /tmp/petri1007_15173505883495918002.dot
Successfully produced net in file /tmp/petri1008_1600770477096994233.dot
Drop transitions removed 9 transitions
Dominated transitions for bounds rules discarded 9 transitions
// Phase 1: matrix 1728 rows 709 cols
[2023-03-11 02:35:55] [INFO ] Computed 66 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 15978 resets, run finished after 2712 ms. (steps per millisecond=368 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2413 resets, run finished after 898 ms. (steps per millisecond=1113 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2438 resets, run finished after 895 ms. (steps per millisecond=1117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2438 resets, run finished after 920 ms. (steps per millisecond=1086 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2431 resets, run finished after 904 ms. (steps per millisecond=1106 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2420 resets, run finished after 918 ms. (steps per millisecond=1089 ) properties (out of 5) seen :0
[2023-03-11 02:36:02] [INFO ] Invariant cache hit.
[2023-03-11 02:36:02] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2023-03-11 02:36:02] [INFO ] [Real]Absence check using 15 positive and 51 generalized place invariants in 23 ms returned sat
[2023-03-11 02:36:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:03] [INFO ] [Real]Absence check using state equation in 762 ms returned sat
[2023-03-11 02:36:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:36:03] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-11 02:36:03] [INFO ] [Nat]Absence check using 15 positive and 51 generalized place invariants in 77 ms returned sat
[2023-03-11 02:36:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:04] [INFO ] [Nat]Absence check using state equation in 1170 ms returned sat
[2023-03-11 02:36:05] [INFO ] Computed and/alt/rep : 406/1755/406 causal constraints (skipped 1280 transitions) in 113 ms.
[2023-03-11 02:36:06] [INFO ] Added : 60 causal constraints over 12 iterations in 1606 ms. Result :sat
Minimization took 249 ms.
[2023-03-11 02:36:07] [INFO ] [Real]Absence check using 15 positive place invariants in 35 ms returned sat
[2023-03-11 02:36:07] [INFO ] [Real]Absence check using 15 positive and 51 generalized place invariants in 19 ms returned sat
[2023-03-11 02:36:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:07] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2023-03-11 02:36:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:36:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-11 02:36:07] [INFO ] [Nat]Absence check using 15 positive and 51 generalized place invariants in 16 ms returned sat
[2023-03-11 02:36:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:08] [INFO ] [Nat]Absence check using state equation in 822 ms returned sat
[2023-03-11 02:36:08] [INFO ] Computed and/alt/rep : 406/1755/406 causal constraints (skipped 1280 transitions) in 103 ms.
[2023-03-11 02:36:10] [INFO ] Added : 46 causal constraints over 10 iterations in 1395 ms. Result :sat
Minimization took 285 ms.
[2023-03-11 02:36:10] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-11 02:36:10] [INFO ] [Real]Absence check using 15 positive and 51 generalized place invariants in 33 ms returned sat
[2023-03-11 02:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:10] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2023-03-11 02:36:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:36:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 02:36:11] [INFO ] [Nat]Absence check using 15 positive and 51 generalized place invariants in 15 ms returned sat
[2023-03-11 02:36:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:11] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2023-03-11 02:36:11] [INFO ] Computed and/alt/rep : 406/1755/406 causal constraints (skipped 1280 transitions) in 127 ms.
[2023-03-11 02:36:12] [INFO ] Added : 35 causal constraints over 7 iterations in 1001 ms. Result :sat
Minimization took 266 ms.
[2023-03-11 02:36:13] [INFO ] [Real]Absence check using 15 positive place invariants in 44 ms returned sat
[2023-03-11 02:36:13] [INFO ] [Real]Absence check using 15 positive and 51 generalized place invariants in 50 ms returned sat
[2023-03-11 02:36:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:13] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2023-03-11 02:36:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:36:14] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 02:36:14] [INFO ] [Nat]Absence check using 15 positive and 51 generalized place invariants in 38 ms returned sat
[2023-03-11 02:36:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:14] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2023-03-11 02:36:14] [INFO ] Computed and/alt/rep : 406/1755/406 causal constraints (skipped 1280 transitions) in 110 ms.
[2023-03-11 02:36:16] [INFO ] Added : 93 causal constraints over 19 iterations in 2132 ms. Result :sat
Minimization took 294 ms.
[2023-03-11 02:36:17] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-11 02:36:17] [INFO ] [Real]Absence check using 15 positive and 51 generalized place invariants in 20 ms returned sat
[2023-03-11 02:36:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:18] [INFO ] [Real]Absence check using state equation in 604 ms returned sat
[2023-03-11 02:36:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:36:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-11 02:36:18] [INFO ] [Nat]Absence check using 15 positive and 51 generalized place invariants in 41 ms returned sat
[2023-03-11 02:36:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:20] [INFO ] [Nat]Absence check using state equation in 1673 ms returned sat
[2023-03-11 02:36:20] [INFO ] Computed and/alt/rep : 406/1755/406 causal constraints (skipped 1280 transitions) in 191 ms.
[2023-03-11 02:36:22] [INFO ] Added : 70 causal constraints over 14 iterations in 2467 ms. Result :sat
Minimization took 363 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA ASLink-PT-09a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-09a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-09a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-09a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 1728/1728 transitions.
Graph (complete) has 4312 edges and 709 vertex of which 700 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 700 transition count 1727
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 699 transition count 1727
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 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 6 place count 697 transition count 1726
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 697 transition count 1725
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 7 place count 697 transition count 1723
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 11 place count 695 transition count 1723
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 20 place count 695 transition count 1723
Applied a total of 20 rules in 98 ms. Remains 695 /709 variables (removed 14) and now considering 1723/1728 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 695/709 places, 1723/1728 transitions.
// Phase 1: matrix 1723 rows 695 cols
[2023-03-11 02:36:25] [INFO ] Computed 65 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 16744 resets, run finished after 2519 ms. (steps per millisecond=396 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2531 resets, run finished after 1085 ms. (steps per millisecond=921 ) properties (out of 1) seen :0
[2023-03-11 02:36:28] [INFO ] Invariant cache hit.
[2023-03-11 02:36:28] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-11 02:36:28] [INFO ] [Real]Absence check using 14 positive and 51 generalized place invariants in 12 ms returned sat
[2023-03-11 02:36:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:29] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2023-03-11 02:36:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:36:29] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-11 02:36:29] [INFO ] [Nat]Absence check using 14 positive and 51 generalized place invariants in 14 ms returned sat
[2023-03-11 02:36:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:30] [INFO ] [Nat]Absence check using state equation in 769 ms returned sat
[2023-03-11 02:36:30] [INFO ] Computed and/alt/rep : 386/1700/386 causal constraints (skipped 1295 transitions) in 126 ms.
[2023-03-11 02:36:31] [INFO ] Added : 43 causal constraints over 9 iterations in 1052 ms. Result :sat
Minimization took 277 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 695 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 695/695 places, 1723/1723 transitions.
Applied a total of 0 rules in 27 ms. Remains 695 /695 variables (removed 0) and now considering 1723/1723 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 695/695 places, 1723/1723 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 695/695 places, 1723/1723 transitions.
Applied a total of 0 rules in 22 ms. Remains 695 /695 variables (removed 0) and now considering 1723/1723 (removed 0) transitions.
[2023-03-11 02:36:31] [INFO ] Invariant cache hit.
[2023-03-11 02:36:32] [INFO ] Implicit Places using invariants in 389 ms returned [495, 496]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 392 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 693/695 places, 1723/1723 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 1722
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 692 transition count 1721
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 1721
Applied a total of 4 rules in 61 ms. Remains 691 /693 variables (removed 2) and now considering 1721/1723 (removed 2) transitions.
// Phase 1: matrix 1721 rows 691 cols
[2023-03-11 02:36:32] [INFO ] Computed 63 place invariants in 12 ms
[2023-03-11 02:36:32] [INFO ] Implicit Places using invariants in 534 ms returned []
[2023-03-11 02:36:32] [INFO ] Invariant cache hit.
[2023-03-11 02:36:34] [INFO ] Implicit Places using invariants and state equation in 1744 ms returned []
Implicit Place search using SMT with State Equation took 2282 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 691/695 places, 1721/1723 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2757 ms. Remains : 691/695 places, 1721/1723 transitions.
[2023-03-11 02:36:34] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16533 resets, run finished after 2216 ms. (steps per millisecond=451 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2543 resets, run finished after 753 ms. (steps per millisecond=1328 ) properties (out of 1) seen :0
[2023-03-11 02:36:37] [INFO ] Invariant cache hit.
[2023-03-11 02:36:37] [INFO ] [Real]Absence check using 14 positive place invariants in 21 ms returned sat
[2023-03-11 02:36:37] [INFO ] [Real]Absence check using 14 positive and 49 generalized place invariants in 35 ms returned sat
[2023-03-11 02:36:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:38] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2023-03-11 02:36:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:36:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 28 ms returned sat
[2023-03-11 02:36:38] [INFO ] [Nat]Absence check using 14 positive and 49 generalized place invariants in 23 ms returned sat
[2023-03-11 02:36:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:39] [INFO ] [Nat]Absence check using state equation in 837 ms returned sat
[2023-03-11 02:36:39] [INFO ] Computed and/alt/rep : 393/1660/393 causal constraints (skipped 1286 transitions) in 104 ms.
[2023-03-11 02:36:40] [INFO ] Added : 38 causal constraints over 8 iterations in 817 ms. Result :sat
Minimization took 226 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 1721/1721 transitions.
Applied a total of 0 rules in 25 ms. Remains 691 /691 variables (removed 0) and now considering 1721/1721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 691/691 places, 1721/1721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 1721/1721 transitions.
Applied a total of 0 rules in 23 ms. Remains 691 /691 variables (removed 0) and now considering 1721/1721 (removed 0) transitions.
[2023-03-11 02:36:41] [INFO ] Invariant cache hit.
[2023-03-11 02:36:41] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-11 02:36:41] [INFO ] Invariant cache hit.
[2023-03-11 02:36:43] [INFO ] Implicit Places using invariants and state equation in 1633 ms returned []
Implicit Place search using SMT with State Equation took 2060 ms to find 0 implicit places.
[2023-03-11 02:36:43] [INFO ] Redundant transitions in 138 ms returned []
[2023-03-11 02:36:43] [INFO ] Invariant cache hit.
[2023-03-11 02:36:43] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2891 ms. Remains : 691/691 places, 1721/1721 transitions.
Starting property specific reduction for ASLink-PT-09a-UpperBounds-01
[2023-03-11 02:36:43] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 161 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-11 02:36:43] [INFO ] Invariant cache hit.
[2023-03-11 02:36:44] [INFO ] [Real]Absence check using 14 positive place invariants in 11 ms returned sat
[2023-03-11 02:36:44] [INFO ] [Real]Absence check using 14 positive and 49 generalized place invariants in 29 ms returned sat
[2023-03-11 02:36:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:44] [INFO ] [Real]Absence check using state equation in 484 ms returned sat
[2023-03-11 02:36:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:36:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-11 02:36:44] [INFO ] [Nat]Absence check using 14 positive and 49 generalized place invariants in 13 ms returned sat
[2023-03-11 02:36:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:45] [INFO ] [Nat]Absence check using state equation in 727 ms returned sat
[2023-03-11 02:36:45] [INFO ] Computed and/alt/rep : 393/1660/393 causal constraints (skipped 1286 transitions) in 103 ms.
[2023-03-11 02:36:46] [INFO ] Added : 38 causal constraints over 8 iterations in 685 ms. Result :sat
Minimization took 235 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 1721/1721 transitions.
Applied a total of 0 rules in 20 ms. Remains 691 /691 variables (removed 0) and now considering 1721/1721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 691/691 places, 1721/1721 transitions.
[2023-03-11 02:36:46] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16580 resets, run finished after 2499 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2557 resets, run finished after 1002 ms. (steps per millisecond=998 ) properties (out of 1) seen :0
[2023-03-11 02:36:50] [INFO ] Invariant cache hit.
[2023-03-11 02:36:50] [INFO ] [Real]Absence check using 14 positive place invariants in 94 ms returned sat
[2023-03-11 02:36:50] [INFO ] [Real]Absence check using 14 positive and 49 generalized place invariants in 29 ms returned sat
[2023-03-11 02:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:51] [INFO ] [Real]Absence check using state equation in 440 ms returned sat
[2023-03-11 02:36:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 02:36:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-11 02:36:51] [INFO ] [Nat]Absence check using 14 positive and 49 generalized place invariants in 16 ms returned sat
[2023-03-11 02:36:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 02:36:52] [INFO ] [Nat]Absence check using state equation in 765 ms returned sat
[2023-03-11 02:36:52] [INFO ] Computed and/alt/rep : 393/1660/393 causal constraints (skipped 1286 transitions) in 98 ms.
[2023-03-11 02:36:53] [INFO ] Added : 38 causal constraints over 8 iterations in 1102 ms. Result :sat
Minimization took 251 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 691 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 1721/1721 transitions.
Applied a total of 0 rules in 21 ms. Remains 691 /691 variables (removed 0) and now considering 1721/1721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 691/691 places, 1721/1721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 691/691 places, 1721/1721 transitions.
Applied a total of 0 rules in 21 ms. Remains 691 /691 variables (removed 0) and now considering 1721/1721 (removed 0) transitions.
[2023-03-11 02:36:53] [INFO ] Invariant cache hit.
[2023-03-11 02:36:54] [INFO ] Implicit Places using invariants in 482 ms returned []
[2023-03-11 02:36:54] [INFO ] Invariant cache hit.
[2023-03-11 02:36:56] [INFO ] Implicit Places using invariants and state equation in 1712 ms returned []
Implicit Place search using SMT with State Equation took 2232 ms to find 0 implicit places.
[2023-03-11 02:36:56] [INFO ] Redundant transitions in 74 ms returned []
[2023-03-11 02:36:56] [INFO ] Invariant cache hit.
[2023-03-11 02:36:56] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3083 ms. Remains : 691/691 places, 1721/1721 transitions.
Ending property specific reduction for ASLink-PT-09a-UpperBounds-01 in 13035 ms.
[2023-03-11 02:36:57] [INFO ] Flatten gal took : 227 ms
[2023-03-11 02:36:57] [INFO ] Applying decomposition
[2023-03-11 02:36:57] [INFO ] Flatten gal took : 110 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph10413765639686603209.txt' '-o' '/tmp/graph10413765639686603209.bin' '-w' '/tmp/graph10413765639686603209.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10413765639686603209.bin' '-l' '-1' '-v' '-w' '/tmp/graph10413765639686603209.weights' '-q' '0' '-e' '0.001'
[2023-03-11 02:36:58] [INFO ] Decomposing Gal with order
[2023-03-11 02:36:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 02:36:58] [INFO ] Removed a total of 3462 redundant transitions.
[2023-03-11 02:36:58] [INFO ] Flatten gal took : 238 ms
[2023-03-11 02:36:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 35 ms.
[2023-03-11 02:36:58] [INFO ] Time to serialize gal into /tmp/UpperBounds18360844197660230174.gal : 20 ms
[2023-03-11 02:36:58] [INFO ] Time to serialize properties into /tmp/UpperBounds8903593577231381598.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds18360844197660230174.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8903593577231381598.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds8903593577231381598.prop.
Detected timeout of ITS tools.
[2023-03-11 02:59:02] [INFO ] Applying decomposition
[2023-03-11 02:59:02] [INFO ] Flatten gal took : 70 ms
[2023-03-11 02:59:02] [INFO ] Decomposing Gal with order
[2023-03-11 02:59:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 02:59:03] [INFO ] Removed a total of 3256 redundant transitions.
[2023-03-11 02:59:03] [INFO ] Flatten gal took : 136 ms
[2023-03-11 02:59:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 623 labels/synchronizations in 42 ms.
[2023-03-11 02:59:03] [INFO ] Time to serialize gal into /tmp/UpperBounds3629402405639464045.gal : 7 ms
[2023-03-11 02:59:03] [INFO ] Time to serialize properties into /tmp/UpperBounds7834183923869542877.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3629402405639464045.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7834183923869542877.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds7834183923869542877.prop.
Detected timeout of ITS tools.
[2023-03-11 03:21:07] [INFO ] Flatten gal took : 70 ms
[2023-03-11 03:21:07] [INFO ] Input system was already deterministic with 1721 transitions.
[2023-03-11 03:21:07] [INFO ] Transformed 691 places.
[2023-03-11 03:21:07] [INFO ] Transformed 1721 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-11 03:21:08] [INFO ] Time to serialize gal into /tmp/UpperBounds11815978859994684302.gal : 28 ms
[2023-03-11 03:21:08] [INFO ] Time to serialize properties into /tmp/UpperBounds3600054847819673414.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11815978859994684302.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3600054847819673414.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...350
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds3600054847819673414.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 2344456 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095448 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-5348"
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 r005-oct2-167813592700141"
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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;