Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r003-smll-171620116900045.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ASLink-PT-03a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620116900045
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 820K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Apr 11 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 357K May 18 16:42 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-03a-UpperBounds-00
FORMULA_NAME ASLink-PT-03a-UpperBounds-01
FORMULA_NAME ASLink-PT-03a-UpperBounds-02
FORMULA_NAME ASLink-PT-03a-UpperBounds-03
FORMULA_NAME ASLink-PT-03a-UpperBounds-04
FORMULA_NAME ASLink-PT-03a-UpperBounds-05
FORMULA_NAME ASLink-PT-03a-UpperBounds-06
FORMULA_NAME ASLink-PT-03a-UpperBounds-07
FORMULA_NAME ASLink-PT-03a-UpperBounds-08
FORMULA_NAME ASLink-PT-03a-UpperBounds-09
FORMULA_NAME ASLink-PT-03a-UpperBounds-10
FORMULA_NAME ASLink-PT-03a-UpperBounds-11
FORMULA_NAME ASLink-PT-03a-UpperBounds-12
FORMULA_NAME ASLink-PT-03a-UpperBounds-13
FORMULA_NAME ASLink-PT-03a-UpperBounds-14
FORMULA_NAME ASLink-PT-03a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716242182743

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-20 21:56:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-20 21:56:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 21:56:25] [INFO ] Load time of PNML (sax parser for PT used): 357 ms
[2024-05-20 21:56:25] [INFO ] Transformed 821 places.
[2024-05-20 21:56:26] [INFO ] Transformed 1281 transitions.
[2024-05-20 21:56:26] [INFO ] Found NUPN structural information;
[2024-05-20 21:56:26] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 641 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 156 ms.
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 1268 rows 821 cols
[2024-05-20 21:56:26] [INFO ] Computed 156 invariants in 181 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (89 resets) in 153 ms. (64 steps per ms)
FORMULA ASLink-PT-03a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (71 resets) in 163 ms. (243 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2024-05-20 21:56:26] [INFO ] Invariant cache hit.
[2024-05-20 21:56:27] [INFO ] [Real]Absence check using 36 positive place invariants in 108 ms returned sat
[2024-05-20 21:56:27] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 74 ms returned sat
[2024-05-20 21:56:28] [INFO ] [Real]Absence check using state equation in 936 ms returned sat
[2024-05-20 21:56:28] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 21:56:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 52 ms returned sat
[2024-05-20 21:56:29] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 71 ms returned sat
[2024-05-20 21:56:30] [INFO ] [Nat]Absence check using state equation in 950 ms returned sat
[2024-05-20 21:56:30] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 268 ms.
[2024-05-20 21:56:34] [INFO ] Added : 105 causal constraints over 21 iterations in 3362 ms. Result :unknown
[2024-05-20 21:56:34] [INFO ] [Real]Absence check using 36 positive place invariants in 45 ms returned sat
[2024-05-20 21:56:34] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 63 ms returned sat
[2024-05-20 21:56:35] [INFO ] [Real]Absence check using state equation in 882 ms returned sat
[2024-05-20 21:56:35] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 159 ms.
[2024-05-20 21:56:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 21:56:36] [INFO ] [Nat]Absence check using 36 positive place invariants in 43 ms returned sat
[2024-05-20 21:56:36] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 71 ms returned sat
[2024-05-20 21:56:37] [INFO ] [Nat]Absence check using state equation in 806 ms returned sat
[2024-05-20 21:56:37] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 157 ms.
Maximisation of solution failed !
Minimization took 2 ms.
[2024-05-20 21:56:41] [INFO ] [Real]Absence check using 36 positive place invariants in 26 ms returned sat
[2024-05-20 21:56:41] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 39 ms returned sat
[2024-05-20 21:56:42] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2024-05-20 21:56:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 21:56:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 40 ms returned sat
[2024-05-20 21:56:42] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 75 ms returned sat
[2024-05-20 21:56:43] [INFO ] [Nat]Absence check using state equation in 1088 ms returned sat
[2024-05-20 21:56:44] [INFO ] Deduced a trap composed of 24 places in 724 ms of which 94 ms to minimize.
[2024-05-20 21:56:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 968 ms
[2024-05-20 21:56:45] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 202 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-20 21:56:47] [INFO ] [Real]Absence check using 36 positive place invariants in 42 ms returned sat
[2024-05-20 21:56:47] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 80 ms returned sat
[2024-05-20 21:56:48] [INFO ] [Real]Absence check using state equation in 922 ms returned sat
[2024-05-20 21:56:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 21:56:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 43 ms returned sat
[2024-05-20 21:56:49] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 71 ms returned sat
[2024-05-20 21:56:50] [INFO ] [Nat]Absence check using state equation in 910 ms returned sat
[2024-05-20 21:56:50] [INFO ] Deduced a trap composed of 24 places in 520 ms of which 9 ms to minimize.
[2024-05-20 21:56:51] [INFO ] Deduced a trap composed of 24 places in 434 ms of which 6 ms to minimize.
[2024-05-20 21:56:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1367 ms
[2024-05-20 21:56:51] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 169 ms.
[2024-05-20 21:56:52] [INFO ] Added : 5 causal constraints over 1 iterations in 1252 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 12 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 803 transition count 1199
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 156 place count 734 transition count 1199
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 69 Pre rules applied. Total rules applied 156 place count 734 transition count 1130
Deduced a syphon composed of 69 places in 2 ms
Ensure Unique test removed 27 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 165 rules applied. Total rules applied 321 place count 638 transition count 1130
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 322 place count 638 transition count 1129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 323 place count 637 transition count 1129
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 329 place count 631 transition count 1100
Ensure Unique test removed 1 places
Iterating global reduction 4 with 7 rules applied. Total rules applied 336 place count 630 transition count 1100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 342 place count 629 transition count 1095
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 345 place count 626 transition count 1095
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 346 place count 625 transition count 1087
Iterating global reduction 6 with 1 rules applied. Total rules applied 347 place count 625 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 348 place count 624 transition count 1079
Iterating global reduction 6 with 1 rules applied. Total rules applied 349 place count 624 transition count 1079
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 350 place count 623 transition count 1071
Iterating global reduction 6 with 1 rules applied. Total rules applied 351 place count 623 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 352 place count 622 transition count 1063
Iterating global reduction 6 with 1 rules applied. Total rules applied 353 place count 622 transition count 1063
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 354 place count 621 transition count 1055
Iterating global reduction 6 with 1 rules applied. Total rules applied 355 place count 621 transition count 1055
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 356 place count 620 transition count 1047
Iterating global reduction 6 with 1 rules applied. Total rules applied 357 place count 620 transition count 1047
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 358 place count 619 transition count 1039
Iterating global reduction 6 with 1 rules applied. Total rules applied 359 place count 619 transition count 1039
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 360 place count 618 transition count 1031
Iterating global reduction 6 with 1 rules applied. Total rules applied 361 place count 618 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 362 place count 617 transition count 1023
Iterating global reduction 6 with 1 rules applied. Total rules applied 363 place count 617 transition count 1023
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 364 place count 616 transition count 1015
Iterating global reduction 6 with 1 rules applied. Total rules applied 365 place count 616 transition count 1015
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 366 place count 615 transition count 1007
Iterating global reduction 6 with 1 rules applied. Total rules applied 367 place count 615 transition count 1007
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 368 place count 614 transition count 999
Iterating global reduction 6 with 1 rules applied. Total rules applied 369 place count 614 transition count 999
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 370 place count 613 transition count 991
Iterating global reduction 6 with 1 rules applied. Total rules applied 371 place count 613 transition count 991
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 372 place count 612 transition count 983
Iterating global reduction 6 with 1 rules applied. Total rules applied 373 place count 612 transition count 983
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 374 place count 611 transition count 975
Iterating global reduction 6 with 1 rules applied. Total rules applied 375 place count 611 transition count 975
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 376 place count 610 transition count 967
Iterating global reduction 6 with 1 rules applied. Total rules applied 377 place count 610 transition count 967
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 419 place count 589 transition count 946
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 421 place count 589 transition count 944
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 423 place count 587 transition count 944
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 427 place count 587 transition count 944
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 428 place count 586 transition count 943
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 433 place count 581 transition count 943
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 11 Pre rules applied. Total rules applied 433 place count 581 transition count 932
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 8 with 23 rules applied. Total rules applied 456 place count 569 transition count 932
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 8 with 3 rules applied. Total rules applied 459 place count 566 transition count 932
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 459 place count 566 transition count 931
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 461 place count 565 transition count 931
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 467 place count 562 transition count 928
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 469 place count 560 transition count 926
Iterating global reduction 9 with 2 rules applied. Total rules applied 471 place count 560 transition count 926
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 473 place count 560 transition count 924
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 475 place count 558 transition count 924
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 477 place count 558 transition count 924
Applied a total of 477 rules in 1272 ms. Remains 558 /821 variables (removed 263) and now considering 924/1268 (removed 344) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1289 ms. Remains : 558/821 places, 924/1268 transitions.
// Phase 1: matrix 924 rows 558 cols
[2024-05-20 21:56:55] [INFO ] Computed 100 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 1, 0, 0] Max Struct:[1, 1, 1, 1]
FORMULA ASLink-PT-03a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (14477 resets) in 2535 ms. (394 steps per ms)
FORMULA ASLink-PT-03a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000002 steps (8017 resets) in 2262 ms. (883 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-20 21:57:00] [INFO ] Invariant cache hit.
[2024-05-20 21:57:00] [INFO ] [Real]Absence check using 26 positive place invariants in 23 ms returned sat
[2024-05-20 21:57:00] [INFO ] [Real]Absence check using 26 positive and 74 generalized place invariants in 44 ms returned sat
[2024-05-20 21:57:00] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2024-05-20 21:57:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 21:57:01] [INFO ] [Nat]Absence check using 26 positive place invariants in 24 ms returned sat
[2024-05-20 21:57:01] [INFO ] [Nat]Absence check using 26 positive and 74 generalized place invariants in 43 ms returned sat
[2024-05-20 21:57:01] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2024-05-20 21:57:02] [INFO ] Computed and/alt/rep : 355/1381/355 causal constraints (skipped 547 transitions) in 106 ms.
[2024-05-20 21:57:03] [INFO ] Added : 74 causal constraints over 15 iterations in 1934 ms. Result :sat
Minimization took 896 ms.
[2024-05-20 21:57:04] [INFO ] [Real]Absence check using 26 positive place invariants in 15 ms returned sat
[2024-05-20 21:57:04] [INFO ] [Real]Absence check using 26 positive and 74 generalized place invariants in 31 ms returned sat
[2024-05-20 21:57:05] [INFO ] [Real]Absence check using state equation in 425 ms returned sat
[2024-05-20 21:57:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 21:57:05] [INFO ] [Nat]Absence check using 26 positive place invariants in 16 ms returned sat
[2024-05-20 21:57:05] [INFO ] [Nat]Absence check using 26 positive and 74 generalized place invariants in 32 ms returned sat
[2024-05-20 21:57:06] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2024-05-20 21:57:06] [INFO ] Computed and/alt/rep : 355/1381/355 causal constraints (skipped 547 transitions) in 65 ms.
[2024-05-20 21:57:08] [INFO ] Added : 122 causal constraints over 25 iterations in 2889 ms. Result :sat
Minimization took 1331 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 924/924 transitions.
Applied a total of 0 rules in 40 ms. Remains 558 /558 variables (removed 0) and now considering 924/924 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 558/558 places, 924/924 transitions.
[2024-05-20 21:57:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (14403 resets) in 2363 ms. (423 steps per ms)
BEST_FIRST walk for 2000002 steps (8027 resets) in 2360 ms. (847 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-05-20 21:57:15] [INFO ] Invariant cache hit.
[2024-05-20 21:57:15] [INFO ] [Real]Absence check using 26 positive place invariants in 14 ms returned sat
[2024-05-20 21:57:16] [INFO ] [Real]Absence check using 26 positive and 74 generalized place invariants in 29 ms returned sat
[2024-05-20 21:57:16] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2024-05-20 21:57:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 21:57:16] [INFO ] [Nat]Absence check using 26 positive place invariants in 22 ms returned sat
[2024-05-20 21:57:16] [INFO ] [Nat]Absence check using 26 positive and 74 generalized place invariants in 45 ms returned sat
[2024-05-20 21:57:17] [INFO ] [Nat]Absence check using state equation in 632 ms returned sat
[2024-05-20 21:57:17] [INFO ] Computed and/alt/rep : 355/1381/355 causal constraints (skipped 547 transitions) in 104 ms.
[2024-05-20 21:57:19] [INFO ] Added : 74 causal constraints over 15 iterations in 1843 ms. Result :sat
Minimization took 1062 ms.
[2024-05-20 21:57:20] [INFO ] [Real]Absence check using 26 positive place invariants in 20 ms returned sat
[2024-05-20 21:57:20] [INFO ] [Real]Absence check using 26 positive and 74 generalized place invariants in 39 ms returned sat
[2024-05-20 21:57:21] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2024-05-20 21:57:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 21:57:21] [INFO ] [Nat]Absence check using 26 positive place invariants in 21 ms returned sat
[2024-05-20 21:57:21] [INFO ] [Nat]Absence check using 26 positive and 74 generalized place invariants in 49 ms returned sat
[2024-05-20 21:57:21] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2024-05-20 21:57:22] [INFO ] Computed and/alt/rep : 355/1381/355 causal constraints (skipped 547 transitions) in 114 ms.
[2024-05-20 21:57:25] [INFO ] Added : 122 causal constraints over 25 iterations in 3206 ms. Result :sat
Minimization took 1416 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
FORMULA ASLink-PT-03a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 558 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p87) removed 8 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 916/916 transitions.
Reduce places removed 1 places and 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 557 transition count 907
Reduce places removed 3 places and 8 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 554 transition count 899
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 553 transition count 891
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 7 place count 552 transition count 883
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 8 place count 551 transition count 875
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 9 place count 550 transition count 867
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 10 place count 549 transition count 859
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 11 place count 548 transition count 851
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 12 place count 547 transition count 843
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 13 place count 546 transition count 835
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 14 place count 545 transition count 827
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 15 place count 544 transition count 819
Reduce places removed 1 places and 8 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 16 place count 543 transition count 811
Reduce places removed 1 places and 2 transitions.
Graph (complete) has 2149 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 2 rules applied. Total rules applied 18 place count 540 transition count 809
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 2141 edges and 539 vertex of which 538 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 2 rules applied. Total rules applied 20 place count 538 transition count 808
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 20 place count 538 transition count 807
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 22 place count 537 transition count 807
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 15 with 1 rules applied. Total rules applied 23 place count 536 transition count 807
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 25 place count 535 transition count 806
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 26 place count 534 transition count 805
Iterating global reduction 16 with 1 rules applied. Total rules applied 27 place count 534 transition count 805
Free-agglomeration rule applied 2 times.
Iterating global reduction 16 with 2 rules applied. Total rules applied 29 place count 534 transition count 803
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 32 place count 532 transition count 802
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 17 with 1 rules applied. Total rules applied 33 place count 532 transition count 801
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 34 place count 531 transition count 801
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 35 place count 531 transition count 801
Applied a total of 35 rules in 300 ms. Remains 531 /558 variables (removed 27) and now considering 801/916 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 531/558 places, 801/916 transitions.
// Phase 1: matrix 801 rows 531 cols
[2024-05-20 21:57:27] [INFO ] Computed 96 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (14010 resets) in 2301 ms. (434 steps per ms)
BEST_FIRST walk for 1000001 steps (3864 resets) in 1002 ms. (997 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-20 21:57:31] [INFO ] Invariant cache hit.
[2024-05-20 21:57:31] [INFO ] [Real]Absence check using 26 positive place invariants in 21 ms returned sat
[2024-05-20 21:57:31] [INFO ] [Real]Absence check using 26 positive and 70 generalized place invariants in 37 ms returned sat
[2024-05-20 21:57:31] [INFO ] [Real]Absence check using state equation in 464 ms returned sat
[2024-05-20 21:57:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 21:57:31] [INFO ] [Nat]Absence check using 26 positive place invariants in 20 ms returned sat
[2024-05-20 21:57:31] [INFO ] [Nat]Absence check using 26 positive and 70 generalized place invariants in 40 ms returned sat
[2024-05-20 21:57:32] [INFO ] [Nat]Absence check using state equation in 512 ms returned sat
[2024-05-20 21:57:32] [INFO ] Computed and/alt/rep : 353/1353/353 causal constraints (skipped 427 transitions) in 96 ms.
[2024-05-20 21:57:35] [INFO ] Added : 195 causal constraints over 39 iterations in 3485 ms. Result :sat
Minimization took 891 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 801/801 transitions.
Applied a total of 0 rules in 41 ms. Remains 531 /531 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 531/531 places, 801/801 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 801/801 transitions.
Applied a total of 0 rules in 40 ms. Remains 531 /531 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2024-05-20 21:57:37] [INFO ] Invariant cache hit.
[2024-05-20 21:57:38] [INFO ] Implicit Places using invariants in 1032 ms returned [0, 18, 19, 30, 48, 66, 68, 119, 128, 129, 130, 148, 166, 235, 239, 240, 251, 252, 253, 271, 289, 358, 362, 363, 366, 377, 378, 379, 397, 399, 402, 420, 421, 422, 423, 435, 441, 447, 453, 459, 465, 471, 477, 483, 489, 495]
[2024-05-20 21:57:38] [INFO ] Actually due to overlaps returned [397, 379, 66, 68, 48, 130, 148, 253, 271, 402, 30, 129, 252, 378, 421, 128, 251, 377, 399, 420, 0, 239, 240, 362, 363, 18, 19, 166, 289, 423, 465, 483, 495, 366, 422, 435, 441, 447, 453, 459, 471, 477, 489]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 1041 ms to find 43 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 488/531 places, 801/801 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 486 transition count 725
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 154 place count 410 transition count 725
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 154 place count 410 transition count 706
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 39 rules applied. Total rules applied 193 place count 390 transition count 706
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 205 place count 386 transition count 698
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 213 place count 378 transition count 698
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 228 place count 363 transition count 683
Iterating global reduction 4 with 15 rules applied. Total rules applied 243 place count 363 transition count 683
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 246 place count 363 transition count 680
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 246 place count 363 transition count 679
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 248 place count 362 transition count 679
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 251 place count 359 transition count 676
Iterating global reduction 5 with 3 rules applied. Total rules applied 254 place count 359 transition count 676
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 255 place count 358 transition count 675
Iterating global reduction 5 with 1 rules applied. Total rules applied 256 place count 358 transition count 675
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 257 place count 357 transition count 674
Iterating global reduction 5 with 1 rules applied. Total rules applied 258 place count 357 transition count 674
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 60 rules applied. Total rules applied 318 place count 327 transition count 644
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 320 place count 327 transition count 642
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 322 place count 325 transition count 640
Iterating global reduction 6 with 2 rules applied. Total rules applied 324 place count 325 transition count 640
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 326 place count 325 transition count 638
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 327 place count 325 transition count 637
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 7 with 15 rules applied. Total rules applied 342 place count 325 transition count 622
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 7 with 16 rules applied. Total rules applied 358 place count 309 transition count 622
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 368 place count 309 transition count 622
Applied a total of 368 rules in 253 ms. Remains 309 /488 variables (removed 179) and now considering 622/801 (removed 179) transitions.
// Phase 1: matrix 622 rows 309 cols
[2024-05-20 21:57:38] [INFO ] Computed 45 invariants in 10 ms
[2024-05-20 21:57:39] [INFO ] Implicit Places using invariants in 551 ms returned [64, 70, 73, 75, 76, 79, 80, 132, 149, 155, 158, 160, 165, 166, 218, 235, 241, 244, 246]
[2024-05-20 21:57:39] [INFO ] Actually due to overlaps returned [79, 165, 80, 166, 64, 70, 75, 76, 149, 155, 160, 235, 241, 246, 132, 218]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 556 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 293/531 places, 622/801 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 281 transition count 610
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 281 transition count 610
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 278 transition count 607
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 278 transition count 607
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 273 transition count 602
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 49 place count 273 transition count 593
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 58 place count 264 transition count 593
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 264 transition count 591
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 62 place count 262 transition count 591
Applied a total of 62 rules in 92 ms. Remains 262 /293 variables (removed 31) and now considering 591/622 (removed 31) transitions.
// Phase 1: matrix 591 rows 262 cols
[2024-05-20 21:57:39] [INFO ] Computed 29 invariants in 9 ms
[2024-05-20 21:57:39] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-20 21:57:39] [INFO ] Invariant cache hit.
[2024-05-20 21:57:40] [INFO ] Implicit Places using invariants and state equation in 806 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1167 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 261/531 places, 591/801 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 261 transition count 588
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 258 transition count 588
Applied a total of 6 rules in 24 ms. Remains 258 /261 variables (removed 3) and now considering 588/591 (removed 3) transitions.
// Phase 1: matrix 588 rows 258 cols
[2024-05-20 21:57:40] [INFO ] Computed 28 invariants in 9 ms
[2024-05-20 21:57:40] [INFO ] Implicit Places using invariants in 367 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 370 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 257/531 places, 588/801 transitions.
Applied a total of 0 rules in 13 ms. Remains 257 /257 variables (removed 0) and now considering 588/588 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 3562 ms. Remains : 257/531 places, 588/801 transitions.
// Phase 1: matrix 588 rows 257 cols
[2024-05-20 21:57:40] [INFO ] Computed 27 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA ASLink-PT-03a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (21081 resets) in 1658 ms. (602 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 77165 ms.
ITS solved all properties within timeout

BK_STOP 1716242262551

--------------------
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.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-03a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is ASLink-PT-03a, 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 r003-smll-171620116900045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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