Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r006-tajo-165245688800060.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-04a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r006-tajo-165245688800060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 5.6K Apr 30 07:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 30 07:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 07:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 30 07:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 9 06:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 9 06:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 06:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 06:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 06:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 06:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 436K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-04a-LTLFireability-00
FORMULA_NAME ASLink-PT-04a-LTLFireability-01
FORMULA_NAME ASLink-PT-04a-LTLFireability-02
FORMULA_NAME ASLink-PT-04a-LTLFireability-03
FORMULA_NAME ASLink-PT-04a-LTLFireability-04
FORMULA_NAME ASLink-PT-04a-LTLFireability-05
FORMULA_NAME ASLink-PT-04a-LTLFireability-06
FORMULA_NAME ASLink-PT-04a-LTLFireability-07
FORMULA_NAME ASLink-PT-04a-LTLFireability-08
FORMULA_NAME ASLink-PT-04a-LTLFireability-09
FORMULA_NAME ASLink-PT-04a-LTLFireability-10
FORMULA_NAME ASLink-PT-04a-LTLFireability-11
FORMULA_NAME ASLink-PT-04a-LTLFireability-12
FORMULA_NAME ASLink-PT-04a-LTLFireability-13
FORMULA_NAME ASLink-PT-04a-LTLFireability-14
FORMULA_NAME ASLink-PT-04a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652645356013

