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.r009-oct2-167813597500157.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 ltsminxred
Input is ASLink-PT-10a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597500157
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.9K Feb 26 13:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 13:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 13:09 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 920K 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-10a-UpperBounds-00
FORMULA_NAME ASLink-PT-10a-UpperBounds-01
FORMULA_NAME ASLink-PT-10a-UpperBounds-02
FORMULA_NAME ASLink-PT-10a-UpperBounds-03
FORMULA_NAME ASLink-PT-10a-UpperBounds-04
FORMULA_NAME ASLink-PT-10a-UpperBounds-05
FORMULA_NAME ASLink-PT-10a-UpperBounds-06
FORMULA_NAME ASLink-PT-10a-UpperBounds-07
FORMULA_NAME ASLink-PT-10a-UpperBounds-08
FORMULA_NAME ASLink-PT-10a-UpperBounds-09
FORMULA_NAME ASLink-PT-10a-UpperBounds-10
FORMULA_NAME ASLink-PT-10a-UpperBounds-11
FORMULA_NAME ASLink-PT-10a-UpperBounds-12
FORMULA_NAME ASLink-PT-10a-UpperBounds-13
FORMULA_NAME ASLink-PT-10a-UpperBounds-14
FORMULA_NAME ASLink-PT-10a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678618103474

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 10:48:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 10:48:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:48:27] [INFO ] Load time of PNML (sax parser for PT used): 304 ms
[2023-03-12 10:48:27] [INFO ] Transformed 2186 places.
[2023-03-12 10:48:27] [INFO ] Transformed 3192 transitions.
[2023-03-12 10:48:27] [INFO ] Found NUPN structural information;
[2023-03-12 10:48:27] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 546 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
// Phase 1: matrix 3158 rows 2186 cols
[2023-03-12 10:48:28] [INFO ] Computed 422 place invariants in 273 ms
Incomplete random walk after 10000 steps, including 49 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 16) seen :9
FORMULA ASLink-PT-10a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
[2023-03-12 10:48:28] [INFO ] Invariant cache hit.
[2023-03-12 10:48:29] [INFO ] [Real]Absence check using 105 positive place invariants in 78 ms returned sat
[2023-03-12 10:48:29] [INFO ] [Real]Absence check using 105 positive and 317 generalized place invariants in 162 ms returned sat
[2023-03-12 10:48:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:32] [INFO ] [Real]Absence check using state equation in 2763 ms returned sat
[2023-03-12 10:48:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:48:33] [INFO ] [Nat]Absence check using 105 positive place invariants in 157 ms returned sat
[2023-03-12 10:48:33] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 204 ms returned sat
[2023-03-12 10:48:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:37] [INFO ] [Nat]Absence check using state equation in 4228 ms returned unknown
[2023-03-12 10:48:38] [INFO ] [Real]Absence check using 105 positive place invariants in 154 ms returned sat
[2023-03-12 10:48:38] [INFO ] [Real]Absence check using 105 positive and 317 generalized place invariants in 162 ms returned sat
[2023-03-12 10:48:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:40] [INFO ] [Real]Absence check using state equation in 1922 ms returned sat
[2023-03-12 10:48:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:48:41] [INFO ] [Nat]Absence check using 105 positive place invariants in 53 ms returned sat
[2023-03-12 10:48:41] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 123 ms returned sat
[2023-03-12 10:48:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:45] [INFO ] [Nat]Absence check using state equation in 4198 ms returned unknown
[2023-03-12 10:48:46] [INFO ] [Real]Absence check using 105 positive place invariants in 52 ms returned sat
[2023-03-12 10:48:46] [INFO ] [Real]Absence check using 105 positive and 317 generalized place invariants in 129 ms returned sat
[2023-03-12 10:48:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:48] [INFO ] [Real]Absence check using state equation in 1748 ms returned sat
[2023-03-12 10:48:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:48:48] [INFO ] [Nat]Absence check using 105 positive place invariants in 48 ms returned sat
[2023-03-12 10:48:49] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 201 ms returned sat
[2023-03-12 10:48:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:53] [INFO ] [Nat]Absence check using state equation in 4341 ms returned unknown
[2023-03-12 10:48:54] [INFO ] [Real]Absence check using 105 positive place invariants in 60 ms returned sat
[2023-03-12 10:48:54] [INFO ] [Real]Absence check using 105 positive and 317 generalized place invariants in 213 ms returned sat
[2023-03-12 10:48:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:56] [INFO ] [Real]Absence check using state equation in 2479 ms returned sat
[2023-03-12 10:48:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:48:57] [INFO ] [Nat]Absence check using 105 positive place invariants in 172 ms returned sat
[2023-03-12 10:48:57] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 136 ms returned sat
[2023-03-12 10:48:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:49:01] [INFO ] [Nat]Absence check using state equation in 4268 ms returned unknown
[2023-03-12 10:49:02] [INFO ] [Real]Absence check using 105 positive place invariants in 83 ms returned sat
[2023-03-12 10:49:03] [INFO ] [Real]Absence check using 105 positive and 317 generalized place invariants in 411 ms returned sat
[2023-03-12 10:49:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:49:04] [INFO ] [Real]Absence check using state equation in 1732 ms returned sat
[2023-03-12 10:49:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:49:05] [INFO ] [Nat]Absence check using 105 positive place invariants in 50 ms returned sat
[2023-03-12 10:49:05] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 97 ms returned sat
[2023-03-12 10:49:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:49:09] [INFO ] [Nat]Absence check using state equation in 4503 ms returned unknown
[2023-03-12 10:49:10] [INFO ] [Real]Absence check using 105 positive place invariants in 71 ms returned sat
[2023-03-12 10:49:10] [INFO ] [Real]Absence check using 105 positive and 317 generalized place invariants in 94 ms returned sat
[2023-03-12 10:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:49:12] [INFO ] [Real]Absence check using state equation in 1711 ms returned sat
[2023-03-12 10:49:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:49:12] [INFO ] [Nat]Absence check using 105 positive place invariants in 154 ms returned sat
[2023-03-12 10:49:13] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 412 ms returned sat
[2023-03-12 10:49:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:49:17] [INFO ] [Nat]Absence check using state equation in 4115 ms returned unknown
[2023-03-12 10:49:17] [INFO ] [Real]Absence check using 105 positive place invariants in 48 ms returned sat
[2023-03-12 10:49:18] [INFO ] [Real]Absence check using 105 positive and 317 generalized place invariants in 135 ms returned sat
[2023-03-12 10:49:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:49:19] [INFO ] [Real]Absence check using state equation in 1648 ms returned sat
[2023-03-12 10:49:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:49:20] [INFO ] [Nat]Absence check using 105 positive place invariants in 54 ms returned sat
[2023-03-12 10:49:20] [INFO ] [Nat]Absence check using 105 positive and 317 generalized place invariants in 159 ms returned sat
[2023-03-12 10:49:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:49:24] [INFO ] [Nat]Absence check using state equation in 4448 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 2186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 40 places
Discarding 20 places :
Implicit places reduction removed 20 places
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 0 with 260 rules applied. Total rules applied 260 place count 2126 transition count 2958
Reduce places removed 200 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 203 rules applied. Total rules applied 463 place count 1926 transition count 2955
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 466 place count 1923 transition count 2955
Performed 207 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 207 Pre rules applied. Total rules applied 466 place count 1923 transition count 2748
Deduced a syphon composed of 207 places in 14 ms
Ensure Unique test removed 81 places
Reduce places removed 288 places and 0 transitions.
Iterating global reduction 3 with 495 rules applied. Total rules applied 961 place count 1635 transition count 2748
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 962 place count 1635 transition count 2747
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 963 place count 1634 transition count 2747
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 976 place count 1621 transition count 2676
Ensure Unique test removed 1 places
Iterating global reduction 5 with 14 rules applied. Total rules applied 990 place count 1620 transition count 2676
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 996 place count 1619 transition count 2671
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 999 place count 1616 transition count 2671
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1000 place count 1615 transition count 2663
Iterating global reduction 7 with 1 rules applied. Total rules applied 1001 place count 1615 transition count 2663
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1002 place count 1614 transition count 2655
Iterating global reduction 7 with 1 rules applied. Total rules applied 1003 place count 1614 transition count 2655
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1004 place count 1613 transition count 2647
Iterating global reduction 7 with 1 rules applied. Total rules applied 1005 place count 1613 transition count 2647
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1006 place count 1612 transition count 2639
Iterating global reduction 7 with 1 rules applied. Total rules applied 1007 place count 1612 transition count 2639
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1008 place count 1611 transition count 2631
Iterating global reduction 7 with 1 rules applied. Total rules applied 1009 place count 1611 transition count 2631
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1010 place count 1610 transition count 2623
Iterating global reduction 7 with 1 rules applied. Total rules applied 1011 place count 1610 transition count 2623
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1012 place count 1609 transition count 2615
Iterating global reduction 7 with 1 rules applied. Total rules applied 1013 place count 1609 transition count 2615
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1014 place count 1608 transition count 2607
Iterating global reduction 7 with 1 rules applied. Total rules applied 1015 place count 1608 transition count 2607
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1016 place count 1607 transition count 2599
Iterating global reduction 7 with 1 rules applied. Total rules applied 1017 place count 1607 transition count 2599
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1018 place count 1606 transition count 2591
Iterating global reduction 7 with 1 rules applied. Total rules applied 1019 place count 1606 transition count 2591
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1020 place count 1605 transition count 2583
Iterating global reduction 7 with 1 rules applied. Total rules applied 1021 place count 1605 transition count 2583
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1022 place count 1604 transition count 2575
Iterating global reduction 7 with 1 rules applied. Total rules applied 1023 place count 1604 transition count 2575
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1024 place count 1603 transition count 2567
Iterating global reduction 7 with 1 rules applied. Total rules applied 1025 place count 1603 transition count 2567
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1026 place count 1602 transition count 2559
Iterating global reduction 7 with 1 rules applied. Total rules applied 1027 place count 1602 transition count 2559
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1028 place count 1601 transition count 2551
Iterating global reduction 7 with 1 rules applied. Total rules applied 1029 place count 1601 transition count 2551
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1030 place count 1600 transition count 2543
Iterating global reduction 7 with 1 rules applied. Total rules applied 1031 place count 1600 transition count 2543
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 3 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 7 with 136 rules applied. Total rules applied 1167 place count 1532 transition count 2475
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 1176 place count 1532 transition count 2466
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 1185 place count 1523 transition count 2466
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 1196 place count 1523 transition count 2466
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1197 place count 1522 transition count 2465
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 8 with 20 rules applied. Total rules applied 1217 place count 1502 transition count 2465
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 40 Pre rules applied. Total rules applied 1217 place count 1502 transition count 2425
Deduced a syphon composed of 40 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 9 with 81 rules applied. Total rules applied 1298 place count 1461 transition count 2425
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 9 with 11 rules applied. Total rules applied 1309 place count 1450 transition count 2425
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 1309 place count 1450 transition count 2424
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 1311 place count 1449 transition count 2424
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 3 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 1333 place count 1438 transition count 2413
Discarding 10 places :
Symmetric choice reduction at 10 with 10 rule applications. Total rules 1343 place count 1428 transition count 2403
Iterating global reduction 10 with 10 rules applied. Total rules applied 1353 place count 1428 transition count 2403
Free-agglomeration rule applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1363 place count 1428 transition count 2393
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 1373 place count 1418 transition count 2393
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 11 with 10 rules applied. Total rules applied 1383 place count 1418 transition count 2393
Applied a total of 1383 rules in 2700 ms. Remains 1418 /2186 variables (removed 768) and now considering 2393/3158 (removed 765) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2701 ms. Remains : 1418/2186 places, 2393/3158 transitions.
// Phase 1: matrix 2393 rows 1418 cols
[2023-03-12 10:49:27] [INFO ] Computed 247 place invariants in 89 ms
Incomplete random walk after 1000000 steps, including 9413 resets, run finished after 4541 ms. (steps per millisecond=220 ) properties (out of 7) seen :1
FORMULA ASLink-PT-10a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 923 resets, run finished after 1659 ms. (steps per millisecond=602 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 924 resets, run finished after 1734 ms. (steps per millisecond=576 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 931 resets, run finished after 2043 ms. (steps per millisecond=489 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 919 resets, run finished after 1874 ms. (steps per millisecond=533 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 924 resets, run finished after 1907 ms. (steps per millisecond=524 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 922 resets, run finished after 1968 ms. (steps per millisecond=508 ) properties (out of 6) seen :0
[2023-03-12 10:49:43] [INFO ] Invariant cache hit.
[2023-03-12 10:49:43] [INFO ] [Real]Absence check using 65 positive place invariants in 24 ms returned sat
[2023-03-12 10:49:43] [INFO ] [Real]Absence check using 65 positive and 182 generalized place invariants in 86 ms returned sat
[2023-03-12 10:49:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:49:45] [INFO ] [Real]Absence check using state equation in 1038 ms returned sat
[2023-03-12 10:49:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:49:45] [INFO ] [Nat]Absence check using 65 positive place invariants in 35 ms returned sat
[2023-03-12 10:49:45] [INFO ] [Nat]Absence check using 65 positive and 182 generalized place invariants in 73 ms returned sat
[2023-03-12 10:49:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:49:47] [INFO ] [Nat]Absence check using state equation in 1485 ms returned sat
[2023-03-12 10:49:47] [INFO ] Computed and/alt/rep : 957/3600/957 causal constraints (skipped 1387 transitions) in 273 ms.
[2023-03-12 10:50:05] [INFO ] Added : 531 causal constraints over 107 iterations in 18560 ms. Result :sat
Minimization took 639 ms.
[2023-03-12 10:50:06] [INFO ] [Real]Absence check using 65 positive place invariants in 44 ms returned sat
[2023-03-12 10:50:07] [INFO ] [Real]Absence check using 65 positive and 182 generalized place invariants in 160 ms returned sat
[2023-03-12 10:50:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:50:08] [INFO ] [Real]Absence check using state equation in 1045 ms returned sat
[2023-03-12 10:50:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:50:08] [INFO ] [Nat]Absence check using 65 positive place invariants in 24 ms returned sat
[2023-03-12 10:50:08] [INFO ] [Nat]Absence check using 65 positive and 182 generalized place invariants in 78 ms returned sat
[2023-03-12 10:50:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:50:10] [INFO ] [Nat]Absence check using state equation in 1806 ms returned sat
[2023-03-12 10:50:10] [INFO ] Computed and/alt/rep : 957/3600/957 causal constraints (skipped 1387 transitions) in 239 ms.
[2023-03-12 10:50:30] [INFO ] Added : 540 causal constraints over 108 iterations in 20055 ms.(timeout) Result :sat
Minimization took 1360 ms.
[2023-03-12 10:50:32] [INFO ] [Real]Absence check using 65 positive place invariants in 45 ms returned sat
[2023-03-12 10:50:32] [INFO ] [Real]Absence check using 65 positive and 182 generalized place invariants in 43 ms returned sat
[2023-03-12 10:50:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:50:33] [INFO ] [Real]Absence check using state equation in 1408 ms returned sat
[2023-03-12 10:50:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:50:34] [INFO ] [Nat]Absence check using 65 positive place invariants in 46 ms returned sat
[2023-03-12 10:50:34] [INFO ] [Nat]Absence check using 65 positive and 182 generalized place invariants in 44 ms returned sat
[2023-03-12 10:50:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:50:35] [INFO ] [Nat]Absence check using state equation in 1577 ms returned sat
[2023-03-12 10:50:36] [INFO ] Computed and/alt/rep : 957/3600/957 causal constraints (skipped 1387 transitions) in 179 ms.
[2023-03-12 10:50:41] [INFO ] Added : 165 causal constraints over 33 iterations in 5395 ms. Result :sat
Minimization took 605 ms.
[2023-03-12 10:50:42] [INFO ] [Real]Absence check using 65 positive place invariants in 48 ms returned sat
[2023-03-12 10:50:42] [INFO ] [Real]Absence check using 65 positive and 182 generalized place invariants in 77 ms returned sat
[2023-03-12 10:50:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:50:43] [INFO ] [Real]Absence check using state equation in 1102 ms returned sat
[2023-03-12 10:50:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:50:44] [INFO ] [Nat]Absence check using 65 positive place invariants in 54 ms returned sat
[2023-03-12 10:50:44] [INFO ] [Nat]Absence check using 65 positive and 182 generalized place invariants in 85 ms returned sat
[2023-03-12 10:50:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:50:45] [INFO ] [Nat]Absence check using state equation in 992 ms returned sat
[2023-03-12 10:50:45] [INFO ] Computed and/alt/rep : 957/3600/957 causal constraints (skipped 1387 transitions) in 171 ms.
[2023-03-12 10:51:05] [INFO ] Added : 570 causal constraints over 114 iterations in 20112 ms.(timeout) Result :sat
Minimization took 753 ms.
[2023-03-12 10:51:06] [INFO ] [Real]Absence check using 65 positive place invariants in 23 ms returned sat
[2023-03-12 10:51:06] [INFO ] [Real]Absence check using 65 positive and 182 generalized place invariants in 46 ms returned sat
[2023-03-12 10:51:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:51:07] [INFO ] [Real]Absence check using state equation in 1069 ms returned sat
[2023-03-12 10:51:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:51:08] [INFO ] [Nat]Absence check using 65 positive place invariants in 81 ms returned sat
[2023-03-12 10:51:08] [INFO ] [Nat]Absence check using 65 positive and 182 generalized place invariants in 86 ms returned sat
[2023-03-12 10:51:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:51:10] [INFO ] [Nat]Absence check using state equation in 1806 ms returned sat
[2023-03-12 10:51:10] [INFO ] Computed and/alt/rep : 957/3600/957 causal constraints (skipped 1387 transitions) in 138 ms.
[2023-03-12 10:51:30] [INFO ] Added : 585 causal constraints over 117 iterations in 20048 ms.(timeout) Result :sat
Minimization took 1029 ms.
[2023-03-12 10:51:31] [INFO ] [Real]Absence check using 65 positive place invariants in 21 ms returned sat
[2023-03-12 10:51:31] [INFO ] [Real]Absence check using 65 positive and 182 generalized place invariants in 177 ms returned sat
[2023-03-12 10:51:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:51:32] [INFO ] [Real]Absence check using state equation in 1026 ms returned sat
[2023-03-12 10:51:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:51:33] [INFO ] [Nat]Absence check using 65 positive place invariants in 23 ms returned sat
[2023-03-12 10:51:33] [INFO ] [Nat]Absence check using 65 positive and 182 generalized place invariants in 50 ms returned sat
[2023-03-12 10:51:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:51:34] [INFO ] [Nat]Absence check using state equation in 1301 ms returned sat
[2023-03-12 10:51:34] [INFO ] Computed and/alt/rep : 957/3600/957 causal constraints (skipped 1387 transitions) in 148 ms.
[2023-03-12 10:51:54] [INFO ] Added : 615 causal constraints over 123 iterations in 20064 ms.(timeout) Result :sat
Minimization took 901 ms.
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 1418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1418/1418 places, 2393/2393 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 1417 transition count 2392
Applied a total of 2 rules in 105 ms. Remains 1417 /1418 variables (removed 1) and now considering 2392/2393 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 1417/1418 places, 2392/2393 transitions.
// Phase 1: matrix 2392 rows 1417 cols
[2023-03-12 10:52:08] [INFO ] Computed 247 place invariants in 57 ms
Incomplete random walk after 1000000 steps, including 9590 resets, run finished after 4541 ms. (steps per millisecond=220 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 924 resets, run finished after 1887 ms. (steps per millisecond=529 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 926 resets, run finished after 1812 ms. (steps per millisecond=551 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 927 resets, run finished after 1932 ms. (steps per millisecond=517 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 919 resets, run finished after 1815 ms. (steps per millisecond=550 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 917 resets, run finished after 1968 ms. (steps per millisecond=508 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 918 resets, run finished after 1884 ms. (steps per millisecond=530 ) properties (out of 6) seen :0
[2023-03-12 10:52:24] [INFO ] Invariant cache hit.
[2023-03-12 10:52:24] [INFO ] [Real]Absence check using 63 positive place invariants in 26 ms returned sat
[2023-03-12 10:52:24] [INFO ] [Real]Absence check using 63 positive and 184 generalized place invariants in 48 ms returned sat
[2023-03-12 10:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:52:26] [INFO ] [Real]Absence check using state equation in 1339 ms returned sat
[2023-03-12 10:52:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:52:26] [INFO ] [Nat]Absence check using 63 positive place invariants in 43 ms returned sat
[2023-03-12 10:52:26] [INFO ] [Nat]Absence check using 63 positive and 184 generalized place invariants in 87 ms returned sat
[2023-03-12 10:52:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:52:28] [INFO ] [Nat]Absence check using state equation in 1594 ms returned sat
[2023-03-12 10:52:28] [INFO ] Computed and/alt/rep : 956/3599/956 causal constraints (skipped 1387 transitions) in 196 ms.
[2023-03-12 10:52:48] [INFO ] Added : 565 causal constraints over 113 iterations in 20080 ms.(timeout) Result :sat
Minimization took 933 ms.
[2023-03-12 10:52:49] [INFO ] [Real]Absence check using 63 positive place invariants in 17 ms returned sat
[2023-03-12 10:52:49] [INFO ] [Real]Absence check using 63 positive and 184 generalized place invariants in 87 ms returned sat
[2023-03-12 10:52:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:52:50] [INFO ] [Real]Absence check using state equation in 1013 ms returned sat
[2023-03-12 10:52:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:52:51] [INFO ] [Nat]Absence check using 63 positive place invariants in 19 ms returned sat
[2023-03-12 10:52:51] [INFO ] [Nat]Absence check using 63 positive and 184 generalized place invariants in 39 ms returned sat
[2023-03-12 10:52:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:52:52] [INFO ] [Nat]Absence check using state equation in 1303 ms returned sat
[2023-03-12 10:52:52] [INFO ] Computed and/alt/rep : 956/3599/956 causal constraints (skipped 1387 transitions) in 158 ms.
[2023-03-12 10:53:12] [INFO ] Added : 575 causal constraints over 115 iterations in 20119 ms.(timeout) Result :sat
Minimization took 1045 ms.
[2023-03-12 10:53:14] [INFO ] [Real]Absence check using 63 positive place invariants in 28 ms returned sat
[2023-03-12 10:53:14] [INFO ] [Real]Absence check using 63 positive and 184 generalized place invariants in 39 ms returned sat
[2023-03-12 10:53:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:53:15] [INFO ] [Real]Absence check using state equation in 865 ms returned sat
[2023-03-12 10:53:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:53:15] [INFO ] [Nat]Absence check using 63 positive place invariants in 47 ms returned sat
[2023-03-12 10:53:15] [INFO ] [Nat]Absence check using 63 positive and 184 generalized place invariants in 52 ms returned sat
[2023-03-12 10:53:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:53:16] [INFO ] [Nat]Absence check using state equation in 1521 ms returned sat
[2023-03-12 10:53:17] [INFO ] Computed and/alt/rep : 956/3599/956 causal constraints (skipped 1387 transitions) in 109 ms.
[2023-03-12 10:53:37] [INFO ] Added : 710 causal constraints over 142 iterations in 20025 ms.(timeout) Result :sat
Minimization took 942 ms.
[2023-03-12 10:53:38] [INFO ] [Real]Absence check using 63 positive place invariants in 27 ms returned sat
[2023-03-12 10:53:38] [INFO ] [Real]Absence check using 63 positive and 184 generalized place invariants in 67 ms returned sat
[2023-03-12 10:53:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:53:40] [INFO ] [Real]Absence check using state equation in 1870 ms returned sat
[2023-03-12 10:53:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:53:40] [INFO ] [Nat]Absence check using 63 positive place invariants in 35 ms returned sat
[2023-03-12 10:53:40] [INFO ] [Nat]Absence check using 63 positive and 184 generalized place invariants in 71 ms returned sat
[2023-03-12 10:53:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:53:42] [INFO ] [Nat]Absence check using state equation in 1589 ms returned sat
[2023-03-12 10:53:42] [INFO ] Computed and/alt/rep : 956/3599/956 causal constraints (skipped 1387 transitions) in 151 ms.
[2023-03-12 10:54:02] [INFO ] Added : 665 causal constraints over 133 iterations in 20141 ms.(timeout) Result :sat
Minimization took 775 ms.
[2023-03-12 10:54:03] [INFO ] [Real]Absence check using 63 positive place invariants in 38 ms returned sat
[2023-03-12 10:54:03] [INFO ] [Real]Absence check using 63 positive and 184 generalized place invariants in 48 ms returned sat
[2023-03-12 10:54:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:54:04] [INFO ] [Real]Absence check using state equation in 1145 ms returned sat
[2023-03-12 10:54:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:54:05] [INFO ] [Nat]Absence check using 63 positive place invariants in 37 ms returned sat
[2023-03-12 10:54:05] [INFO ] [Nat]Absence check using 63 positive and 184 generalized place invariants in 77 ms returned sat
[2023-03-12 10:54:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:54:08] [INFO ] [Nat]Absence check using state equation in 2686 ms returned sat
[2023-03-12 10:54:08] [INFO ] Deduced a trap composed of 98 places in 305 ms of which 8 ms to minimize.
[2023-03-12 10:54:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 532 ms
[2023-03-12 10:54:08] [INFO ] Computed and/alt/rep : 956/3599/956 causal constraints (skipped 1387 transitions) in 181 ms.
[2023-03-12 10:54:14] [INFO ] Added : 148 causal constraints over 30 iterations in 5599 ms. Result :sat
Minimization took 580 ms.
[2023-03-12 10:54:15] [INFO ] [Real]Absence check using 63 positive place invariants in 53 ms returned sat
[2023-03-12 10:54:15] [INFO ] [Real]Absence check using 63 positive and 184 generalized place invariants in 75 ms returned sat
[2023-03-12 10:54:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:54:16] [INFO ] [Real]Absence check using state equation in 969 ms returned sat
[2023-03-12 10:54:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:54:16] [INFO ] [Nat]Absence check using 63 positive place invariants in 137 ms returned sat
[2023-03-12 10:54:16] [INFO ] [Nat]Absence check using 63 positive and 184 generalized place invariants in 81 ms returned sat
[2023-03-12 10:54:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:54:18] [INFO ] [Nat]Absence check using state equation in 1498 ms returned sat
[2023-03-12 10:54:18] [INFO ] Computed and/alt/rep : 956/3599/956 causal constraints (skipped 1387 transitions) in 161 ms.
[2023-03-12 10:54:29] [INFO ] Added : 276 causal constraints over 57 iterations in 10872 ms. Result :sat
Minimization took 1263 ms.
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 1417 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1417/1417 places, 2392/2392 transitions.
Applied a total of 0 rules in 53 ms. Remains 1417 /1417 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 1417/1417 places, 2392/2392 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1417/1417 places, 2392/2392 transitions.
Applied a total of 0 rules in 50 ms. Remains 1417 /1417 variables (removed 0) and now considering 2392/2392 (removed 0) transitions.
[2023-03-12 10:54:43] [INFO ] Invariant cache hit.
[2023-03-12 10:54:45] [INFO ] Implicit Places using invariants in 1712 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 271, 272, 273, 291, 309, 379, 383, 384, 395, 396, 397, 415, 433, 470, 504, 508, 509, 520, 521, 522, 540, 558, 627, 631, 632, 643, 644, 645, 663, 681, 750, 754, 755, 766, 767, 768, 786, 804, 873, 877, 878, 889, 890, 891, 909, 927, 962, 998, 1002, 1003, 1014, 1015, 1016, 1034, 1052, 1121, 1125, 1126, 1137, 1138, 1139, 1157, 1175, 1244, 1248, 1249, 1252, 1263, 1264, 1265, 1283, 1285, 1288, 1306, 1307, 1308, 1309, 1321, 1327, 1333, 1339, 1345, 1351, 1357, 1363, 1369, 1375, 1381]
Discarding 104 places :
Implicit Place search using SMT only with invariants took 1720 ms to find 104 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1313/1417 places, 2392/2392 transitions.
Drop transitions removed 176 transitions
Trivial Post-agglo rules discarded 176 transitions
Performed 176 trivial Post agglomeration. Transition count delta: 176
Iterating post reduction 0 with 176 rules applied. Total rules applied 176 place count 1313 transition count 2216
Reduce places removed 176 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 179 rules applied. Total rules applied 355 place count 1137 transition count 2213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 358 place count 1134 transition count 2213
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 358 place count 1134 transition count 2168
Deduced a syphon composed of 45 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 91 rules applied. Total rules applied 449 place count 1088 transition count 2168
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 461 place count 1084 transition count 2160
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 469 place count 1076 transition count 2160
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 484 place count 1061 transition count 2145
Iterating global reduction 5 with 15 rules applied. Total rules applied 499 place count 1061 transition count 2145
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 502 place count 1061 transition count 2142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 502 place count 1061 transition count 2141
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 504 place count 1060 transition count 2141
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 507 place count 1057 transition count 2138
Iterating global reduction 6 with 3 rules applied. Total rules applied 510 place count 1057 transition count 2138
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 511 place count 1056 transition count 2137
Iterating global reduction 6 with 1 rules applied. Total rules applied 512 place count 1056 transition count 2137
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 513 place count 1055 transition count 2136
Iterating global reduction 6 with 1 rules applied. Total rules applied 514 place count 1055 transition count 2136
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 2 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 6 with 160 rules applied. Total rules applied 674 place count 975 transition count 2056
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 682 place count 975 transition count 2048
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 691 place count 966 transition count 2039
Iterating global reduction 7 with 9 rules applied. Total rules applied 700 place count 966 transition count 2039
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 708 place count 966 transition count 2031
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 711 place count 966 transition count 2028
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 713 place count 965 transition count 2027
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 8 with 22 rules applied. Total rules applied 735 place count 965 transition count 2005
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 758 place count 942 transition count 2005
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 9 with 30 rules applied. Total rules applied 788 place count 942 transition count 2005
Applied a total of 788 rules in 581 ms. Remains 942 /1313 variables (removed 371) and now considering 2005/2392 (removed 387) transitions.
// Phase 1: matrix 2005 rows 942 cols
[2023-03-12 10:54:46] [INFO ] Computed 137 place invariants in 43 ms
[2023-03-12 10:54:46] [INFO ] Implicit Places using invariants in 901 ms returned [89, 95, 98, 100, 104, 105, 157, 174, 180, 183, 185, 190, 191, 243, 260, 267, 270, 272, 277, 278, 330, 349, 355, 358, 360, 365, 366, 418, 435, 441, 444, 446, 451, 452, 504, 521, 527, 530, 532, 537, 538, 590, 607, 613, 616, 618, 624, 625, 677, 696, 702, 705, 707, 712, 713, 765, 782, 788, 791, 793, 798, 799, 851, 868, 874, 877, 879]
Discarding 67 places :
Implicit Place search using SMT only with invariants took 905 ms to find 67 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 875/1417 places, 2005/2392 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 846 transition count 1976
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 846 transition count 1976
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 837 transition count 1967
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 837 transition count 1967
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 114 place count 818 transition count 1948
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 144 place count 818 transition count 1918
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 174 place count 788 transition count 1918
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 1 with 8 rules applied. Total rules applied 182 place count 788 transition count 1910
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 190 place count 780 transition count 1910
Applied a total of 190 rules in 174 ms. Remains 780 /875 variables (removed 95) and now considering 1910/2005 (removed 95) transitions.
// Phase 1: matrix 1910 rows 780 cols
[2023-03-12 10:54:47] [INFO ] Computed 70 place invariants in 41 ms
[2023-03-12 10:54:47] [INFO ] Implicit Places using invariants in 781 ms returned []
[2023-03-12 10:54:47] [INFO ] Invariant cache hit.
[2023-03-12 10:54:50] [INFO ] Implicit Places using invariants and state equation in 2133 ms returned []
Implicit Place search using SMT with State Equation took 2944 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 780/1417 places, 1910/2392 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 6375 ms. Remains : 780/1417 places, 1910/2392 transitions.
Successfully produced net in file /tmp/petri1000_7832296216566957990.dot
Successfully produced net in file /tmp/petri1001_6278573740758130224.dot
Successfully produced net in file /tmp/petri1002_11662446988976002986.dot
Successfully produced net in file /tmp/petri1003_3203200113413281885.dot
Successfully produced net in file /tmp/petri1004_17836423424200509081.dot
Successfully produced net in file /tmp/petri1005_14573120128591198368.dot
Successfully produced net in file /tmp/petri1006_6545262458679006078.dot
Successfully produced net in file /tmp/petri1007_1211458750037959687.dot
Successfully produced net in file /tmp/petri1008_4433657835844996814.dot
Successfully produced net in file /tmp/petri1009_14508567577129987803.dot
Drop transitions removed 10 transitions
Dominated transitions for bounds rules discarded 10 transitions
// Phase 1: matrix 1900 rows 780 cols
[2023-03-12 10:54:50] [INFO ] Computed 70 place invariants in 21 ms
Incomplete random walk after 1000000 steps, including 16095 resets, run finished after 2781 ms. (steps per millisecond=359 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2204 resets, run finished after 849 ms. (steps per millisecond=1177 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2218 resets, run finished after 902 ms. (steps per millisecond=1108 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2223 resets, run finished after 1001 ms. (steps per millisecond=999 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2213 resets, run finished after 949 ms. (steps per millisecond=1053 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2239 resets, run finished after 888 ms. (steps per millisecond=1126 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2211 resets, run finished after 848 ms. (steps per millisecond=1179 ) properties (out of 6) seen :0
[2023-03-12 10:54:58] [INFO ] Invariant cache hit.
[2023-03-12 10:54:58] [INFO ] [Real]Absence check using 15 positive place invariants in 20 ms returned sat
[2023-03-12 10:54:58] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 19 ms returned sat
[2023-03-12 10:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:54:59] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2023-03-12 10:54:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:54:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-12 10:54:59] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 20 ms returned sat
[2023-03-12 10:54:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:00] [INFO ] [Nat]Absence check using state equation in 709 ms returned sat
[2023-03-12 10:55:00] [INFO ] Computed and/alt/rep : 454/1926/454 causal constraints (skipped 1400 transitions) in 153 ms.
[2023-03-12 10:55:05] [INFO ] Added : 124 causal constraints over 25 iterations in 4845 ms. Result :sat
Minimization took 298 ms.
[2023-03-12 10:55:05] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-12 10:55:05] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 79 ms returned sat
[2023-03-12 10:55:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:06] [INFO ] [Real]Absence check using state equation in 493 ms returned sat
[2023-03-12 10:55:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:55:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 22 ms returned sat
[2023-03-12 10:55:06] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 56 ms returned sat
[2023-03-12 10:55:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:07] [INFO ] [Nat]Absence check using state equation in 1163 ms returned sat
[2023-03-12 10:55:08] [INFO ] Computed and/alt/rep : 454/1926/454 causal constraints (skipped 1400 transitions) in 195 ms.
[2023-03-12 10:55:10] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 1 ms to minimize.
[2023-03-12 10:55:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 408 ms
[2023-03-12 10:55:10] [INFO ] Added : 64 causal constraints over 13 iterations in 2933 ms. Result :sat
Minimization took 374 ms.
[2023-03-12 10:55:11] [INFO ] [Real]Absence check using 15 positive place invariants in 23 ms returned sat
[2023-03-12 10:55:11] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 110 ms returned sat
[2023-03-12 10:55:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:12] [INFO ] [Real]Absence check using state equation in 737 ms returned sat
[2023-03-12 10:55:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:55:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 37 ms returned sat
[2023-03-12 10:55:12] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 74 ms returned sat
[2023-03-12 10:55:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:13] [INFO ] [Nat]Absence check using state equation in 997 ms returned sat
[2023-03-12 10:55:13] [INFO ] Computed and/alt/rep : 454/1926/454 causal constraints (skipped 1400 transitions) in 130 ms.
[2023-03-12 10:55:15] [INFO ] Added : 57 causal constraints over 12 iterations in 1806 ms. Result :sat
Minimization took 448 ms.
[2023-03-12 10:55:16] [INFO ] [Real]Absence check using 15 positive place invariants in 61 ms returned sat
[2023-03-12 10:55:16] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 87 ms returned sat
[2023-03-12 10:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:17] [INFO ] [Real]Absence check using state equation in 845 ms returned sat
[2023-03-12 10:55:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:55:17] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-12 10:55:17] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 68 ms returned sat
[2023-03-12 10:55:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:18] [INFO ] [Nat]Absence check using state equation in 647 ms returned sat
[2023-03-12 10:55:18] [INFO ] Computed and/alt/rep : 454/1926/454 causal constraints (skipped 1400 transitions) in 108 ms.
[2023-03-12 10:55:19] [INFO ] Added : 18 causal constraints over 4 iterations in 826 ms. Result :sat
Minimization took 327 ms.
[2023-03-12 10:55:19] [INFO ] [Real]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-03-12 10:55:19] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 36 ms returned sat
[2023-03-12 10:55:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:20] [INFO ] [Real]Absence check using state equation in 904 ms returned sat
[2023-03-12 10:55:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:55:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 42 ms returned sat
[2023-03-12 10:55:20] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 19 ms returned sat
[2023-03-12 10:55:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:21] [INFO ] [Nat]Absence check using state equation in 970 ms returned sat
[2023-03-12 10:55:22] [INFO ] Computed and/alt/rep : 454/1926/454 causal constraints (skipped 1400 transitions) in 211 ms.
[2023-03-12 10:55:24] [INFO ] Added : 65 causal constraints over 13 iterations in 2059 ms. Result :sat
Minimization took 437 ms.
[2023-03-12 10:55:24] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-12 10:55:24] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 17 ms returned sat
[2023-03-12 10:55:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:25] [INFO ] [Real]Absence check using state equation in 1081 ms returned sat
[2023-03-12 10:55:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:55:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-12 10:55:26] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 15 ms returned sat
[2023-03-12 10:55:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:26] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2023-03-12 10:55:26] [INFO ] Computed and/alt/rep : 454/1926/454 causal constraints (skipped 1400 transitions) in 121 ms.
[2023-03-12 10:55:27] [INFO ] Added : 20 causal constraints over 4 iterations in 475 ms. Result :sat
Minimization took 164 ms.
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 780 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 780/780 places, 1900/1900 transitions.
Graph (complete) has 4701 edges and 780 vertex of which 770 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 11 place count 770 transition count 1900
Applied a total of 11 rules in 58 ms. Remains 770 /780 variables (removed 10) and now considering 1900/1900 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 770/780 places, 1900/1900 transitions.
// Phase 1: matrix 1900 rows 770 cols
[2023-03-12 10:55:29] [INFO ] Computed 70 place invariants in 41 ms
Incomplete random walk after 1000000 steps, including 16208 resets, run finished after 2961 ms. (steps per millisecond=337 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2200 resets, run finished after 981 ms. (steps per millisecond=1019 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2228 resets, run finished after 964 ms. (steps per millisecond=1037 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2214 resets, run finished after 917 ms. (steps per millisecond=1090 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2218 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2228 resets, run finished after 848 ms. (steps per millisecond=1179 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2208 resets, run finished after 1002 ms. (steps per millisecond=998 ) properties (out of 6) seen :0
[2023-03-12 10:55:38] [INFO ] Invariant cache hit.
[2023-03-12 10:55:38] [INFO ] [Real]Absence check using 15 positive place invariants in 52 ms returned sat
[2023-03-12 10:55:38] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 125 ms returned sat
[2023-03-12 10:55:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:39] [INFO ] [Real]Absence check using state equation in 747 ms returned sat
[2023-03-12 10:55:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:55:39] [INFO ] [Nat]Absence check using 15 positive place invariants in 20 ms returned sat
[2023-03-12 10:55:39] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 16 ms returned sat
[2023-03-12 10:55:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:40] [INFO ] [Nat]Absence check using state equation in 1268 ms returned sat
[2023-03-12 10:55:41] [INFO ] Computed and/alt/rep : 454/1924/454 causal constraints (skipped 1400 transitions) in 106 ms.
[2023-03-12 10:55:43] [INFO ] Added : 86 causal constraints over 18 iterations in 2661 ms. Result :sat
Minimization took 296 ms.
[2023-03-12 10:55:44] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-12 10:55:44] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 67 ms returned sat
[2023-03-12 10:55:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:45] [INFO ] [Real]Absence check using state equation in 830 ms returned sat
[2023-03-12 10:55:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:55:45] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-03-12 10:55:45] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 106 ms returned sat
[2023-03-12 10:55:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:46] [INFO ] [Nat]Absence check using state equation in 1285 ms returned sat
[2023-03-12 10:55:46] [INFO ] Computed and/alt/rep : 454/1924/454 causal constraints (skipped 1400 transitions) in 114 ms.
[2023-03-12 10:55:49] [INFO ] Deduced a trap composed of 61 places in 261 ms of which 24 ms to minimize.
[2023-03-12 10:55:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 423 ms
[2023-03-12 10:55:49] [INFO ] Added : 89 causal constraints over 18 iterations in 3166 ms. Result :sat
Minimization took 482 ms.
[2023-03-12 10:55:50] [INFO ] [Real]Absence check using 15 positive place invariants in 107 ms returned sat
[2023-03-12 10:55:50] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 58 ms returned sat
[2023-03-12 10:55:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:51] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2023-03-12 10:55:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:55:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 58 ms returned sat
[2023-03-12 10:55:51] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 23 ms returned sat
[2023-03-12 10:55:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:52] [INFO ] [Nat]Absence check using state equation in 861 ms returned sat
[2023-03-12 10:55:53] [INFO ] Computed and/alt/rep : 454/1924/454 causal constraints (skipped 1400 transitions) in 212 ms.
[2023-03-12 10:55:54] [INFO ] Added : 39 causal constraints over 10 iterations in 1708 ms. Result :sat
Minimization took 331 ms.
[2023-03-12 10:55:55] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-12 10:55:55] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 43 ms returned sat
[2023-03-12 10:55:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:55] [INFO ] [Real]Absence check using state equation in 568 ms returned sat
[2023-03-12 10:55:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:55:55] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2023-03-12 10:55:56] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 123 ms returned sat
[2023-03-12 10:55:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:55:57] [INFO ] [Nat]Absence check using state equation in 1041 ms returned sat
[2023-03-12 10:55:57] [INFO ] Computed and/alt/rep : 454/1924/454 causal constraints (skipped 1400 transitions) in 107 ms.
[2023-03-12 10:56:01] [INFO ] Added : 100 causal constraints over 21 iterations in 4016 ms. Result :sat
Minimization took 433 ms.
[2023-03-12 10:56:01] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2023-03-12 10:56:02] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 50 ms returned sat
[2023-03-12 10:56:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:56:02] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2023-03-12 10:56:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:56:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-12 10:56:03] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 15 ms returned sat
[2023-03-12 10:56:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:56:04] [INFO ] [Nat]Absence check using state equation in 992 ms returned sat
[2023-03-12 10:56:04] [INFO ] Computed and/alt/rep : 454/1924/454 causal constraints (skipped 1400 transitions) in 108 ms.
[2023-03-12 10:56:05] [INFO ] Added : 36 causal constraints over 8 iterations in 1620 ms. Result :sat
Minimization took 367 ms.
[2023-03-12 10:56:06] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2023-03-12 10:56:06] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 20 ms returned sat
[2023-03-12 10:56:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:56:07] [INFO ] [Real]Absence check using state equation in 798 ms returned sat
[2023-03-12 10:56:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:56:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2023-03-12 10:56:07] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 30 ms returned sat
[2023-03-12 10:56:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:56:08] [INFO ] [Nat]Absence check using state equation in 735 ms returned sat
[2023-03-12 10:56:08] [INFO ] Computed and/alt/rep : 454/1924/454 causal constraints (skipped 1400 transitions) in 100 ms.
[2023-03-12 10:56:09] [INFO ] Added : 32 causal constraints over 9 iterations in 1510 ms. Result :sat
Minimization took 269 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-10a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1900/1900 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 770 transition count 1899
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 769 transition count 1899
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 768 transition count 1898
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 768 transition count 1898
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 768 transition count 1897
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 768 transition count 1896
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7 place count 767 transition count 1896
Applied a total of 7 rules in 115 ms. Remains 767 /770 variables (removed 3) and now considering 1896/1900 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 767/770 places, 1896/1900 transitions.
Successfully produced net in file /tmp/petri1010_540626955995826310.dot
Drop transitions removed 1 transitions
Dominated transitions for bounds rules discarded 1 transitions
// Phase 1: matrix 1895 rows 767 cols
[2023-03-12 10:56:13] [INFO ] Computed 70 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 16109 resets, run finished after 2347 ms. (steps per millisecond=426 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2209 resets, run finished after 802 ms. (steps per millisecond=1246 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2213 resets, run finished after 922 ms. (steps per millisecond=1084 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2204 resets, run finished after 815 ms. (steps per millisecond=1226 ) properties (out of 3) seen :0
[2023-03-12 10:56:17] [INFO ] Invariant cache hit.
[2023-03-12 10:56:18] [INFO ] [Real]Absence check using 15 positive place invariants in 28 ms returned sat
[2023-03-12 10:56:18] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 34 ms returned sat
[2023-03-12 10:56:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:56:18] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2023-03-12 10:56:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:56:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-12 10:56:18] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 128 ms returned sat
[2023-03-12 10:56:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:56:19] [INFO ] [Nat]Absence check using state equation in 710 ms returned sat
[2023-03-12 10:56:19] [INFO ] Computed and/alt/rep : 449/1902/449 causal constraints (skipped 1400 transitions) in 152 ms.
[2023-03-12 10:56:21] [INFO ] Added : 36 causal constraints over 8 iterations in 1311 ms. Result :sat
Minimization took 214 ms.
[2023-03-12 10:56:21] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-12 10:56:21] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 37 ms returned sat
[2023-03-12 10:56:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:56:22] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2023-03-12 10:56:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:56:22] [INFO ] [Nat]Absence check using 15 positive place invariants in 23 ms returned sat
[2023-03-12 10:56:22] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 27 ms returned sat
[2023-03-12 10:56:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:56:22] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2023-03-12 10:56:23] [INFO ] Computed and/alt/rep : 449/1902/449 causal constraints (skipped 1400 transitions) in 104 ms.
[2023-03-12 10:56:24] [INFO ] Deduced a trap composed of 57 places in 186 ms of which 1 ms to minimize.
[2023-03-12 10:56:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 404 ms
[2023-03-12 10:56:24] [INFO ] Added : 43 causal constraints over 9 iterations in 1906 ms. Result :sat
Minimization took 254 ms.
[2023-03-12 10:56:25] [INFO ] [Real]Absence check using 15 positive place invariants in 46 ms returned sat
[2023-03-12 10:56:25] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 23 ms returned sat
[2023-03-12 10:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:56:26] [INFO ] [Real]Absence check using state equation in 616 ms returned sat
[2023-03-12 10:56:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:56:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-12 10:56:26] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 91 ms returned sat
[2023-03-12 10:56:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:56:27] [INFO ] [Nat]Absence check using state equation in 1205 ms returned sat
[2023-03-12 10:56:27] [INFO ] Computed and/alt/rep : 449/1902/449 causal constraints (skipped 1400 transitions) in 136 ms.
[2023-03-12 10:56:29] [INFO ] Added : 52 causal constraints over 13 iterations in 1839 ms. Result :sat
Minimization took 323 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 767/767 places, 1895/1895 transitions.
Graph (complete) has 4711 edges and 767 vertex of which 766 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 766 transition count 1895
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 765 transition count 1894
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 765 transition count 1894
Applied a total of 4 rules in 100 ms. Remains 765 /767 variables (removed 2) and now considering 1894/1895 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 765/767 places, 1894/1895 transitions.
// Phase 1: matrix 1894 rows 765 cols
[2023-03-12 10:56:30] [INFO ] Computed 70 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 16242 resets, run finished after 2712 ms. (steps per millisecond=368 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2214 resets, run finished after 955 ms. (steps per millisecond=1047 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2215 resets, run finished after 998 ms. (steps per millisecond=1002 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2192 resets, run finished after 962 ms. (steps per millisecond=1039 ) properties (out of 3) seen :0
[2023-03-12 10:56:36] [INFO ] Invariant cache hit.
[2023-03-12 10:56:36] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-12 10:56:36] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 25 ms returned sat
[2023-03-12 10:56:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:56:37] [INFO ] [Real]Absence check using state equation in 784 ms returned sat
[2023-03-12 10:56:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:56:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-12 10:56:37] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 17 ms returned sat
[2023-03-12 10:56:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:56:38] [INFO ] [Nat]Absence check using state equation in 691 ms returned sat
[2023-03-12 10:56:38] [INFO ] Computed and/alt/rep : 448/1900/448 causal constraints (skipped 1400 transitions) in 143 ms.
[2023-03-12 10:56:40] [INFO ] Added : 53 causal constraints over 11 iterations in 2030 ms. Result :sat
Minimization took 331 ms.
[2023-03-12 10:56:40] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-12 10:56:40] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 89 ms returned sat
[2023-03-12 10:56:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:56:41] [INFO ] [Real]Absence check using state equation in 562 ms returned sat
[2023-03-12 10:56:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:56:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-12 10:56:41] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 35 ms returned sat
[2023-03-12 10:56:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:56:42] [INFO ] [Nat]Absence check using state equation in 719 ms returned sat
[2023-03-12 10:56:42] [INFO ] Computed and/alt/rep : 448/1900/448 causal constraints (skipped 1400 transitions) in 139 ms.
[2023-03-12 10:56:45] [INFO ] Added : 75 causal constraints over 15 iterations in 2639 ms. Result :sat
Minimization took 207 ms.
[2023-03-12 10:56:45] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-12 10:56:45] [INFO ] [Real]Absence check using 15 positive and 55 generalized place invariants in 15 ms returned sat
[2023-03-12 10:56:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:56:46] [INFO ] [Real]Absence check using state equation in 475 ms returned sat
[2023-03-12 10:56:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:56:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-12 10:56:46] [INFO ] [Nat]Absence check using 15 positive and 55 generalized place invariants in 17 ms returned sat
[2023-03-12 10:56:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:56:47] [INFO ] [Nat]Absence check using state equation in 863 ms returned sat
[2023-03-12 10:56:47] [INFO ] Computed and/alt/rep : 448/1900/448 causal constraints (skipped 1400 transitions) in 197 ms.
[2023-03-12 10:56:50] [INFO ] Deduced a trap composed of 54 places in 234 ms of which 1 ms to minimize.
[2023-03-12 10:56:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 402 ms
[2023-03-12 10:56:50] [INFO ] Added : 73 causal constraints over 16 iterations in 3026 ms. Result :sat
Minimization took 260 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 765 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 1894/1894 transitions.
Applied a total of 0 rules in 25 ms. Remains 765 /765 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 765/765 places, 1894/1894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 765/765 places, 1894/1894 transitions.
Applied a total of 0 rules in 24 ms. Remains 765 /765 variables (removed 0) and now considering 1894/1894 (removed 0) transitions.
[2023-03-12 10:56:51] [INFO ] Invariant cache hit.
[2023-03-12 10:56:52] [INFO ] Implicit Places using invariants in 536 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 539 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 764/765 places, 1894/1894 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 763 transition count 1893
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 763 transition count 1892
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 762 transition count 1892
Applied a total of 4 rules in 76 ms. Remains 762 /764 variables (removed 2) and now considering 1892/1894 (removed 2) transitions.
// Phase 1: matrix 1892 rows 762 cols
[2023-03-12 10:56:52] [INFO ] Computed 69 place invariants in 31 ms
[2023-03-12 10:56:53] [INFO ] Implicit Places using invariants in 744 ms returned []
[2023-03-12 10:56:53] [INFO ] Invariant cache hit.
[2023-03-12 10:56:55] [INFO ] Implicit Places using invariants and state equation in 2188 ms returned []
Implicit Place search using SMT with State Equation took 2949 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 762/765 places, 1892/1894 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3589 ms. Remains : 762/765 places, 1892/1894 transitions.
[2023-03-12 10:56:55] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16252 resets, run finished after 2868 ms. (steps per millisecond=348 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2224 resets, run finished after 939 ms. (steps per millisecond=1064 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2178 resets, run finished after 979 ms. (steps per millisecond=1021 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2235 resets, run finished after 945 ms. (steps per millisecond=1058 ) properties (out of 3) seen :0
[2023-03-12 10:57:01] [INFO ] Invariant cache hit.
[2023-03-12 10:57:01] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2023-03-12 10:57:01] [INFO ] [Real]Absence check using 17 positive and 52 generalized place invariants in 52 ms returned sat
[2023-03-12 10:57:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:57:01] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2023-03-12 10:57:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:57:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-12 10:57:02] [INFO ] [Nat]Absence check using 17 positive and 52 generalized place invariants in 23 ms returned sat
[2023-03-12 10:57:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:57:03] [INFO ] [Nat]Absence check using state equation in 855 ms returned sat
[2023-03-12 10:57:03] [INFO ] Computed and/alt/rep : 439/1827/439 causal constraints (skipped 1407 transitions) in 217 ms.
[2023-03-12 10:57:04] [INFO ] Added : 36 causal constraints over 8 iterations in 1238 ms. Result :sat
Minimization took 228 ms.
[2023-03-12 10:57:04] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2023-03-12 10:57:05] [INFO ] [Real]Absence check using 17 positive and 52 generalized place invariants in 143 ms returned sat
[2023-03-12 10:57:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:57:05] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2023-03-12 10:57:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:57:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 48 ms returned sat
[2023-03-12 10:57:06] [INFO ] [Nat]Absence check using 17 positive and 52 generalized place invariants in 18 ms returned sat
[2023-03-12 10:57:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:57:06] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2023-03-12 10:57:07] [INFO ] Computed and/alt/rep : 439/1827/439 causal constraints (skipped 1407 transitions) in 147 ms.
[2023-03-12 10:57:07] [INFO ] Added : 16 causal constraints over 4 iterations in 782 ms. Result :sat
Minimization took 180 ms.
[2023-03-12 10:57:08] [INFO ] [Real]Absence check using 17 positive place invariants in 96 ms returned sat
[2023-03-12 10:57:08] [INFO ] [Real]Absence check using 17 positive and 52 generalized place invariants in 26 ms returned sat
[2023-03-12 10:57:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:57:08] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2023-03-12 10:57:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:57:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 31 ms returned sat
[2023-03-12 10:57:09] [INFO ] [Nat]Absence check using 17 positive and 52 generalized place invariants in 28 ms returned sat
[2023-03-12 10:57:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:57:09] [INFO ] [Nat]Absence check using state equation in 704 ms returned sat
[2023-03-12 10:57:10] [INFO ] Computed and/alt/rep : 439/1827/439 causal constraints (skipped 1407 transitions) in 193 ms.
[2023-03-12 10:57:11] [INFO ] Added : 47 causal constraints over 10 iterations in 1985 ms. Result :sat
Minimization took 248 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 1892/1892 transitions.
Applied a total of 0 rules in 25 ms. Remains 762 /762 variables (removed 0) and now considering 1892/1892 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 762/762 places, 1892/1892 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 1892/1892 transitions.
Applied a total of 0 rules in 24 ms. Remains 762 /762 variables (removed 0) and now considering 1892/1892 (removed 0) transitions.
[2023-03-12 10:57:12] [INFO ] Invariant cache hit.
[2023-03-12 10:57:13] [INFO ] Implicit Places using invariants in 601 ms returned []
[2023-03-12 10:57:13] [INFO ] Invariant cache hit.
[2023-03-12 10:57:15] [INFO ] Implicit Places using invariants and state equation in 2292 ms returned []
Implicit Place search using SMT with State Equation took 2951 ms to find 0 implicit places.
[2023-03-12 10:57:16] [INFO ] Redundant transitions in 150 ms returned []
[2023-03-12 10:57:16] [INFO ] Invariant cache hit.
[2023-03-12 10:57:17] [INFO ] Dead Transitions using invariants and state equation in 954 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4089 ms. Remains : 762/762 places, 1892/1892 transitions.
Starting property specific reduction for ASLink-PT-10a-UpperBounds-04
[2023-03-12 10:57:17] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 158 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-12 10:57:17] [INFO ] Invariant cache hit.
[2023-03-12 10:57:17] [INFO ] [Real]Absence check using 17 positive place invariants in 41 ms returned sat
[2023-03-12 10:57:17] [INFO ] [Real]Absence check using 17 positive and 52 generalized place invariants in 42 ms returned sat
[2023-03-12 10:57:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:57:18] [INFO ] [Real]Absence check using state equation in 953 ms returned sat
[2023-03-12 10:57:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:57:18] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-03-12 10:57:18] [INFO ] [Nat]Absence check using 17 positive and 52 generalized place invariants in 14 ms returned sat
[2023-03-12 10:57:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:57:19] [INFO ] [Nat]Absence check using state equation in 763 ms returned sat
[2023-03-12 10:57:19] [INFO ] Computed and/alt/rep : 439/1827/439 causal constraints (skipped 1407 transitions) in 113 ms.
[2023-03-12 10:57:20] [INFO ] Added : 36 causal constraints over 8 iterations in 1052 ms. Result :sat
Minimization took 221 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 1892/1892 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 1890
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 760 transition count 1890
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 760 transition count 1888
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 758 transition count 1888
Applied a total of 8 rules in 34 ms. Remains 758 /762 variables (removed 4) and now considering 1888/1892 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 758/762 places, 1888/1892 transitions.
// Phase 1: matrix 1888 rows 758 cols
[2023-03-12 10:57:20] [INFO ] Computed 69 place invariants in 26 ms
Incomplete random walk after 1000000 steps, including 16221 resets, run finished after 3085 ms. (steps per millisecond=324 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2243 resets, run finished after 1007 ms. (steps per millisecond=993 ) properties (out of 1) seen :0
[2023-03-12 10:57:24] [INFO ] Invariant cache hit.
[2023-03-12 10:57:25] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-12 10:57:25] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 42 ms returned sat
[2023-03-12 10:57:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:57:25] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2023-03-12 10:57:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:57:26] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2023-03-12 10:57:26] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 23 ms returned sat
[2023-03-12 10:57:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:57:26] [INFO ] [Nat]Absence check using state equation in 922 ms returned sat
[2023-03-12 10:57:27] [INFO ] Computed and/alt/rep : 435/1823/435 causal constraints (skipped 1407 transitions) in 130 ms.
[2023-03-12 10:57:34] [INFO ] Added : 90 causal constraints over 18 iterations in 7480 ms. Result :sat
Minimization took 244 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 1888/1888 transitions.
Applied a total of 0 rules in 25 ms. Remains 758 /758 variables (removed 0) and now considering 1888/1888 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 758/758 places, 1888/1888 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 1888/1888 transitions.
Applied a total of 0 rules in 27 ms. Remains 758 /758 variables (removed 0) and now considering 1888/1888 (removed 0) transitions.
[2023-03-12 10:57:35] [INFO ] Invariant cache hit.
[2023-03-12 10:57:35] [INFO ] Implicit Places using invariants in 558 ms returned []
[2023-03-12 10:57:35] [INFO ] Invariant cache hit.
[2023-03-12 10:57:37] [INFO ] Implicit Places using invariants and state equation in 2117 ms returned []
Implicit Place search using SMT with State Equation took 2703 ms to find 0 implicit places.
[2023-03-12 10:57:37] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-12 10:57:37] [INFO ] Invariant cache hit.
[2023-03-12 10:57:38] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3490 ms. Remains : 758/758 places, 1888/1888 transitions.
Ending property specific reduction for ASLink-PT-10a-UpperBounds-04 in 21489 ms.
Starting property specific reduction for ASLink-PT-10a-UpperBounds-11
// Phase 1: matrix 1892 rows 762 cols
[2023-03-12 10:57:38] [INFO ] Computed 69 place invariants in 17 ms
Incomplete random walk after 10000 steps, including 162 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-12 10:57:38] [INFO ] Invariant cache hit.
[2023-03-12 10:57:38] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-03-12 10:57:38] [INFO ] [Real]Absence check using 17 positive and 52 generalized place invariants in 16 ms returned sat
[2023-03-12 10:57:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:57:39] [INFO ] [Real]Absence check using state equation in 527 ms returned sat
[2023-03-12 10:57:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:57:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 46 ms returned sat
[2023-03-12 10:57:39] [INFO ] [Nat]Absence check using 17 positive and 52 generalized place invariants in 27 ms returned sat
[2023-03-12 10:57:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:57:40] [INFO ] [Nat]Absence check using state equation in 894 ms returned sat
[2023-03-12 10:57:40] [INFO ] Computed and/alt/rep : 439/1827/439 causal constraints (skipped 1407 transitions) in 118 ms.
[2023-03-12 10:57:41] [INFO ] Added : 16 causal constraints over 4 iterations in 761 ms. Result :sat
Minimization took 169 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 1892/1892 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 1890
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 760 transition count 1890
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 760 transition count 1889
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 759 transition count 1889
Applied a total of 6 rules in 36 ms. Remains 759 /762 variables (removed 3) and now considering 1889/1892 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 759/762 places, 1889/1892 transitions.
// Phase 1: matrix 1889 rows 759 cols
[2023-03-12 10:57:41] [INFO ] Computed 69 place invariants in 42 ms
Incomplete random walk after 1000000 steps, including 16072 resets, run finished after 2644 ms. (steps per millisecond=378 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2205 resets, run finished after 771 ms. (steps per millisecond=1297 ) properties (out of 1) seen :0
[2023-03-12 10:57:45] [INFO ] Invariant cache hit.
[2023-03-12 10:57:45] [INFO ] [Real]Absence check using 15 positive place invariants in 24 ms returned sat
[2023-03-12 10:57:45] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 54 ms returned sat
[2023-03-12 10:57:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:57:45] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2023-03-12 10:57:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:57:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-12 10:57:46] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 24 ms returned sat
[2023-03-12 10:57:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:57:47] [INFO ] [Nat]Absence check using state equation in 1050 ms returned sat
[2023-03-12 10:57:47] [INFO ] Computed and/alt/rep : 436/1824/436 causal constraints (skipped 1407 transitions) in 120 ms.
[2023-03-12 10:57:48] [INFO ] Added : 55 causal constraints over 11 iterations in 1113 ms. Result :sat
Minimization took 231 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1889/1889 transitions.
Applied a total of 0 rules in 24 ms. Remains 759 /759 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 759/759 places, 1889/1889 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1889/1889 transitions.
Applied a total of 0 rules in 23 ms. Remains 759 /759 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
[2023-03-12 10:57:49] [INFO ] Invariant cache hit.
[2023-03-12 10:57:49] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-12 10:57:49] [INFO ] Invariant cache hit.
[2023-03-12 10:57:51] [INFO ] Implicit Places using invariants and state equation in 2192 ms returned []
Implicit Place search using SMT with State Equation took 2690 ms to find 0 implicit places.
[2023-03-12 10:57:51] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-12 10:57:51] [INFO ] Invariant cache hit.
[2023-03-12 10:57:52] [INFO ] Dead Transitions using invariants and state equation in 685 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3472 ms. Remains : 759/759 places, 1889/1889 transitions.
Ending property specific reduction for ASLink-PT-10a-UpperBounds-11 in 13974 ms.
Starting property specific reduction for ASLink-PT-10a-UpperBounds-12
// Phase 1: matrix 1892 rows 762 cols
[2023-03-12 10:57:52] [INFO ] Computed 69 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 155 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-12 10:57:52] [INFO ] Invariant cache hit.
[2023-03-12 10:57:52] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2023-03-12 10:57:52] [INFO ] [Real]Absence check using 17 positive and 52 generalized place invariants in 43 ms returned sat
[2023-03-12 10:57:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:57:53] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2023-03-12 10:57:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:57:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-03-12 10:57:53] [INFO ] [Nat]Absence check using 17 positive and 52 generalized place invariants in 86 ms returned sat
[2023-03-12 10:57:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:57:54] [INFO ] [Nat]Absence check using state equation in 958 ms returned sat
[2023-03-12 10:57:54] [INFO ] Computed and/alt/rep : 439/1827/439 causal constraints (skipped 1407 transitions) in 116 ms.
[2023-03-12 10:57:56] [INFO ] Added : 47 causal constraints over 10 iterations in 1790 ms. Result :sat
Minimization took 226 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 1892/1892 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 762 transition count 1890
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 760 transition count 1890
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 760 transition count 1889
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 759 transition count 1889
Applied a total of 6 rules in 35 ms. Remains 759 /762 variables (removed 3) and now considering 1889/1892 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 759/762 places, 1889/1892 transitions.
// Phase 1: matrix 1889 rows 759 cols
[2023-03-12 10:57:57] [INFO ] Computed 69 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 16161 resets, run finished after 2594 ms. (steps per millisecond=385 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2222 resets, run finished after 980 ms. (steps per millisecond=1020 ) properties (out of 1) seen :0
[2023-03-12 10:58:00] [INFO ] Invariant cache hit.
[2023-03-12 10:58:00] [INFO ] [Real]Absence check using 15 positive place invariants in 29 ms returned sat
[2023-03-12 10:58:00] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 22 ms returned sat
[2023-03-12 10:58:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:58:01] [INFO ] [Real]Absence check using state equation in 897 ms returned sat
[2023-03-12 10:58:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:58:02] [INFO ] [Nat]Absence check using 15 positive place invariants in 19 ms returned sat
[2023-03-12 10:58:02] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 25 ms returned sat
[2023-03-12 10:58:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:58:03] [INFO ] [Nat]Absence check using state equation in 1056 ms returned sat
[2023-03-12 10:58:03] [INFO ] Computed and/alt/rep : 436/1824/436 causal constraints (skipped 1407 transitions) in 121 ms.
[2023-03-12 10:58:04] [INFO ] Added : 21 causal constraints over 5 iterations in 829 ms. Result :sat
Minimization took 294 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1889/1889 transitions.
Applied a total of 0 rules in 41 ms. Remains 759 /759 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 759/759 places, 1889/1889 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1889/1889 transitions.
Applied a total of 0 rules in 40 ms. Remains 759 /759 variables (removed 0) and now considering 1889/1889 (removed 0) transitions.
[2023-03-12 10:58:04] [INFO ] Invariant cache hit.
[2023-03-12 10:58:05] [INFO ] Implicit Places using invariants in 495 ms returned []
[2023-03-12 10:58:05] [INFO ] Invariant cache hit.
[2023-03-12 10:58:06] [INFO ] Implicit Places using invariants and state equation in 1552 ms returned []
Implicit Place search using SMT with State Equation took 2056 ms to find 0 implicit places.
[2023-03-12 10:58:06] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-12 10:58:06] [INFO ] Invariant cache hit.
[2023-03-12 10:58:07] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2999 ms. Remains : 759/759 places, 1889/1889 transitions.
Ending property specific reduction for ASLink-PT-10a-UpperBounds-12 in 15287 ms.
[2023-03-12 10:58:08] [INFO ] Flatten gal took : 224 ms
[2023-03-12 10:58:08] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-12 10:58:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 762 places, 1892 transitions and 7727 arcs took 8 ms.
Total runtime 581363 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/894/ub_0_ --maxsum=/tmp/894/ub_1_ --maxsum=/tmp/894/ub_2_
Could not compute solution for formula : ASLink-PT-10a-UpperBounds-04
Could not compute solution for formula : ASLink-PT-10a-UpperBounds-11
Could not compute solution for formula : ASLink-PT-10a-UpperBounds-12

BK_STOP 1678619157253

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

+ 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name ASLink-PT-10a-UpperBounds-04
ub formula formula --maxsum=/tmp/894/ub_0_
ub formula name ASLink-PT-10a-UpperBounds-11
ub formula formula --maxsum=/tmp/894/ub_1_
ub formula name ASLink-PT-10a-UpperBounds-12
ub formula formula --maxsum=/tmp/894/ub_2_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 762 places, 1892 transitions and 7727 arcs
pnml2lts-sym: Petri net ASLink_PT_10a analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 1892->1892 groups
pnml2lts-sym: Regrouping took 0.590 real 0.580 user 0.000 sys
pnml2lts-sym: state vector length is 762; there are 1892 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done

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-10a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ASLink-PT-10a, 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 r009-oct2-167813597500157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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