Running Version 202205111006
[2022-05-15 20:09:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 20:09:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 20:09:21] [INFO ] Load time of PNML (sax parser for PT used): 483 ms
[2022-05-15 20:09:21] [INFO ] Transformed 1016 places.
[2022-05-15 20:09:21] [INFO ] Transformed 1554 transitions.
[2022-05-15 20:09:21] [INFO ] Found NUPN structural information;
[2022-05-15 20:09:21] [INFO ] Parsed PT model containing 1016 places and 1554 transitions in 1111 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 55 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
FORMULA ASLink-PT-04a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 1016 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 16 places
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 992 transition count 1538
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 33 place count 983 transition count 1501
Ensure Unique test removed 1 places
Iterating global reduction 1 with 10 rules applied. Total rules applied 43 place count 982 transition count 1501
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 982 transition count 1499
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 981 transition count 1491
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 981 transition count 1491
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 980 transition count 1483
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 980 transition count 1483
Applied a total of 49 rules in 915 ms. Remains 980 /1016 variables (removed 36) and now considering 1483/1538 (removed 55) transitions.
// Phase 1: matrix 1483 rows 980 cols
[2022-05-15 20:09:23] [INFO ] Computed 169 place invariants in 180 ms
[2022-05-15 20:09:33] [INFO ] Implicit Places using invariants in 10070 ms returned [1, 19, 23, 33, 69, 198, 219, 220, 221, 239, 257, 386, 408, 409, 427, 445, 574, 596, 597, 615, 767, 785, 820, 823, 841, 843]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 10578 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 954/1016 places, 1483/1538 transitions.
Applied a total of 0 rules in 85 ms. Remains 954 /954 variables (removed 0) and now considering 1483/1483 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 954/1016 places, 1483/1538 transitions.
Support contains 57 out of 954 places after structural reductions.
[2022-05-15 20:09:34] [INFO ] Flatten gal took : 437 ms
[2022-05-15 20:09:34] [INFO ] Flatten gal took : 244 ms
[2022-05-15 20:09:35] [INFO ] Input system was already deterministic with 1483 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 780 ms. (steps per millisecond=12 ) properties (out of 35) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=11 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
// Phase 1: matrix 1483 rows 954 cols
[2022-05-15 20:09:37] [INFO ] Computed 143 place invariants in 126 ms
[2022-05-15 20:09:39] [INFO ] After 2532ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:26
[2022-05-15 20:09:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 16 ms returned sat
[2022-05-15 20:09:41] [INFO ] [Nat]Absence check using 33 positive and 110 generalized place invariants in 42 ms returned sat
[2022-05-15 20:09:47] [INFO ] After 5474ms SMT Verify possible using state equation in natural domain returned unsat :19 sat :7
[2022-05-15 20:09:49] [INFO ] Deduced a trap composed of 74 places in 288 ms of which 35 ms to minimize.
[2022-05-15 20:09:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 483 ms
[2022-05-15 20:09:50] [INFO ] After 8286ms SMT Verify possible using trap constraints in natural domain returned unsat :19 sat :7
Attempting to minimize the solution found.
Minimization took 1535 ms.
[2022-05-15 20:09:51] [INFO ] After 11948ms SMT Verify possible using all constraints in natural domain returned unsat :19 sat :7
Fused 26 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 747 ms.
Support contains 16 out of 954 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 954/954 places, 1483/1483 transitions.
Drop transitions removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 954 transition count 1341
Reduce places removed 142 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 149 rules applied. Total rules applied 291 place count 812 transition count 1334
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 298 place count 805 transition count 1334
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 298 place count 805 transition count 1243
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 36 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 516 place count 678 transition count 1243
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 517 place count 678 transition count 1242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 518 place count 677 transition count 1242
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 518 place count 677 transition count 1238
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 526 place count 673 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 527 place count 672 transition count 1230
Iterating global reduction 5 with 1 rules applied. Total rules applied 528 place count 672 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 529 place count 671 transition count 1222
Iterating global reduction 5 with 1 rules applied. Total rules applied 530 place count 671 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 531 place count 670 transition count 1214
Iterating global reduction 5 with 1 rules applied. Total rules applied 532 place count 670 transition count 1214
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 533 place count 669 transition count 1206
Iterating global reduction 5 with 1 rules applied. Total rules applied 534 place count 669 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 535 place count 668 transition count 1198
Iterating global reduction 5 with 1 rules applied. Total rules applied 536 place count 668 transition count 1198
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 537 place count 667 transition count 1190
Iterating global reduction 5 with 1 rules applied. Total rules applied 538 place count 667 transition count 1190
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 539 place count 666 transition count 1182
Iterating global reduction 5 with 1 rules applied. Total rules applied 540 place count 666 transition count 1182
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 541 place count 665 transition count 1174
Iterating global reduction 5 with 1 rules applied. Total rules applied 542 place count 665 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 543 place count 664 transition count 1166
Iterating global reduction 5 with 1 rules applied. Total rules applied 544 place count 664 transition count 1166
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 545 place count 663 transition count 1158
Iterating global reduction 5 with 1 rules applied. Total rules applied 546 place count 663 transition count 1158
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 547 place count 662 transition count 1150
Iterating global reduction 5 with 1 rules applied. Total rules applied 548 place count 662 transition count 1150
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 549 place count 661 transition count 1142
Iterating global reduction 5 with 1 rules applied. Total rules applied 550 place count 661 transition count 1142
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 551 place count 660 transition count 1134
Iterating global reduction 5 with 1 rules applied. Total rules applied 552 place count 660 transition count 1134
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 553 place count 659 transition count 1126
Iterating global reduction 5 with 1 rules applied. Total rules applied 554 place count 659 transition count 1126
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 644 place count 614 transition count 1081
Free-agglomeration rule (complex) applied 34 times.
Iterating global reduction 5 with 34 rules applied. Total rules applied 678 place count 614 transition count 1047
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 712 place count 580 transition count 1047
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 720 place count 580 transition count 1047
Applied a total of 720 rules in 1287 ms. Remains 580 /954 variables (removed 374) and now considering 1047/1483 (removed 436) transitions.
Finished structural reductions, in 1 iterations. Remains : 580/954 places, 1047/1483 transitions.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 1047 rows 580 cols
[2022-05-15 20:09:54] [INFO ] Computed 107 place invariants in 11 ms
[2022-05-15 20:09:54] [INFO ] After 476ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2022-05-15 20:09:55] [INFO ] [Nat]Absence check using 32 positive place invariants in 187 ms returned sat
[2022-05-15 20:09:55] [INFO ] [Nat]Absence check using 32 positive and 75 generalized place invariants in 422 ms returned sat
[2022-05-15 20:10:00] [INFO ] After 4592ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2022-05-15 20:10:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 20:10:01] [INFO ] After 567ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2022-05-15 20:10:01] [INFO ] After 1278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 569 ms.
[2022-05-15 20:10:02] [INFO ] After 7812ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 92 ms.
Support contains 12 out of 580 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 580/580 places, 1047/1047 transitions.
Applied a total of 0 rules in 78 ms. Remains 580 /580 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 580/580 places, 1047/1047 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1047 rows 580 cols
[2022-05-15 20:10:03] [INFO ] Computed 107 place invariants in 7 ms
[2022-05-15 20:10:03] [INFO ] [Real]Absence check using 32 positive place invariants in 175 ms returned sat
[2022-05-15 20:10:04] [INFO ] [Real]Absence check using 32 positive and 75 generalized place invariants in 371 ms returned sat
[2022-05-15 20:10:05] [INFO ] After 2688ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 20:10:06] [INFO ] [Nat]Absence check using 32 positive place invariants in 10 ms returned sat
[2022-05-15 20:10:06] [INFO ] [Nat]Absence check using 32 positive and 75 generalized place invariants in 23 ms returned sat
[2022-05-15 20:10:06] [INFO ] After 816ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 20:10:06] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 20:10:07] [INFO ] After 538ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-15 20:10:07] [INFO ] After 1064ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 505 ms.
[2022-05-15 20:10:08] [INFO ] After 2653ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 46 ms.
Support contains 10 out of 580 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 580/580 places, 1047/1047 transitions.
Applied a total of 0 rules in 47 ms. Remains 580 /580 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 580/580 places, 1047/1047 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 133696 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133696 steps, saw 53295 distinct states, run finished after 3003 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 1047 rows 580 cols
[2022-05-15 20:10:12] [INFO ] Computed 107 place invariants in 15 ms
[2022-05-15 20:10:12] [INFO ] [Real]Absence check using 32 positive place invariants in 23 ms returned sat
[2022-05-15 20:10:12] [INFO ] [Real]Absence check using 32 positive and 75 generalized place invariants in 443 ms returned sat
[2022-05-15 20:10:15] [INFO ] After 3266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-15 20:10:15] [INFO ] [Nat]Absence check using 32 positive place invariants in 120 ms returned sat
[2022-05-15 20:10:15] [INFO ] [Nat]Absence check using 32 positive and 75 generalized place invariants in 44 ms returned sat
[2022-05-15 20:10:16] [INFO ] After 802ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-15 20:10:16] [INFO ] State equation strengthened by 20 read => feed constraints.
[2022-05-15 20:10:17] [INFO ] After 425ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2022-05-15 20:10:17] [INFO ] After 900ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 303 ms.
[2022-05-15 20:10:17] [INFO ] After 2430ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 82 ms.
Support contains 10 out of 580 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 580/580 places, 1047/1047 transitions.
Applied a total of 0 rules in 59 ms. Remains 580 /580 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 580/580 places, 1047/1047 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 580/580 places, 1047/1047 transitions.
Applied a total of 0 rules in 14 ms. Remains 580 /580 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
// Phase 1: matrix 1047 rows 580 cols
[2022-05-15 20:10:18] [INFO ] Computed 107 place invariants in 10 ms
[2022-05-15 20:10:23] [INFO ] Implicit Places using invariants in 5617 ms returned [42, 99, 107, 113, 120, 127, 128, 129, 130, 193, 201, 207, 210, 212, 219, 226, 227, 228, 233, 296, 304, 310, 313, 315, 322, 335, 340, 375, 403, 411, 418, 423, 433, 446, 447, 448, 449, 467, 488, 489, 499, 504, 509, 514, 519, 524, 529, 534, 539, 544, 549]
Discarding 51 places :
Implicit Place search using SMT only with invariants took 5645 ms to find 51 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 529/580 places, 1047/1047 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 529 transition count 1036
Reduce places removed 11 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 14 rules applied. Total rules applied 25 place count 518 transition count 1033
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 28 place count 515 transition count 1033
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 28 place count 515 transition count 1019
Deduced a syphon composed of 14 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 57 place count 500 transition count 1019
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 19 rules applied. Total rules applied 76 place count 491 transition count 1009
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 86 place count 481 transition count 1009
Discarding 36 places :
Symmetric choice reduction at 5 with 36 rule applications. Total rules 122 place count 445 transition count 973
Iterating global reduction 5 with 36 rules applied. Total rules applied 158 place count 445 transition count 973
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 163 place count 445 transition count 968
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 163 place count 445 transition count 967
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 165 place count 444 transition count 967
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 173 place count 436 transition count 959
Iterating global reduction 6 with 8 rules applied. Total rules applied 181 place count 436 transition count 959
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 183 place count 434 transition count 957
Iterating global reduction 6 with 2 rules applied. Total rules applied 185 place count 434 transition count 957
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 186 place count 433 transition count 956
Iterating global reduction 6 with 1 rules applied. Total rules applied 187 place count 433 transition count 956
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 235 place count 409 transition count 932
Free-agglomeration rule applied 16 times.
Iterating global reduction 6 with 16 rules applied. Total rules applied 251 place count 409 transition count 916
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 269 place count 393 transition count 914
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 272 place count 393 transition count 911
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 276 place count 389 transition count 911
Applied a total of 276 rules in 330 ms. Remains 389 /529 variables (removed 140) and now considering 911/1047 (removed 136) transitions.
// Phase 1: matrix 911 rows 389 cols
[2022-05-15 20:10:24] [INFO ] Computed 45 place invariants in 5 ms
[2022-05-15 20:10:26] [INFO ] Implicit Places using invariants in 2631 ms returned [76, 94, 251, 252, 308, 326]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 2643 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 383/580 places, 911/1047 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 382 transition count 910
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 382 transition count 910
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 380 transition count 908
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 380 transition count 906
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 378 transition count 906
Applied a total of 10 rules in 195 ms. Remains 378 /383 variables (removed 5) and now considering 906/911 (removed 5) transitions.
// Phase 1: matrix 906 rows 378 cols
[2022-05-15 20:10:26] [INFO ] Computed 39 place invariants in 5 ms
[2022-05-15 20:10:36] [INFO ] Implicit Places using invariants in 9634 ms returned []
// Phase 1: matrix 906 rows 378 cols
[2022-05-15 20:10:36] [INFO ] Computed 39 place invariants in 19 ms
[2022-05-15 20:10:37] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 20:10:37] [INFO ] Implicit Places using invariants and state equation in 1325 ms returned []
Implicit Place search using SMT with State Equation took 10981 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 378/580 places, 906/1047 transitions.
Finished structural reductions, in 3 iterations. Remains : 378/580 places, 906/1047 transitions.
Incomplete random walk after 10000 steps, including 195 resets, run finished after 330 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 94916 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{1=1}
Probabilistic random walk after 94916 steps, saw 61564 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :1
Running SMT prover for 3 properties.
// Phase 1: matrix 906 rows 378 cols
[2022-05-15 20:10:41] [INFO ] Computed 39 place invariants in 5 ms
[2022-05-15 20:10:41] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-15 20:10:41] [INFO ] [Real]Absence check using 12 positive and 27 generalized place invariants in 28 ms returned sat
[2022-05-15 20:10:41] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-15 20:10:41] [INFO ] [Nat]Absence check using 12 positive place invariants in 12 ms returned sat
[2022-05-15 20:10:42] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 12 ms returned sat
[2022-05-15 20:10:42] [INFO ] After 553ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-05-15 20:10:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 20:10:42] [INFO ] After 138ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-05-15 20:10:43] [INFO ] After 625ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 256 ms.
[2022-05-15 20:10:43] [INFO ] After 1680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 44 ms.
Support contains 8 out of 378 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 378/378 places, 906/906 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 378 transition count 904
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 376 transition count 904
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 2 with 2 rules applied. Total rules applied 6 place count 375 transition count 903
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 375 transition count 902
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 375 transition count 901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 374 transition count 901
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 374 transition count 900
Applied a total of 10 rules in 155 ms. Remains 374 /378 variables (removed 4) and now considering 900/906 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 374/378 places, 900/906 transitions.
Incomplete random walk after 10000 steps, including 178 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 146951 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{0=1}
Probabilistic random walk after 146951 steps, saw 73352 distinct states, run finished after 3002 ms. (steps per millisecond=48 ) properties seen :1
Running SMT prover for 2 properties.
// Phase 1: matrix 900 rows 374 cols
[2022-05-15 20:10:47] [INFO ] Computed 39 place invariants in 19 ms
[2022-05-15 20:10:47] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 20:10:47] [INFO ] [Nat]Absence check using 14 positive place invariants in 161 ms returned sat
[2022-05-15 20:10:47] [INFO ] [Nat]Absence check using 14 positive and 25 generalized place invariants in 157 ms returned sat
[2022-05-15 20:10:49] [INFO ] After 1715ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 20:10:49] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 20:10:49] [INFO ] After 163ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 20:10:49] [INFO ] After 329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 103 ms.
[2022-05-15 20:10:50] [INFO ] After 2769ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 374 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 374/374 places, 900/900 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 374 transition count 898
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 372 transition count 898
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 371 transition count 897
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 371 transition count 896
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 371 transition count 895
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 370 transition count 895
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 370 transition count 894
Applied a total of 10 rules in 205 ms. Remains 370 /374 variables (removed 4) and now considering 894/900 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 370/374 places, 894/900 transitions.
Incomplete random walk after 10000 steps, including 191 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 225039 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 225039 steps, saw 92289 distinct states, run finished after 3013 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 894 rows 370 cols
[2022-05-15 20:10:53] [INFO ] Computed 39 place invariants in 5 ms
[2022-05-15 20:10:53] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 20:10:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-15 20:10:53] [INFO ] [Nat]Absence check using 12 positive and 27 generalized place invariants in 12 ms returned sat
[2022-05-15 20:10:54] [INFO ] After 533ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 20:10:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2022-05-15 20:10:54] [INFO ] After 175ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 20:10:54] [INFO ] After 314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 88 ms.
[2022-05-15 20:10:54] [INFO ] After 1133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 20 ms.
Support contains 6 out of 370 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 370/370 places, 894/894 transitions.
Applied a total of 0 rules in 31 ms. Remains 370 /370 variables (removed 0) and now considering 894/894 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 370/370 places, 894/894 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 370/370 places, 894/894 transitions.
Applied a total of 0 rules in 31 ms. Remains 370 /370 variables (removed 0) and now considering 894/894 (removed 0) transitions.
// Phase 1: matrix 894 rows 370 cols
[2022-05-15 20:10:54] [INFO ] Computed 39 place invariants in 5 ms
[2022-05-15 20:11:00] [INFO ] Implicit Places using invariants in 5747 ms returned [167, 241]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 5758 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 368/370 places, 894/894 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 368 transition count 890
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 364 transition count 890
Applied a total of 8 rules in 52 ms. Remains 364 /368 variables (removed 4) and now considering 890/894 (removed 4) transitions.
// Phase 1: matrix 890 rows 364 cols
[2022-05-15 20:11:00] [INFO ] Computed 37 place invariants in 5 ms
[2022-05-15 20:11:03] [INFO ] Implicit Places using invariants in 2684 ms returned [159, 160, 230, 231]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 2702 ms to find 4 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 360/370 places, 890/894 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 358 transition count 888
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 358 transition count 886
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 356 transition count 886
Applied a total of 8 rules in 91 ms. Remains 356 /360 variables (removed 4) and now considering 886/890 (removed 4) transitions.
// Phase 1: matrix 886 rows 356 cols
[2022-05-15 20:11:03] [INFO ] Computed 33 place invariants in 5 ms
[2022-05-15 20:11:03] [INFO ] Implicit Places using invariants in 383 ms returned []
// Phase 1: matrix 886 rows 356 cols
[2022-05-15 20:11:03] [INFO ] Computed 33 place invariants in 4 ms
[2022-05-15 20:11:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 20:11:04] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1456 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 356/370 places, 886/894 transitions.
Finished structural reductions, in 3 iterations. Remains : 356/370 places, 886/894 transitions.
Incomplete random walk after 10000 steps, including 208 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 55 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 146470 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 146470 steps, saw 102760 distinct states, run finished after 3010 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 886 rows 356 cols
[2022-05-15 20:11:08] [INFO ] Computed 33 place invariants in 6 ms
[2022-05-15 20:11:08] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 20:11:08] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-15 20:11:08] [INFO ] [Nat]Absence check using 12 positive and 21 generalized place invariants in 11 ms returned sat
[2022-05-15 20:11:09] [INFO ] After 492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 20:11:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 20:11:09] [INFO ] After 108ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-05-15 20:11:09] [INFO ] After 282ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 206 ms.
[2022-05-15 20:11:09] [INFO ] After 1241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 38 ms.
Support contains 6 out of 356 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 356/356 places, 886/886 transitions.
Applied a total of 0 rules in 17 ms. Remains 356 /356 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 886/886 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 356/356 places, 886/886 transitions.
Applied a total of 0 rules in 37 ms. Remains 356 /356 variables (removed 0) and now considering 886/886 (removed 0) transitions.
// Phase 1: matrix 886 rows 356 cols
[2022-05-15 20:11:09] [INFO ] Computed 33 place invariants in 5 ms
[2022-05-15 20:11:10] [INFO ] Implicit Places using invariants in 337 ms returned []
// Phase 1: matrix 886 rows 356 cols
[2022-05-15 20:11:10] [INFO ] Computed 33 place invariants in 5 ms
[2022-05-15 20:11:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-15 20:11:11] [INFO ] Implicit Places using invariants and state equation in 1098 ms returned []
Implicit Place search using SMT with State Equation took 1483 ms to find 0 implicit places.
[2022-05-15 20:11:11] [INFO ] Redundant transitions in 84 ms returned []
// Phase 1: matrix 886 rows 356 cols
[2022-05-15 20:11:11] [INFO ] Computed 33 place invariants in 18 ms
[2022-05-15 20:11:12] [INFO ] Dead Transitions using invariants and state equation in 731 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 886/886 transitions.
Applied a total of 0 rules in 14 ms. Remains 356 /356 variables (removed 0) and now considering 886/886 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 886 rows 356 cols
[2022-05-15 20:11:12] [INFO ] Computed 33 place invariants in 5 ms
[2022-05-15 20:11:12] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-15 20:11:12] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2022-05-15 20:11:12] [INFO ] [Nat]Absence check using 12 positive and 21 generalized place invariants in 9 ms returned sat
[2022-05-15 20:11:12] [INFO ] After 513ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-15 20:11:13] [INFO ] After 674ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2022-05-15 20:11:13] [INFO ] After 894ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-05-15 20:11:13] [INFO ] Flatten gal took : 111 ms
[2022-05-15 20:11:13] [INFO ] Flatten gal took : 65 ms
[2022-05-15 20:11:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14313371692396185494.gal : 74 ms
[2022-05-15 20:11:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5597624006771010675.prop : 8 ms
Invoking ITS tools like this :cd /tmp/redAtoms10045689328031192836;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14313371692396185494.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5597624006771010675.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality5597624006771010675.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 7
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :7 after 45
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :45 after 329
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :329 after 6561
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6561 after 13777
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :13777 after 16217
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :16217 after 16817
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :16817 after 19253
Reachability property AtomicPropp19 is true.
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :19253 after 320684
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :320684 after 1.64519e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.64519e+06 after 6.78672e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.78672e+06 after 7.32534e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :7.32534e+07 after 9.7543e+08
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.7543e+08 after 2.03855e+10
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.03855e+10 after 2.93419e+12
Detected timeout of ITS tools.
[2022-05-15 20:11:28] [INFO ] Flatten gal took : 81 ms
[2022-05-15 20:11:28] [INFO ] Applying decomposition
[2022-05-15 20:11:28] [INFO ] Flatten gal took : 60 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph8265526114636012811.txt' '-o' '/tmp/graph8265526114636012811.bin' '-w' '/tmp/graph8265526114636012811.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8265526114636012811.bin' '-l' '-1' '-v' '-w' '/tmp/graph8265526114636012811.weights' '-q' '0' '-e' '0.001'
[2022-05-15 20:11:29] [INFO ] Decomposing Gal with order
[2022-05-15 20:11:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 20:11:29] [INFO ] Removed a total of 1742 redundant transitions.
[2022-05-15 20:11:29] [INFO ] Flatten gal took : 349 ms
[2022-05-15 20:11:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 103 labels/synchronizations in 63 ms.
[2022-05-15 20:11:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12708003169782734003.gal : 42 ms
[2022-05-15 20:11:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9609154497886639018.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms10045689328031192836;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12708003169782734003.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9609154497886639018.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality9609154497886639018.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 84
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :84 after 751
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :751 after 124429
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :124429 after 313569
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :313569 after 725865
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :725865 after 757353
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :757353 after 1.01319e+06
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.01319e+06 after 1.24935e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.24935e+06 after 2.43015e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.43015e+06 after 6.1605e+06
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :6.1605e+06 after 1.34729e+07
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :1.34729e+07 after 2.34027e+08
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :2.34027e+08 after 2.0068e+09
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :2.0068e+09 after 1.35429e+10
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9236603455118538483
[2022-05-15 20:11:45] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9236603455118538483
Running compilation step : cd /tmp/ltsmin9236603455118538483;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1873 ms.
Running link step : cd /tmp/ltsmin9236603455118538483;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 75 ms.
Running LTSmin : cd /tmp/ltsmin9236603455118538483;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'AtomicPropp17==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Successfully simplified 19 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ASLink-PT-04a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-04a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U G(p0))&&X(p1)&&p0))))'
Support contains 3 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 1483/1483 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 953 transition count 1475
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 953 transition count 1475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 952 transition count 1467
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 952 transition count 1467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 951 transition count 1459
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 951 transition count 1459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 950 transition count 1451
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 950 transition count 1451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 949 transition count 1443
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 949 transition count 1443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 948 transition count 1435
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 948 transition count 1435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 947 transition count 1427
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 947 transition count 1427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 946 transition count 1419
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 946 transition count 1419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 945 transition count 1411
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 945 transition count 1411
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 944 transition count 1403
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 944 transition count 1403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 943 transition count 1395
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 943 transition count 1395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 942 transition count 1387
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 942 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 941 transition count 1379
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 941 transition count 1379
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 940 transition count 1371
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 940 transition count 1371
Applied a total of 28 rules in 561 ms. Remains 940 /954 variables (removed 14) and now considering 1371/1483 (removed 112) transitions.
// Phase 1: matrix 1371 rows 940 cols
[2022-05-15 20:12:01] [INFO ] Computed 143 place invariants in 7 ms
[2022-05-15 20:12:02] [INFO ] Implicit Places using invariants in 956 ms returned [18, 47, 208, 390, 395, 573, 578, 613, 742, 758, 763, 764, 782, 803, 804, 821, 829, 837, 843, 849, 855, 861, 869, 875, 881, 889]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 970 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 914/954 places, 1371/1483 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 901 transition count 1358
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 901 transition count 1358
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 892 transition count 1349
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 892 transition count 1349
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 888 transition count 1345
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 888 transition count 1345
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 886 transition count 1343
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 886 transition count 1343
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 885 transition count 1342
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 885 transition count 1342
Applied a total of 58 rules in 91 ms. Remains 885 /914 variables (removed 29) and now considering 1342/1371 (removed 29) transitions.
// Phase 1: matrix 1342 rows 885 cols
[2022-05-15 20:12:02] [INFO ] Computed 117 place invariants in 24 ms
[2022-05-15 20:12:02] [INFO ] Implicit Places using invariants in 717 ms returned []
// Phase 1: matrix 1342 rows 885 cols
[2022-05-15 20:12:02] [INFO ] Computed 117 place invariants in 7 ms
[2022-05-15 20:12:05] [INFO ] Implicit Places using invariants and state equation in 2536 ms returned []
Implicit Place search using SMT with State Equation took 3285 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 885/954 places, 1342/1483 transitions.
Finished structural reductions, in 2 iterations. Remains : 885/954 places, 1342/1483 transitions.
Stuttering acceptance computed with spot in 806 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(EQ s651 1), p1:(OR (EQ s772 0) (EQ s816 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 5 ms.
FORMULA ASLink-PT-04a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLFireability-01 finished in 5832 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(F(G(X(X(G(p0)))))))))'
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 954/954 places, 1483/1483 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 166 transitions
Trivial Post-agglo rules discarded 166 transitions
Performed 166 trivial Post agglomeration. Transition count delta: 166
Iterating post reduction 0 with 166 rules applied. Total rules applied 166 place count 953 transition count 1316
Reduce places removed 175 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 179 rules applied. Total rules applied 345 place count 778 transition count 1312
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 349 place count 774 transition count 1312
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 349 place count 774 transition count 1204
Deduced a syphon composed of 108 places in 1 ms
Ensure Unique test removed 36 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 601 place count 630 transition count 1204
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 19 rules applied. Total rules applied 620 place count 618 transition count 1197
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 627 place count 611 transition count 1197
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 627 place count 611 transition count 1192
Deduced a syphon composed of 5 places in 29 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 637 place count 606 transition count 1192
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 643 place count 600 transition count 1179
Iterating global reduction 5 with 6 rules applied. Total rules applied 649 place count 600 transition count 1179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 652 place count 600 transition count 1176
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 655 place count 597 transition count 1166
Iterating global reduction 6 with 3 rules applied. Total rules applied 658 place count 597 transition count 1166
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 661 place count 594 transition count 1156
Iterating global reduction 6 with 3 rules applied. Total rules applied 664 place count 594 transition count 1156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 666 place count 594 transition count 1154
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 667 place count 593 transition count 1146
Iterating global reduction 7 with 1 rules applied. Total rules applied 668 place count 593 transition count 1146
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 669 place count 592 transition count 1138
Iterating global reduction 7 with 1 rules applied. Total rules applied 670 place count 592 transition count 1138
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 671 place count 591 transition count 1130
Iterating global reduction 7 with 1 rules applied. Total rules applied 672 place count 591 transition count 1130
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 673 place count 590 transition count 1122
Iterating global reduction 7 with 1 rules applied. Total rules applied 674 place count 590 transition count 1122
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 675 place count 589 transition count 1114
Iterating global reduction 7 with 1 rules applied. Total rules applied 676 place count 589 transition count 1114
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 677 place count 588 transition count 1106
Iterating global reduction 7 with 1 rules applied. Total rules applied 678 place count 588 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 679 place count 587 transition count 1098
Iterating global reduction 7 with 1 rules applied. Total rules applied 680 place count 587 transition count 1098
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 681 place count 586 transition count 1090
Iterating global reduction 7 with 1 rules applied. Total rules applied 682 place count 586 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 683 place count 585 transition count 1082
Iterating global reduction 7 with 1 rules applied. Total rules applied 684 place count 585 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 685 place count 584 transition count 1074
Iterating global reduction 7 with 1 rules applied. Total rules applied 686 place count 584 transition count 1074
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 687 place count 583 transition count 1066
Iterating global reduction 7 with 1 rules applied. Total rules applied 688 place count 583 transition count 1066
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 792 place count 531 transition count 1014
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 793 place count 530 transition count 1013
Iterating global reduction 7 with 1 rules applied. Total rules applied 794 place count 530 transition count 1013
Applied a total of 794 rules in 833 ms. Remains 530 /954 variables (removed 424) and now considering 1013/1483 (removed 470) transitions.
// Phase 1: matrix 1013 rows 530 cols
[2022-05-15 20:12:07] [INFO ] Computed 86 place invariants in 37 ms
[2022-05-15 20:12:15] [INFO ] Implicit Places using invariants in 8365 ms returned [17, 41, 76, 97, 105, 111, 170, 204, 213, 265, 299, 311, 346, 364, 400, 401, 413, 414, 432, 453, 464, 469, 474, 479, 484, 489, 494, 499, 504, 509, 514, 520, 526]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 8410 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 497/954 places, 1013/1483 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 497 transition count 992
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 476 transition count 991
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 43 place count 476 transition count 977
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 71 place count 462 transition count 977
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 461 transition count 975
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 459 transition count 975
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 91 place count 444 transition count 960
Iterating global reduction 4 with 15 rules applied. Total rules applied 106 place count 444 transition count 960
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 107 place count 444 transition count 959
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 107 place count 444 transition count 958
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 109 place count 443 transition count 958
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 114 place count 438 transition count 953
Iterating global reduction 5 with 5 rules applied. Total rules applied 119 place count 438 transition count 953
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 121 place count 436 transition count 951
Iterating global reduction 5 with 2 rules applied. Total rules applied 123 place count 436 transition count 951
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 435 transition count 950
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 435 transition count 950
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 169 place count 413 transition count 928
Applied a total of 169 rules in 127 ms. Remains 413 /497 variables (removed 84) and now considering 928/1013 (removed 85) transitions.
// Phase 1: matrix 928 rows 413 cols
[2022-05-15 20:12:15] [INFO ] Computed 52 place invariants in 5 ms
[2022-05-15 20:12:16] [INFO ] Implicit Places using invariants in 692 ms returned [163, 169, 174, 250, 256, 261, 337, 343, 348]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 701 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 404/954 places, 928/1483 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 398 transition count 922
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 398 transition count 922
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 392 transition count 916
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 392 transition count 916
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 389 transition count 913
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 389 transition count 913
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 386 transition count 910
Applied a total of 36 rules in 88 ms. Remains 386 /404 variables (removed 18) and now considering 910/928 (removed 18) transitions.
// Phase 1: matrix 910 rows 386 cols
[2022-05-15 20:12:16] [INFO ] Computed 43 place invariants in 8 ms
[2022-05-15 20:12:16] [INFO ] Implicit Places using invariants in 345 ms returned []
// Phase 1: matrix 910 rows 386 cols
[2022-05-15 20:12:16] [INFO ] Computed 43 place invariants in 5 ms
[2022-05-15 20:12:17] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 1018 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 386/954 places, 910/1483 transitions.
Finished structural reductions, in 3 iterations. Remains : 386/954 places, 910/1483 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s326 0) (EQ s354 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1579 reset in 357 ms.
Product exploration explored 100000 steps with 1608 reset in 442 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 224 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Finished random walk after 151 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=75 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 386 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 386/386 places, 910/910 transitions.
Applied a total of 0 rules in 15 ms. Remains 386 /386 variables (removed 0) and now considering 910/910 (removed 0) transitions.
// Phase 1: matrix 910 rows 386 cols
[2022-05-15 20:12:18] [INFO ] Computed 43 place invariants in 7 ms
[2022-05-15 20:12:19] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 910 rows 386 cols
[2022-05-15 20:12:19] [INFO ] Computed 43 place invariants in 4 ms
[2022-05-15 20:12:19] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 830 ms to find 0 implicit places.
[2022-05-15 20:12:19] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 910 rows 386 cols
[2022-05-15 20:12:19] [INFO ] Computed 43 place invariants in 5 ms
[2022-05-15 20:12:20] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 386/386 places, 910/910 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 21 ms :[(NOT p0)]
Finished random walk after 105 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=105 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1565 reset in 237 ms.
Product exploration explored 100000 steps with 1597 reset in 345 ms.
Built C files in :
/tmp/ltsmin12288051342480263758
[2022-05-15 20:12:21] [INFO ] Computing symmetric may disable matrix : 910 transitions.
[2022-05-15 20:12:21] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:12:21] [INFO ] Computing symmetric may enable matrix : 910 transitions.
[2022-05-15 20:12:21] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:12:21] [INFO ] Computing Do-Not-Accords matrix : 910 transitions.
[2022-05-15 20:12:21] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 20:12:21] [INFO ] Built C files in 192ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12288051342480263758
Running compilation step : cd /tmp/ltsmin12288051342480263758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2213 ms.
Running link step : cd /tmp/ltsmin12288051342480263758;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin12288051342480263758;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15798592836673813574.hoa' '--buchi-type=spotba'
LTSmin run took 4659 ms.
FORMULA ASLink-PT-04a-LTLFireability-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-04a-LTLFireability-03 finished in 21874 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(true U !(!F(p0) U p1)))'
Support contains 3 out of 954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 954/954 places, 1483/1483 transitions.
Drop transitions removed 166 transitions
Trivial Post-agglo rules discarded 166 transitions
Performed 166 trivial Post agglomeration. Transition count delta: 166
Iterating post reduction 0 with 166 rules applied. Total rules applied 166 place count 954 transition count 1317
Reduce places removed 166 places and 0 transitions.
Iterating post reduction 1 with 166 rules applied. Total rules applied 332 place count 788 transition count 1317
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 91 Pre rules applied. Total rules applied 332 place count 788 transition count 1226
Deduced a syphon composed of 91 places in 1 ms
Ensure Unique test removed 36 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 218 rules applied. Total rules applied 550 place count 661 transition count 1226
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 551 place count 661 transition count 1225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 552 place count 660 transition count 1225
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 552 place count 660 transition count 1221
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 560 place count 656 transition count 1221
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 561 place count 655 transition count 1213
Iterating global reduction 4 with 1 rules applied. Total rules applied 562 place count 655 transition count 1213
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 563 place count 654 transition count 1205
Iterating global reduction 4 with 1 rules applied. Total rules applied 564 place count 654 transition count 1205
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 565 place count 653 transition count 1197
Iterating global reduction 4 with 1 rules applied. Total rules applied 566 place count 653 transition count 1197
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 567 place count 652 transition count 1189
Iterating global reduction 4 with 1 rules applied. Total rules applied 568 place count 652 transition count 1189
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 569 place count 651 transition count 1181
Iterating global reduction 4 with 1 rules applied. Total rules applied 570 place count 651 transition count 1181
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 571 place count 650 transition count 1173
Iterating global reduction 4 with 1 rules applied. Total rules applied 572 place count 650 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 573 place count 649 transition count 1165
Iterating global reduction 4 with 1 rules applied. Total rules applied 574 place count 649 transition count 1165
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 575 place count 648 transition count 1157
Iterating global reduction 4 with 1 rules applied. Total rules applied 576 place count 648 transition count 1157
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 577 place count 647 transition count 1149
Iterating global reduction 4 with 1 rules applied. Total rules applied 578 place count 647 transition count 1149
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 579 place count 646 transition count 1141
Iterating global reduction 4 with 1 rules applied. Total rules applied 580 place count 646 transition count 1141
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 581 place count 645 transition count 1133
Iterating global reduction 4 with 1 rules applied. Total rules applied 582 place count 645 transition count 1133
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 583 place count 644 transition count 1125
Iterating global reduction 4 with 1 rules applied. Total rules applied 584 place count 644 transition count 1125
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 585 place count 643 transition count 1117
Iterating global reduction 4 with 1 rules applied. Total rules applied 586 place count 643 transition count 1117
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 587 place count 642 transition count 1109
Iterating global reduction 4 with 1 rules applied. Total rules applied 588 place count 642 transition count 1109
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 678 place count 597 transition count 1064
Applied a total of 678 rules in 181 ms. Remains 597 /954 variables (removed 357) and now considering 1064/1483 (removed 419) transitions.
// Phase 1: matrix 1064 rows 597 cols
[2022-05-15 20:12:28] [INFO ] Computed 107 place invariants in 11 ms
[2022-05-15 20:12:28] [INFO ] Implicit Places using invariants in 354 ms returned [18, 41, 99, 107, 113, 132, 133, 239, 240, 241, 349, 350, 351, 386, 448, 462, 463, 464, 465, 483, 504, 505, 516, 521, 526, 531, 536, 541, 546, 551, 556, 561, 566]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 355 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 564/954 places, 1064/1483 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 564 transition count 1043
Reduce places removed 21 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 543 transition count 1042
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 44 place count 542 transition count 1042
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 44 place count 542 transition count 1011
Deduced a syphon composed of 31 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 107 place count 510 transition count 1011
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 19 rules applied. Total rules applied 126 place count 501 transition count 1001
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 136 place count 491 transition count 1001
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 155 place count 472 transition count 982
Iterating global reduction 5 with 19 rules applied. Total rules applied 174 place count 472 transition count 982
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 178 place count 472 transition count 978
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 178 place count 472 transition count 977
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 180 place count 471 transition count 977
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 185 place count 466 transition count 972
Iterating global reduction 6 with 5 rules applied. Total rules applied 190 place count 466 transition count 972
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 192 place count 464 transition count 970
Iterating global reduction 6 with 2 rules applied. Total rules applied 194 place count 464 transition count 970
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 195 place count 463 transition count 969
Iterating global reduction 6 with 1 rules applied. Total rules applied 196 place count 463 transition count 969
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 242 place count 440 transition count 946
Applied a total of 242 rules in 54 ms. Remains 440 /564 variables (removed 124) and now considering 946/1064 (removed 118) transitions.
// Phase 1: matrix 946 rows 440 cols
[2022-05-15 20:12:28] [INFO ] Computed 64 place invariants in 6 ms
[2022-05-15 20:12:29] [INFO ] Implicit Places using invariants in 292 ms returned [93, 96, 174, 180, 185, 188, 191, 268, 274, 279, 281, 284, 344, 361, 367, 372, 374, 437]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 306 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 422/954 places, 946/1483 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 422 transition count 942
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 418 transition count 942
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 18 place count 408 transition count 932
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 408 transition count 932
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 31 place count 408 transition count 929
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 37 place count 402 transition count 923
Iterating global reduction 3 with 6 rules applied. Total rules applied 43 place count 402 transition count 923
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 46 place count 399 transition count 920
Iterating global reduction 3 with 3 rules applied. Total rules applied 49 place count 399 transition count 920
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 57 place count 395 transition count 916
Applied a total of 57 rules in 62 ms. Remains 395 /422 variables (removed 27) and now considering 916/946 (removed 30) transitions.
// Phase 1: matrix 916 rows 395 cols
[2022-05-15 20:12:29] [INFO ] Computed 46 place invariants in 7 ms
[2022-05-15 20:12:29] [INFO ] Implicit Places using invariants in 364 ms returned [72, 152, 233]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 366 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 392/954 places, 916/1483 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 389 transition count 913
Applied a total of 6 rules in 20 ms. Remains 389 /392 variables (removed 3) and now considering 913/916 (removed 3) transitions.
// Phase 1: matrix 913 rows 389 cols
[2022-05-15 20:12:29] [INFO ] Computed 43 place invariants in 5 ms
[2022-05-15 20:12:29] [INFO ] Implicit Places using invariants in 199 ms returned []
// Phase 1: matrix 913 rows 389 cols
[2022-05-15 20:12:29] [INFO ] Computed 43 place invariants in 5 ms
[2022-05-15 20:12:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2022-05-15 20:12:30] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 389/954 places, 913/1483 transitions.
Finished structural reductions, in 4 iterations. Remains : 389/954 places, 913/1483 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), true, p0, (NOT p1)]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s179 1) (EQ s290 1)), p0:(EQ s149 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLFireability-05 finished in 2445 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||F(X(p0))||G(p1)))'
Support contains 4 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 1483/1483 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 953 transition count 1475
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 953 transition count 1475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 952 transition count 1467
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 952 transition count 1467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 951 transition count 1459
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 951 transition count 1459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 950 transition count 1451
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 950 transition count 1451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 949 transition count 1443
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 949 transition count 1443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 948 transition count 1435
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 948 transition count 1435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 947 transition count 1427
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 947 transition count 1427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 946 transition count 1419
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 946 transition count 1419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 945 transition count 1411
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 945 transition count 1411
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 944 transition count 1403
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 944 transition count 1403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 943 transition count 1395
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 943 transition count 1395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 942 transition count 1387
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 942 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 941 transition count 1379
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 941 transition count 1379
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 940 transition count 1371
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 940 transition count 1371
Applied a total of 28 rules in 259 ms. Remains 940 /954 variables (removed 14) and now considering 1371/1483 (removed 112) transitions.
// Phase 1: matrix 1371 rows 940 cols
[2022-05-15 20:12:30] [INFO ] Computed 143 place invariants in 22 ms
[2022-05-15 20:12:31] [INFO ] Implicit Places using invariants in 511 ms returned [18, 47, 208, 390, 395, 573, 578, 613, 742, 758, 763, 764, 782, 803, 804, 821, 829, 837, 843, 849, 855, 861, 869, 875, 881, 889]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 514 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 914/954 places, 1371/1483 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 901 transition count 1358
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 901 transition count 1358
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 891 transition count 1348
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 891 transition count 1348
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 886 transition count 1343
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 886 transition count 1343
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 884 transition count 1341
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 884 transition count 1341
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 882 transition count 1339
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 882 transition count 1339
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 881 transition count 1338
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 881 transition count 1338
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 880 transition count 1337
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 880 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 879 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 879 transition count 1336
Applied a total of 70 rules in 149 ms. Remains 879 /914 variables (removed 35) and now considering 1336/1371 (removed 35) transitions.
// Phase 1: matrix 1336 rows 879 cols
[2022-05-15 20:12:31] [INFO ] Computed 117 place invariants in 11 ms
[2022-05-15 20:12:31] [INFO ] Implicit Places using invariants in 405 ms returned []
// Phase 1: matrix 1336 rows 879 cols
[2022-05-15 20:12:31] [INFO ] Computed 117 place invariants in 21 ms
[2022-05-15 20:12:33] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 1702 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 879/954 places, 1336/1483 transitions.
Finished structural reductions, in 2 iterations. Remains : 879/954 places, 1336/1483 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s264 1) (EQ s390 1)), p1:(AND (EQ s589 1) (EQ s684 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-04a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLFireability-06 finished in 2772 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 3 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 1483/1483 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 953 transition count 1475
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 953 transition count 1475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 952 transition count 1467
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 952 transition count 1467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 951 transition count 1459
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 951 transition count 1459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 950 transition count 1451
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 950 transition count 1451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 949 transition count 1443
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 949 transition count 1443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 948 transition count 1435
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 948 transition count 1435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 947 transition count 1427
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 947 transition count 1427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 946 transition count 1419
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 946 transition count 1419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 945 transition count 1411
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 945 transition count 1411
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 944 transition count 1403
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 944 transition count 1403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 943 transition count 1395
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 943 transition count 1395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 942 transition count 1387
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 942 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 941 transition count 1379
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 941 transition count 1379
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 940 transition count 1371
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 940 transition count 1371
Applied a total of 28 rules in 277 ms. Remains 940 /954 variables (removed 14) and now considering 1371/1483 (removed 112) transitions.
// Phase 1: matrix 1371 rows 940 cols
[2022-05-15 20:12:33] [INFO ] Computed 143 place invariants in 35 ms
[2022-05-15 20:12:34] [INFO ] Implicit Places using invariants in 596 ms returned [18, 47, 208, 390, 395, 573, 578, 613, 742, 758, 763, 764, 782, 803, 804, 821, 829, 837, 843, 849, 855, 861, 869, 875, 881, 889]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 600 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 914/954 places, 1371/1483 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 901 transition count 1358
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 901 transition count 1358
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 891 transition count 1348
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 891 transition count 1348
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 886 transition count 1343
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 886 transition count 1343
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 884 transition count 1341
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 884 transition count 1341
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 882 transition count 1339
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 882 transition count 1339
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 881 transition count 1338
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 881 transition count 1338
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 880 transition count 1337
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 880 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 879 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 879 transition count 1336
Applied a total of 70 rules in 156 ms. Remains 879 /914 variables (removed 35) and now considering 1336/1371 (removed 35) transitions.
// Phase 1: matrix 1336 rows 879 cols
[2022-05-15 20:12:34] [INFO ] Computed 117 place invariants in 21 ms
[2022-05-15 20:12:34] [INFO ] Implicit Places using invariants in 457 ms returned []
// Phase 1: matrix 1336 rows 879 cols
[2022-05-15 20:12:34] [INFO ] Computed 117 place invariants in 14 ms
[2022-05-15 20:12:36] [INFO ] Implicit Places using invariants and state equation in 1215 ms returned []
Implicit Place search using SMT with State Equation took 1674 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 879/954 places, 1336/1483 transitions.
Finished structural reductions, in 2 iterations. Remains : 879/954 places, 1336/1483 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s746 0) (EQ s770 0)), p1:(EQ s265 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 493 steps with 2 reset in 2 ms.
FORMULA ASLink-PT-04a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLFireability-07 finished in 2902 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 1483/1483 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 953 transition count 1475
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 953 transition count 1475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 952 transition count 1467
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 952 transition count 1467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 951 transition count 1459
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 951 transition count 1459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 950 transition count 1451
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 950 transition count 1451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 949 transition count 1443
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 949 transition count 1443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 948 transition count 1435
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 948 transition count 1435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 947 transition count 1427
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 947 transition count 1427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 946 transition count 1419
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 946 transition count 1419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 945 transition count 1411
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 945 transition count 1411
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 944 transition count 1403
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 944 transition count 1403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 943 transition count 1395
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 943 transition count 1395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 942 transition count 1387
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 942 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 941 transition count 1379
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 941 transition count 1379
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 940 transition count 1371
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 940 transition count 1371
Applied a total of 28 rules in 261 ms. Remains 940 /954 variables (removed 14) and now considering 1371/1483 (removed 112) transitions.
// Phase 1: matrix 1371 rows 940 cols
[2022-05-15 20:12:36] [INFO ] Computed 143 place invariants in 19 ms
[2022-05-15 20:12:37] [INFO ] Implicit Places using invariants in 502 ms returned [18, 47, 208, 390, 395, 573, 578, 613, 742, 758, 763, 764, 782, 803, 804, 821, 829, 837, 843, 849, 855, 861, 869, 875, 881, 889]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 505 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 914/954 places, 1371/1483 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 901 transition count 1358
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 901 transition count 1358
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 891 transition count 1348
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 891 transition count 1348
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 886 transition count 1343
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 886 transition count 1343
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 884 transition count 1341
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 884 transition count 1341
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 882 transition count 1339
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 882 transition count 1339
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 881 transition count 1338
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 881 transition count 1338
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 880 transition count 1337
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 880 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 879 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 879 transition count 1336
Applied a total of 70 rules in 176 ms. Remains 879 /914 variables (removed 35) and now considering 1336/1371 (removed 35) transitions.
// Phase 1: matrix 1336 rows 879 cols
[2022-05-15 20:12:37] [INFO ] Computed 117 place invariants in 21 ms
[2022-05-15 20:12:37] [INFO ] Implicit Places using invariants in 471 ms returned []
// Phase 1: matrix 1336 rows 879 cols
[2022-05-15 20:12:37] [INFO ] Computed 117 place invariants in 10 ms
[2022-05-15 20:12:39] [INFO ] Implicit Places using invariants and state equation in 1320 ms returned []
Implicit Place search using SMT with State Equation took 1794 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 879/954 places, 1336/1483 transitions.
Finished structural reductions, in 2 iterations. Remains : 879/954 places, 1336/1483 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s445 1) (EQ s571 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 145 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-04a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLFireability-08 finished in 2821 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(G(G(p0)))||p1)))'
Support contains 6 out of 954 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 954/954 places, 1483/1483 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 953 transition count 1475
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 953 transition count 1475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 952 transition count 1467
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 952 transition count 1467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 951 transition count 1459
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 951 transition count 1459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 950 transition count 1451
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 950 transition count 1451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 949 transition count 1443
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 949 transition count 1443
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 948 transition count 1435
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 948 transition count 1435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 947 transition count 1427
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 947 transition count 1427
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 946 transition count 1419
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 946 transition count 1419
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 945 transition count 1411
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 945 transition count 1411
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 944 transition count 1403
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 944 transition count 1403
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 943 transition count 1395
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 943 transition count 1395
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 942 transition count 1387
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 942 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 941 transition count 1379
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 941 transition count 1379
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 940 transition count 1371
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 940 transition count 1371
Applied a total of 28 rules in 250 ms. Remains 940 /954 variables (removed 14) and now considering 1371/1483 (removed 112) transitions.
// Phase 1: matrix 1371 rows 940 cols
[2022-05-15 20:12:39] [INFO ] Computed 143 place invariants in 8 ms
[2022-05-15 20:12:39] [INFO ] Implicit Places using invariants in 493 ms returned [47, 208, 390, 395, 573, 578, 613, 742, 758, 763, 764, 782, 803, 804, 821, 829, 837, 843, 849, 855, 861, 869, 875, 881, 889]
Discarding 25 places :
Implicit Place search using SMT only with invariants took 495 ms to find 25 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 915/954 places, 1371/1483 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 902 transition count 1358
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 902 transition count 1358
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 892 transition count 1348
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 892 transition count 1348
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 887 transition count 1343
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 887 transition count 1343
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 885 transition count 1341
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 885 transition count 1341
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 883 transition count 1339
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 883 transition count 1339
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 882 transition count 1338
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 882 transition count 1338
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 881 transition count 1337
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 881 transition count 1337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 880 transition count 1336
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 880 transition count 1336
Applied a total of 70 rules in 172 ms. Remains 880 /915 variables (removed 35) and now considering 1336/1371 (removed 35) transitions.
// Phase 1: matrix 1336 rows 880 cols
[2022-05-15 20:12:40] [INFO ] Computed 118 place invariants in 10 ms
[2022-05-15 20:12:40] [INFO ] Implicit Places using invariants in 461 ms returned []
// Phase 1: matrix 1336 rows 880 cols
[2022-05-15 20:12:40] [INFO ] Computed 118 place invariants in 10 ms
[2022-05-15 20:12:41] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1714 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 880/954 places, 1336/1483 transitions.
Finished structural reductions, in 2 iterations. Remains : 880/954 places, 1336/1483 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(OR (EQ s47 0) (EQ s118 0)), p1:(AND (EQ s18 1) (EQ s25 1) (OR (EQ s590 0) (EQ s683 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 79807 steps with 566 reset in 262 ms.
FORMULA ASLink-PT-04a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLFireability-10 finished in 3023 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((false U false)))'
Support contains 0 out of 954 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 954/954 places, 1483/1483 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 166 transitions
Trivial Post-agglo rules discarded 166 transitions
Performed 166 trivial Post agglomeration. Transition count delta: 166
Iterating post reduction 0 with 166 rules applied. Total rules applied 166 place count 953 transition count 1316
Reduce places removed 175 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 179 rules applied. Total rules applied 345 place count 778 transition count 1312
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 349 place count 774 transition count 1312
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 349 place count 774 transition count 1204
Deduced a syphon composed of 108 places in 2 ms
Ensure Unique test removed 36 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 601 place count 630 transition count 1204
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 19 rules applied. Total rules applied 620 place count 618 transition count 1197
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 627 place count 611 transition count 1197
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 627 place count 611 transition count 1192
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 637 place count 606 transition count 1192
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 643 place count 600 transition count 1179
Iterating global reduction 5 with 6 rules applied. Total rules applied 649 place count 600 transition count 1179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 652 place count 600 transition count 1176
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 655 place count 597 transition count 1166
Iterating global reduction 6 with 3 rules applied. Total rules applied 658 place count 597 transition count 1166
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 661 place count 594 transition count 1156
Iterating global reduction 6 with 3 rules applied. Total rules applied 664 place count 594 transition count 1156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 666 place count 594 transition count 1154
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 667 place count 593 transition count 1146
Iterating global reduction 7 with 1 rules applied. Total rules applied 668 place count 593 transition count 1146
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 669 place count 592 transition count 1138
Iterating global reduction 7 with 1 rules applied. Total rules applied 670 place count 592 transition count 1138
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 671 place count 591 transition count 1130
Iterating global reduction 7 with 1 rules applied. Total rules applied 672 place count 591 transition count 1130
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 673 place count 590 transition count 1122
Iterating global reduction 7 with 1 rules applied. Total rules applied 674 place count 590 transition count 1122
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 675 place count 589 transition count 1114
Iterating global reduction 7 with 1 rules applied. Total rules applied 676 place count 589 transition count 1114
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 677 place count 588 transition count 1106
Iterating global reduction 7 with 1 rules applied. Total rules applied 678 place count 588 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 679 place count 587 transition count 1098
Iterating global reduction 7 with 1 rules applied. Total rules applied 680 place count 587 transition count 1098
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 681 place count 586 transition count 1090
Iterating global reduction 7 with 1 rules applied. Total rules applied 682 place count 586 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 683 place count 585 transition count 1082
Iterating global reduction 7 with 1 rules applied. Total rules applied 684 place count 585 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 685 place count 584 transition count 1074
Iterating global reduction 7 with 1 rules applied. Total rules applied 686 place count 584 transition count 1074
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 687 place count 583 transition count 1066
Iterating global reduction 7 with 1 rules applied. Total rules applied 688 place count 583 transition count 1066
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 792 place count 531 transition count 1014
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 793 place count 530 transition count 1013
Iterating global reduction 7 with 1 rules applied. Total rules applied 794 place count 530 transition count 1013
Applied a total of 794 rules in 229 ms. Remains 530 /954 variables (removed 424) and now considering 1013/1483 (removed 470) transitions.
// Phase 1: matrix 1013 rows 530 cols
[2022-05-15 20:12:42] [INFO ] Computed 86 place invariants in 8 ms
[2022-05-15 20:12:42] [INFO ] Implicit Places using invariants in 495 ms returned [17, 41, 76, 97, 105, 111, 170, 204, 213, 265, 299, 311, 346, 364, 400, 401, 413, 414, 432, 453, 464, 469, 474, 479, 484, 489, 494, 499, 504, 509, 514, 520, 526]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 497 ms to find 33 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 497/954 places, 1013/1483 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 497 transition count 992
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 476 transition count 991
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 43 place count 476 transition count 977
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 71 place count 462 transition count 977
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 461 transition count 975
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 76 place count 459 transition count 975
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 91 place count 444 transition count 960
Iterating global reduction 4 with 15 rules applied. Total rules applied 106 place count 444 transition count 960
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 107 place count 444 transition count 959
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 107 place count 444 transition count 958
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 109 place count 443 transition count 958
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 114 place count 438 transition count 953
Iterating global reduction 5 with 5 rules applied. Total rules applied 119 place count 438 transition count 953
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 121 place count 436 transition count 951
Iterating global reduction 5 with 2 rules applied. Total rules applied 123 place count 436 transition count 951
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 124 place count 435 transition count 950
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 435 transition count 950
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 169 place count 413 transition count 928
Applied a total of 169 rules in 81 ms. Remains 413 /497 variables (removed 84) and now considering 928/1013 (removed 85) transitions.
// Phase 1: matrix 928 rows 413 cols
[2022-05-15 20:12:42] [INFO ] Computed 52 place invariants in 5 ms
[2022-05-15 20:12:43] [INFO ] Implicit Places using invariants in 209 ms returned [163, 169, 174, 250, 256, 261, 337, 343, 348]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 224 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 404/954 places, 928/1483 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 398 transition count 922
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 398 transition count 922
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 392 transition count 916
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 392 transition count 916
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 389 transition count 913
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 389 transition count 913
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 386 transition count 910
Applied a total of 36 rules in 37 ms. Remains 386 /404 variables (removed 18) and now considering 910/928 (removed 18) transitions.
// Phase 1: matrix 910 rows 386 cols
[2022-05-15 20:12:43] [INFO ] Computed 43 place invariants in 5 ms
[2022-05-15 20:12:43] [INFO ] Implicit Places using invariants in 191 ms returned []
// Phase 1: matrix 910 rows 386 cols
[2022-05-15 20:12:43] [INFO ] Computed 43 place invariants in 9 ms
[2022-05-15 20:12:43] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 386/954 places, 910/1483 transitions.
Finished structural reductions, in 3 iterations. Remains : 386/954 places, 910/1483 transitions.
Stuttering acceptance computed with spot in 12 ms :[true]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}]], initial=0, aps=[], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLFireability-11 finished in 1873 ms.
All properties solved by simple procedures.
Total runtime 203689 ms.

BK_STOP 1652645564057

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-04a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-04a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r006-tajo-165245688800060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04a.tgz
mv ASLink-PT-04a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;