fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r294-smll-165463872400100
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for StigmergyCommit-PT-02b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1501.548 156818.00 300422.00 931.90 FFFFTFFTFFTFFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r294-smll-165463872400100.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is StigmergyCommit-PT-02b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872400100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 5.9K May 30 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 30 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 30 14:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 30 14:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 25 13:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 13:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 11K May 30 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 30 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 30 14:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K May 30 14:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 231K May 29 12:20 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 StigmergyCommit-PT-02b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-02b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654767818263

Running Version 202205111006
[2022-06-09 09:43:40] [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-06-09 09:43:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 09:43:40] [INFO ] Load time of PNML (sax parser for PT used): 243 ms
[2022-06-09 09:43:40] [INFO ] Transformed 928 places.
[2022-06-09 09:43:40] [INFO ] Transformed 1040 transitions.
[2022-06-09 09:43:40] [INFO ] Found NUPN structural information;
[2022-06-09 09:43:40] [INFO ] Parsed PT model containing 928 places and 1040 transitions in 435 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-02b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 928 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 928/928 places, 1040/1040 transitions.
Discarding 72 places :
Symmetric choice reduction at 0 with 72 rule applications. Total rules 72 place count 856 transition count 968
Iterating global reduction 0 with 72 rules applied. Total rules applied 144 place count 856 transition count 968
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 188 place count 812 transition count 924
Iterating global reduction 0 with 44 rules applied. Total rules applied 232 place count 812 transition count 924
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 257 place count 787 transition count 899
Iterating global reduction 0 with 25 rules applied. Total rules applied 282 place count 787 transition count 899
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 303 place count 766 transition count 878
Iterating global reduction 0 with 21 rules applied. Total rules applied 324 place count 766 transition count 878
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 342 place count 748 transition count 860
Iterating global reduction 0 with 18 rules applied. Total rules applied 360 place count 748 transition count 860
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 377 place count 731 transition count 843
Iterating global reduction 0 with 17 rules applied. Total rules applied 394 place count 731 transition count 843
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 409 place count 716 transition count 828
Iterating global reduction 0 with 15 rules applied. Total rules applied 424 place count 716 transition count 828
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 439 place count 701 transition count 813
Iterating global reduction 0 with 15 rules applied. Total rules applied 454 place count 701 transition count 813
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 467 place count 688 transition count 800
Iterating global reduction 0 with 13 rules applied. Total rules applied 480 place count 688 transition count 800
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 490 place count 678 transition count 790
Iterating global reduction 0 with 10 rules applied. Total rules applied 500 place count 678 transition count 790
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 504 place count 674 transition count 786
Iterating global reduction 0 with 4 rules applied. Total rules applied 508 place count 674 transition count 786
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 512 place count 670 transition count 782
Iterating global reduction 0 with 4 rules applied. Total rules applied 516 place count 670 transition count 782
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 517 place count 669 transition count 781
Iterating global reduction 0 with 1 rules applied. Total rules applied 518 place count 669 transition count 781
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 519 place count 668 transition count 780
Iterating global reduction 0 with 1 rules applied. Total rules applied 520 place count 668 transition count 780
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 521 place count 667 transition count 779
Iterating global reduction 0 with 1 rules applied. Total rules applied 522 place count 667 transition count 779
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 523 place count 666 transition count 778
Iterating global reduction 0 with 1 rules applied. Total rules applied 524 place count 666 transition count 778
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 525 place count 665 transition count 777
Iterating global reduction 0 with 1 rules applied. Total rules applied 526 place count 665 transition count 777
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 527 place count 664 transition count 776
Iterating global reduction 0 with 1 rules applied. Total rules applied 528 place count 664 transition count 776
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 529 place count 663 transition count 775
Iterating global reduction 0 with 1 rules applied. Total rules applied 530 place count 663 transition count 775
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 531 place count 662 transition count 774
Iterating global reduction 0 with 1 rules applied. Total rules applied 532 place count 662 transition count 774
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 533 place count 661 transition count 773
Iterating global reduction 0 with 1 rules applied. Total rules applied 534 place count 661 transition count 773
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 535 place count 660 transition count 772
Iterating global reduction 0 with 1 rules applied. Total rules applied 536 place count 660 transition count 772
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 537 place count 660 transition count 771
Applied a total of 537 rules in 1216 ms. Remains 660 /928 variables (removed 268) and now considering 771/1040 (removed 269) transitions.
// Phase 1: matrix 771 rows 660 cols
[2022-06-09 09:43:42] [INFO ] Computed 4 place invariants in 24 ms
[2022-06-09 09:43:42] [INFO ] Implicit Places using invariants in 475 ms returned []
// Phase 1: matrix 771 rows 660 cols
[2022-06-09 09:43:42] [INFO ] Computed 4 place invariants in 8 ms
[2022-06-09 09:43:43] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 1166 ms to find 0 implicit places.
// Phase 1: matrix 771 rows 660 cols
[2022-06-09 09:43:43] [INFO ] Computed 4 place invariants in 7 ms
[2022-06-09 09:43:43] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 660/928 places, 771/1040 transitions.
Finished structural reductions, in 1 iterations. Remains : 660/928 places, 771/1040 transitions.
Support contains 42 out of 660 places after structural reductions.
[2022-06-09 09:43:44] [INFO ] Flatten gal took : 211 ms
[2022-06-09 09:43:44] [INFO ] Flatten gal took : 143 ms
[2022-06-09 09:43:44] [INFO ] Input system was already deterministic with 771 transitions.
Incomplete random walk after 10000 steps, including 162 resets, run finished after 852 ms. (steps per millisecond=11 ) properties (out of 38) seen :11
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Running SMT prover for 24 properties.
// Phase 1: matrix 771 rows 660 cols
[2022-06-09 09:43:46] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-09 09:43:46] [INFO ] After 562ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2022-06-09 09:43:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2022-06-09 09:43:48] [INFO ] After 1093ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :23
[2022-06-09 09:43:49] [INFO ] Deduced a trap composed of 331 places in 324 ms of which 10 ms to minimize.
[2022-06-09 09:43:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 405 ms
[2022-06-09 09:43:49] [INFO ] Deduced a trap composed of 300 places in 253 ms of which 2 ms to minimize.
[2022-06-09 09:43:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 338 ms
[2022-06-09 09:43:50] [INFO ] Deduced a trap composed of 312 places in 295 ms of which 2 ms to minimize.
[2022-06-09 09:43:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 395 ms
[2022-06-09 09:43:50] [INFO ] Deduced a trap composed of 306 places in 294 ms of which 3 ms to minimize.
[2022-06-09 09:43:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 392 ms
[2022-06-09 09:43:51] [INFO ] Deduced a trap composed of 314 places in 281 ms of which 2 ms to minimize.
[2022-06-09 09:43:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 376 ms
[2022-06-09 09:43:51] [INFO ] Deduced a trap composed of 313 places in 389 ms of which 1 ms to minimize.
[2022-06-09 09:43:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 485 ms
[2022-06-09 09:43:52] [INFO ] Deduced a trap composed of 329 places in 240 ms of which 0 ms to minimize.
[2022-06-09 09:43:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 284 ms
[2022-06-09 09:43:52] [INFO ] Deduced a trap composed of 315 places in 314 ms of which 1 ms to minimize.
[2022-06-09 09:43:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 386 ms
[2022-06-09 09:43:52] [INFO ] After 5460ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :22
Attempting to minimize the solution found.
Minimization took 719 ms.
[2022-06-09 09:43:53] [INFO ] After 6978ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :22
Fused 24 Parikh solutions to 20 different solutions.
Parikh walk visited 18 properties in 196 ms.
Support contains 4 out of 660 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 660/660 places, 771/771 transitions.
Graph (trivial) has 652 edges and 660 vertex of which 44 / 660 are part of one of the 8 SCC in 12 ms
Free SCC test removed 36 places
Drop transitions removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 910 edges and 624 vertex of which 621 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 463 transitions
Trivial Post-agglo rules discarded 463 transitions
Performed 463 trivial Post agglomeration. Transition count delta: 463
Iterating post reduction 0 with 466 rules applied. Total rules applied 468 place count 621 transition count 256
Reduce places removed 463 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 472 rules applied. Total rules applied 940 place count 158 transition count 247
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 945 place count 154 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 946 place count 153 transition count 246
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 38 Pre rules applied. Total rules applied 946 place count 153 transition count 208
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 1022 place count 115 transition count 208
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1029 place count 108 transition count 201
Iterating global reduction 4 with 7 rules applied. Total rules applied 1036 place count 108 transition count 201
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1036 place count 108 transition count 200
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1038 place count 107 transition count 200
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1039 place count 107 transition count 199
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 1044 place count 102 transition count 194
Iterating global reduction 5 with 5 rules applied. Total rules applied 1049 place count 102 transition count 194
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 1051 place count 100 transition count 192
Iterating global reduction 5 with 2 rules applied. Total rules applied 1053 place count 100 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1054 place count 100 transition count 191
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1055 place count 99 transition count 190
Iterating global reduction 6 with 1 rules applied. Total rules applied 1056 place count 99 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1057 place count 99 transition count 189
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 1097 place count 79 transition count 169
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 1105 place count 79 transition count 161
Discarding 15 places :
Symmetric choice reduction at 8 with 15 rule applications. Total rules 1120 place count 64 transition count 109
Iterating global reduction 8 with 15 rules applied. Total rules applied 1135 place count 64 transition count 109
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 1145 place count 64 transition count 99
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 1152 place count 57 transition count 92
Iterating global reduction 9 with 7 rules applied. Total rules applied 1159 place count 57 transition count 92
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 1165 place count 51 transition count 86
Iterating global reduction 9 with 6 rules applied. Total rules applied 1171 place count 51 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1174 place count 51 transition count 83
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 1182 place count 47 transition count 79
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 10 with 10 rules applied. Total rules applied 1192 place count 42 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 1193 place count 42 transition count 98
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 1195 place count 42 transition count 96
Free-agglomeration rule applied 16 times with reduction of 10 identical transitions.
Iterating global reduction 11 with 16 rules applied. Total rules applied 1211 place count 42 transition count 70
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 11 with 23 rules applied. Total rules applied 1234 place count 26 transition count 63
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1236 place count 24 transition count 61
Iterating global reduction 12 with 2 rules applied. Total rules applied 1238 place count 24 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 1239 place count 24 transition count 60
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1241 place count 23 transition count 75
Drop transitions removed 1 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 13 with 11 rules applied. Total rules applied 1252 place count 23 transition count 64
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 14 with 7 rules applied. Total rules applied 1259 place count 23 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 1260 place count 22 transition count 56
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 14 with 4 rules applied. Total rules applied 1264 place count 21 transition count 53
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 1267 place count 18 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 16 with 1 Pre rules applied. Total rules applied 1267 place count 18 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 1269 place count 17 transition count 52
Performed 6 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 16 with 13 rules applied. Total rules applied 1282 place count 10 transition count 25
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 16 with 11 rules applied. Total rules applied 1293 place count 10 transition count 14
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 17 with 2 rules applied. Total rules applied 1295 place count 9 transition count 13
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 1296 place count 9 transition count 12
Applied a total of 1296 rules in 124 ms. Remains 9 /660 variables (removed 651) and now considering 12/771 (removed 759) transitions.
Finished structural reductions, in 1 iterations. Remains : 9/660 places, 12/771 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=4 )
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
FORMULA StigmergyCommit-PT-02b-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 127 stabilizing places and 133 stable transitions
FORMULA StigmergyCommit-PT-02b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((X(G(p0))&&X(p1)))&&p2)))'
Support contains 4 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 771/771 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 648 transition count 759
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 648 transition count 759
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 638 transition count 749
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 638 transition count 749
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 638 transition count 747
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 632 transition count 741
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 632 transition count 741
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 626 transition count 735
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 626 transition count 735
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 621 transition count 730
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 621 transition count 730
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 616 transition count 725
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 616 transition count 725
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 611 transition count 720
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 611 transition count 720
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 611 transition count 719
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 609 transition count 717
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 609 transition count 717
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 607 transition count 715
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 607 transition count 715
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 605 transition count 713
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 605 transition count 713
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 603 transition count 711
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 603 transition count 711
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 601 transition count 709
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 601 transition count 709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 122 place count 601 transition count 708
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 600 transition count 707
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 600 transition count 707
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 599 transition count 706
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 599 transition count 706
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 598 transition count 705
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 598 transition count 705
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 597 transition count 704
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 597 transition count 704
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 596 transition count 703
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 596 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 596 transition count 702
Applied a total of 133 rules in 977 ms. Remains 596 /660 variables (removed 64) and now considering 702/771 (removed 69) transitions.
// Phase 1: matrix 702 rows 596 cols
[2022-06-09 09:43:55] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-09 09:43:55] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 702 rows 596 cols
[2022-06-09 09:43:55] [INFO ] Computed 4 place invariants in 9 ms
[2022-06-09 09:43:56] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 596 cols
[2022-06-09 09:43:56] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 09:43:56] [INFO ] Dead Transitions using invariants and state equation in 620 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/660 places, 702/771 transitions.
Finished structural reductions, in 1 iterations. Remains : 596/660 places, 702/771 transitions.
Stuttering acceptance computed with spot in 437 ms :[true, (OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=5, aps=[p2:(OR (EQ s405 0) (EQ s590 0)), p0:(EQ s546 0), p1:(EQ s474 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]]
Product exploration explored 100000 steps with 1641 reset in 504 ms.
Product exploration explored 100000 steps with 1273 reset in 350 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Detected a total of 123/596 stabilizing places and 129/702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 p0 p1), (X p2), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 294 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 162 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 702 rows 596 cols
[2022-06-09 09:43:58] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 09:43:58] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 09:43:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2022-06-09 09:43:59] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 09:43:59] [INFO ] After 359ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-09 09:43:59] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 30 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND p2 p0 p1), (X p2), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p0))), (F (OR (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 246 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 235 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 2 out of 596 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 596/596 places, 702/702 transitions.
Applied a total of 0 rules in 21 ms. Remains 596 /596 variables (removed 0) and now considering 702/702 (removed 0) transitions.
// Phase 1: matrix 702 rows 596 cols
[2022-06-09 09:44:00] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 09:44:00] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 702 rows 596 cols
[2022-06-09 09:44:00] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 09:44:00] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 596 cols
[2022-06-09 09:44:00] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-09 09:44:01] [INFO ] Dead Transitions using invariants and state equation in 757 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 596/596 places, 702/702 transitions.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Detected a total of 123/596 stabilizing places and 129/702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 50 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 702 rows 596 cols
[2022-06-09 09:44:02] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-09 09:44:02] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 09:44:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2022-06-09 09:44:02] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 09:44:02] [INFO ] After 343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-06-09 09:44:02] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 29 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p1 p0))), (F (OR (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1630 reset in 141 ms.
Product exploration explored 100000 steps with 1646 reset in 338 ms.
Applying partial POR strategy [true, true, true, false, false, false]
Stuttering acceptance computed with spot in 197 ms :[true, (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 2 out of 596 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 702/702 transitions.
Graph (trivial) has 591 edges and 596 vertex of which 51 / 596 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 408 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 408 rules applied. Total rules applied 409 place count 554 transition count 654
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 415 place count 554 transition count 648
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 23 Pre rules applied. Total rules applied 415 place count 554 transition count 651
Deduced a syphon composed of 431 places in 0 ms
Iterating global reduction 2 with 23 rules applied. Total rules applied 438 place count 554 transition count 651
Discarding 364 places :
Symmetric choice reduction at 2 with 364 rule applications. Total rules 802 place count 190 transition count 287
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 2 with 364 rules applied. Total rules applied 1166 place count 190 transition count 287
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 1200 place count 190 transition count 296
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 1255 place count 135 transition count 201
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 2 with 55 rules applied. Total rules applied 1310 place count 135 transition count 201
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 1323 place count 135 transition count 188
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 1347 place count 111 transition count 161
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 3 with 24 rules applied. Total rules applied 1371 place count 111 transition count 161
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1379 place count 103 transition count 153
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1387 place count 103 transition count 153
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1389 place count 103 transition count 151
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1394 place count 98 transition count 146
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 4 with 5 rules applied. Total rules applied 1399 place count 98 transition count 146
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -47
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1406 place count 98 transition count 193
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1415 place count 89 transition count 174
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 1424 place count 89 transition count 174
Deduced a syphon composed of 44 places in 0 ms
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 1430 place count 89 transition count 168
Deduced a syphon composed of 44 places in 0 ms
Applied a total of 1430 rules in 118 ms. Remains 89 /596 variables (removed 507) and now considering 168/702 (removed 534) transitions.
[2022-06-09 09:44:04] [INFO ] Redundant transitions in 6 ms returned []
[2022-06-09 09:44:04] [INFO ] Flow matrix only has 164 transitions (discarded 4 similar events)
// Phase 1: matrix 164 rows 89 cols
[2022-06-09 09:44:04] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 09:44:04] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/596 places, 168/702 transitions.
Finished structural reductions, in 1 iterations. Remains : 89/596 places, 168/702 transitions.
Entered a terminal (fully accepting) state of product in 143 steps with 13 reset in 4 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-00 finished in 10354 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||(X(p1)&&X(G(p2))))))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 771/771 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 648 transition count 759
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 648 transition count 759
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 638 transition count 749
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 638 transition count 749
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 638 transition count 747
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 632 transition count 741
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 632 transition count 741
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 626 transition count 735
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 626 transition count 735
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 621 transition count 730
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 621 transition count 730
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 616 transition count 725
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 616 transition count 725
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 611 transition count 720
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 611 transition count 720
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 611 transition count 719
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 609 transition count 717
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 609 transition count 717
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 607 transition count 715
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 607 transition count 715
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 605 transition count 713
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 605 transition count 713
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 603 transition count 711
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 603 transition count 711
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 601 transition count 709
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 601 transition count 709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 122 place count 601 transition count 708
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 600 transition count 707
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 600 transition count 707
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 599 transition count 706
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 599 transition count 706
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 598 transition count 705
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 598 transition count 705
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 597 transition count 704
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 597 transition count 704
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 596 transition count 703
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 596 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 596 transition count 702
Applied a total of 133 rules in 645 ms. Remains 596 /660 variables (removed 64) and now considering 702/771 (removed 69) transitions.
// Phase 1: matrix 702 rows 596 cols
[2022-06-09 09:44:05] [INFO ] Computed 4 place invariants in 6 ms
[2022-06-09 09:44:05] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 702 rows 596 cols
[2022-06-09 09:44:05] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-09 09:44:06] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 596 cols
[2022-06-09 09:44:06] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-09 09:44:06] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/660 places, 702/771 transitions.
Finished structural reductions, in 1 iterations. Remains : 596/660 places, 702/771 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s559 1) (EQ s595 1)), p2:(EQ s330 1), p1:(EQ s330 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-01 finished in 2309 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(G(X(G(p0))))||p1))&&F(G(p2))))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 771/771 transitions.
Graph (trivial) has 653 edges and 660 vertex of which 51 / 660 are part of one of the 9 SCC in 2 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 452 transitions
Trivial Post-agglo rules discarded 452 transitions
Performed 452 trivial Post agglomeration. Transition count delta: 452
Iterating post reduction 0 with 452 rules applied. Total rules applied 453 place count 617 transition count 270
Reduce places removed 452 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 462 rules applied. Total rules applied 915 place count 165 transition count 260
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 920 place count 161 transition count 259
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 921 place count 160 transition count 259
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 921 place count 160 transition count 224
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 991 place count 125 transition count 224
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1000 place count 116 transition count 215
Iterating global reduction 4 with 9 rules applied. Total rules applied 1009 place count 116 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1009 place count 116 transition count 214
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1011 place count 115 transition count 214
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1016 place count 110 transition count 209
Iterating global reduction 4 with 5 rules applied. Total rules applied 1021 place count 110 transition count 209
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1023 place count 108 transition count 207
Iterating global reduction 4 with 2 rules applied. Total rules applied 1025 place count 108 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1026 place count 108 transition count 206
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1027 place count 107 transition count 205
Iterating global reduction 5 with 1 rules applied. Total rules applied 1028 place count 107 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1029 place count 107 transition count 204
Performed 21 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 1071 place count 86 transition count 180
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1086 place count 71 transition count 130
Iterating global reduction 6 with 15 rules applied. Total rules applied 1101 place count 71 transition count 130
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1109 place count 71 transition count 122
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1118 place count 62 transition count 110
Iterating global reduction 7 with 9 rules applied. Total rules applied 1127 place count 62 transition count 110
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1136 place count 53 transition count 98
Iterating global reduction 7 with 9 rules applied. Total rules applied 1145 place count 53 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1147 place count 53 transition count 96
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 1161 place count 46 transition count 108
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1162 place count 45 transition count 102
Iterating global reduction 8 with 1 rules applied. Total rules applied 1163 place count 45 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1164 place count 45 transition count 101
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1167 place count 45 transition count 98
Applied a total of 1167 rules in 59 ms. Remains 45 /660 variables (removed 615) and now considering 98/771 (removed 673) transitions.
[2022-06-09 09:44:07] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
// Phase 1: matrix 94 rows 45 cols
[2022-06-09 09:44:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:44:07] [INFO ] Implicit Places using invariants in 41 ms returned []
[2022-06-09 09:44:07] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
// Phase 1: matrix 94 rows 45 cols
[2022-06-09 09:44:07] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 09:44:07] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-06-09 09:44:07] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2022-06-09 09:44:07] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-09 09:44:07] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
// Phase 1: matrix 94 rows 45 cols
[2022-06-09 09:44:07] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 09:44:07] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/660 places, 98/771 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/660 places, 98/771 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s34 1), p1:(EQ s19 1), p0:(EQ s27 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-02 finished in 474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p1))&&p0)))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 771/771 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 648 transition count 759
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 648 transition count 759
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 638 transition count 749
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 638 transition count 749
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 638 transition count 747
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 632 transition count 741
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 632 transition count 741
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 626 transition count 735
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 626 transition count 735
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 621 transition count 730
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 621 transition count 730
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 84 place count 617 transition count 726
Iterating global reduction 1 with 4 rules applied. Total rules applied 88 place count 617 transition count 726
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 92 place count 613 transition count 722
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 613 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 97 place count 613 transition count 721
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 612 transition count 720
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 612 transition count 720
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 611 transition count 719
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 611 transition count 719
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 102 place count 610 transition count 718
Iterating global reduction 2 with 1 rules applied. Total rules applied 103 place count 610 transition count 718
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 104 place count 609 transition count 717
Iterating global reduction 2 with 1 rules applied. Total rules applied 105 place count 609 transition count 717
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 608 transition count 716
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 608 transition count 716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 607 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 607 transition count 715
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 606 transition count 714
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 606 transition count 714
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 605 transition count 713
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 605 transition count 713
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 604 transition count 712
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 604 transition count 712
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 603 transition count 711
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 603 transition count 711
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 603 transition count 710
Applied a total of 118 rules in 306 ms. Remains 603 /660 variables (removed 57) and now considering 710/771 (removed 61) transitions.
// Phase 1: matrix 710 rows 603 cols
[2022-06-09 09:44:07] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 09:44:08] [INFO ] Implicit Places using invariants in 171 ms returned []
// Phase 1: matrix 710 rows 603 cols
[2022-06-09 09:44:08] [INFO ] Computed 4 place invariants in 10 ms
[2022-06-09 09:44:08] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
// Phase 1: matrix 710 rows 603 cols
[2022-06-09 09:44:08] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-09 09:44:09] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 603/660 places, 710/771 transitions.
Finished structural reductions, in 1 iterations. Remains : 603/660 places, 710/771 transitions.
Stuttering acceptance computed with spot in 74 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s153 1) (EQ s602 1)), p1:(AND (EQ s383 1) (EQ s602 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 49 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-03 finished in 1814 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 771/771 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 648 transition count 759
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 648 transition count 759
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 638 transition count 749
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 638 transition count 749
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 638 transition count 747
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 632 transition count 741
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 632 transition count 741
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 626 transition count 735
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 626 transition count 735
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 621 transition count 730
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 621 transition count 730
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 616 transition count 725
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 616 transition count 725
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 611 transition count 720
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 611 transition count 720
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 611 transition count 719
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 609 transition count 717
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 609 transition count 717
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 607 transition count 715
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 607 transition count 715
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 605 transition count 713
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 605 transition count 713
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 603 transition count 711
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 603 transition count 711
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 601 transition count 709
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 601 transition count 709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 122 place count 601 transition count 708
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 600 transition count 707
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 600 transition count 707
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 599 transition count 706
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 599 transition count 706
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 598 transition count 705
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 598 transition count 705
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 597 transition count 704
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 597 transition count 704
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 596 transition count 703
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 596 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 596 transition count 702
Applied a total of 133 rules in 308 ms. Remains 596 /660 variables (removed 64) and now considering 702/771 (removed 69) transitions.
// Phase 1: matrix 702 rows 596 cols
[2022-06-09 09:44:09] [INFO ] Computed 4 place invariants in 11 ms
[2022-06-09 09:44:09] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 702 rows 596 cols
[2022-06-09 09:44:09] [INFO ] Computed 4 place invariants in 11 ms
[2022-06-09 09:44:10] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 768 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 596 cols
[2022-06-09 09:44:10] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 09:44:11] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/660 places, 702/771 transitions.
Finished structural reductions, in 1 iterations. Remains : 596/660 places, 702/771 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s211 0)], 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]]
Product exploration explored 100000 steps with 50000 reset in 773 ms.
Product exploration explored 100000 steps with 50000 reset in 792 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyCommit-PT-02b-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-02b-LTLFireability-04 finished in 3554 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 771/771 transitions.
Graph (trivial) has 657 edges and 660 vertex of which 44 / 660 are part of one of the 8 SCC in 1 ms
Free SCC test removed 36 places
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 461 transitions
Trivial Post-agglo rules discarded 461 transitions
Performed 461 trivial Post agglomeration. Transition count delta: 461
Iterating post reduction 0 with 461 rules applied. Total rules applied 462 place count 623 transition count 268
Reduce places removed 461 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 474 rules applied. Total rules applied 936 place count 162 transition count 255
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 942 place count 156 transition count 255
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 942 place count 156 transition count 220
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 1012 place count 121 transition count 220
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1021 place count 112 transition count 211
Iterating global reduction 3 with 9 rules applied. Total rules applied 1030 place count 112 transition count 211
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1030 place count 112 transition count 210
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1032 place count 111 transition count 210
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1037 place count 106 transition count 205
Iterating global reduction 3 with 5 rules applied. Total rules applied 1042 place count 106 transition count 205
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1044 place count 104 transition count 203
Iterating global reduction 3 with 2 rules applied. Total rules applied 1046 place count 104 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1047 place count 104 transition count 202
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1048 place count 103 transition count 201
Iterating global reduction 4 with 1 rules applied. Total rules applied 1049 place count 103 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1050 place count 103 transition count 200
Performed 21 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 1092 place count 82 transition count 176
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 1106 place count 68 transition count 128
Iterating global reduction 5 with 14 rules applied. Total rules applied 1120 place count 68 transition count 128
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1129 place count 68 transition count 119
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1137 place count 60 transition count 109
Iterating global reduction 6 with 8 rules applied. Total rules applied 1145 place count 60 transition count 109
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 1153 place count 52 transition count 99
Iterating global reduction 6 with 8 rules applied. Total rules applied 1161 place count 52 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 1164 place count 52 transition count 96
Performed 9 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 1182 place count 43 transition count 104
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1183 place count 42 transition count 96
Iterating global reduction 7 with 1 rules applied. Total rules applied 1184 place count 42 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1185 place count 42 transition count 95
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 1188 place count 42 transition count 92
Applied a total of 1188 rules in 40 ms. Remains 42 /660 variables (removed 618) and now considering 92/771 (removed 679) transitions.
[2022-06-09 09:44:12] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
// Phase 1: matrix 88 rows 42 cols
[2022-06-09 09:44:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:44:12] [INFO ] Implicit Places using invariants in 41 ms returned []
[2022-06-09 09:44:12] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
// Phase 1: matrix 88 rows 42 cols
[2022-06-09 09:44:13] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 09:44:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-06-09 09:44:13] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2022-06-09 09:44:13] [INFO ] Redundant transitions in 2 ms returned []
[2022-06-09 09:44:13] [INFO ] Flow matrix only has 88 transitions (discarded 4 similar events)
// Phase 1: matrix 88 rows 42 cols
[2022-06-09 09:44:13] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 09:44:13] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/660 places, 92/771 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/660 places, 92/771 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-05 finished in 287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||X(p1)))'
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 771/771 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 650 transition count 761
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 650 transition count 761
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 642 transition count 753
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 642 transition count 753
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 642 transition count 751
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 638 transition count 747
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 638 transition count 747
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 634 transition count 743
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 634 transition count 743
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 631 transition count 740
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 631 transition count 740
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 63 place count 628 transition count 737
Iterating global reduction 1 with 3 rules applied. Total rules applied 66 place count 628 transition count 737
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 625 transition count 734
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 625 transition count 734
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 625 transition count 733
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 624 transition count 732
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 624 transition count 732
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 623 transition count 731
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 623 transition count 731
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 622 transition count 730
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 622 transition count 730
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 621 transition count 729
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 621 transition count 729
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 620 transition count 728
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 620 transition count 728
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 619 transition count 727
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 619 transition count 727
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 618 transition count 726
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 618 transition count 726
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 617 transition count 725
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 617 transition count 725
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 616 transition count 724
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 616 transition count 724
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 615 transition count 723
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 615 transition count 723
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 615 transition count 722
Applied a total of 94 rules in 288 ms. Remains 615 /660 variables (removed 45) and now considering 722/771 (removed 49) transitions.
// Phase 1: matrix 722 rows 615 cols
[2022-06-09 09:44:13] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 09:44:13] [INFO ] Implicit Places using invariants in 162 ms returned []
// Phase 1: matrix 722 rows 615 cols
[2022-06-09 09:44:13] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 09:44:14] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
// Phase 1: matrix 722 rows 615 cols
[2022-06-09 09:44:14] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 09:44:14] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 615/660 places, 722/771 transitions.
Finished structural reductions, in 1 iterations. Remains : 615/660 places, 722/771 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-07 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:(EQ s153 0), p1:(EQ s522 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]]
Product exploration explored 100000 steps with 50000 reset in 703 ms.
Product exploration explored 100000 steps with 50000 reset in 833 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X p0)), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0)))
Knowledge based reduction with 5 factoid took 98 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA StigmergyCommit-PT-02b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-02b-LTLFireability-07 finished in 3397 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||(G(p1) U X(p2))||G(p3)))'
Support contains 4 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 771/771 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 650 transition count 761
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 650 transition count 761
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 30 place count 640 transition count 751
Iterating global reduction 0 with 10 rules applied. Total rules applied 40 place count 640 transition count 751
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 640 transition count 749
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 634 transition count 743
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 634 transition count 743
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 628 transition count 737
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 628 transition count 737
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 623 transition count 732
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 623 transition count 732
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 618 transition count 727
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 618 transition count 727
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 613 transition count 722
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 613 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 97 place count 613 transition count 721
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 611 transition count 719
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 611 transition count 719
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 609 transition count 717
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 609 transition count 717
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 607 transition count 715
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 607 transition count 715
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 605 transition count 713
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 605 transition count 713
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 603 transition count 711
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 603 transition count 711
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 603 transition count 710
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 602 transition count 709
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 602 transition count 709
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 121 place count 601 transition count 708
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 601 transition count 708
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 600 transition count 707
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 600 transition count 707
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 599 transition count 706
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 599 transition count 706
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 598 transition count 705
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 598 transition count 705
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 129 place count 598 transition count 704
Applied a total of 129 rules in 331 ms. Remains 598 /660 variables (removed 62) and now considering 704/771 (removed 67) transitions.
// Phase 1: matrix 704 rows 598 cols
[2022-06-09 09:44:16] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 09:44:17] [INFO ] Implicit Places using invariants in 172 ms returned []
// Phase 1: matrix 704 rows 598 cols
[2022-06-09 09:44:17] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 09:44:17] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
// Phase 1: matrix 704 rows 598 cols
[2022-06-09 09:44:17] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 09:44:18] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 598/660 places, 704/771 transitions.
Finished structural reductions, in 1 iterations. Remains : 598/660 places, 704/771 transitions.
Stuttering acceptance computed with spot in 626 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND p1 p3), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p3 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 7}], [{ cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p3 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p3 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND p1 p3 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p3 (NOT p0)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=8 dest: 6}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND p1 p3 (NOT p0)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(EQ s414 1), p3:(EQ s325 0), p2:(EQ s235 1), p0:(EQ s197 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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1640 reset in 156 ms.
Product exploration explored 100000 steps with 1625 reset in 161 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND p1 p3 (NOT p2) (NOT p0)))), (X (AND (NOT p1) p3 (NOT p2) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (AND p3 (NOT p2) (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p3 (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p3 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p3 (NOT p0)))), (X (X (AND p3 (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 25 factoid took 1278 ms. Reduced automaton from 9 states, 25 edges and 4 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 162 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 851137 steps, run timeout after 3001 ms. (steps per millisecond=283 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 851137 steps, saw 189377 distinct states, run finished after 3002 ms. (steps per millisecond=283 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 704 rows 598 cols
[2022-06-09 09:44:24] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 09:44:24] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 09:44:24] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2022-06-09 09:44:24] [INFO ] After 462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 09:44:25] [INFO ] Deduced a trap composed of 300 places in 214 ms of which 1 ms to minimize.
[2022-06-09 09:44:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2022-06-09 09:44:25] [INFO ] After 791ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-06-09 09:44:25] [INFO ] After 982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 598/598 places, 704/704 transitions.
Graph (trivial) has 593 edges and 598 vertex of which 51 / 598 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 825 edges and 556 vertex of which 553 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 414 transitions
Trivial Post-agglo rules discarded 414 transitions
Performed 414 trivial Post agglomeration. Transition count delta: 414
Iterating post reduction 0 with 417 rules applied. Total rules applied 419 place count 553 transition count 230
Reduce places removed 414 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 421 rules applied. Total rules applied 840 place count 139 transition count 223
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 843 place count 137 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 844 place count 136 transition count 222
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 844 place count 136 transition count 189
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 910 place count 103 transition count 189
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 911 place count 102 transition count 188
Iterating global reduction 4 with 1 rules applied. Total rules applied 912 place count 102 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 912 place count 102 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 914 place count 101 transition count 187
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 915 place count 101 transition count 186
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 959 place count 79 transition count 164
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 965 place count 79 transition count 158
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 984 place count 60 transition count 102
Iterating global reduction 6 with 19 rules applied. Total rules applied 1003 place count 60 transition count 102
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1012 place count 60 transition count 93
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1020 place count 52 transition count 85
Iterating global reduction 7 with 8 rules applied. Total rules applied 1028 place count 52 transition count 85
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1034 place count 46 transition count 79
Iterating global reduction 7 with 6 rules applied. Total rules applied 1040 place count 46 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1043 place count 46 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1049 place count 43 transition count 73
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1057 place count 39 transition count 93
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1058 place count 39 transition count 92
Free-agglomeration rule applied 17 times with reduction of 7 identical transitions.
Iterating global reduction 8 with 17 rules applied. Total rules applied 1075 place count 39 transition count 68
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 29 rules applied. Total rules applied 1104 place count 22 transition count 56
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1107 place count 19 transition count 53
Iterating global reduction 9 with 3 rules applied. Total rules applied 1110 place count 19 transition count 53
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1113 place count 19 transition count 50
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 10 with 13 rules applied. Total rules applied 1126 place count 19 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1127 place count 19 transition count 37
Applied a total of 1127 rules in 39 ms. Remains 19 /598 variables (removed 579) and now considering 37/704 (removed 667) transitions.
Finished structural reductions, in 1 iterations. Remains : 19/598 places, 37/704 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) p3 (NOT p2) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0)))), (X (NOT (AND p1 p3 (NOT p2) (NOT p0)))), (X (AND (NOT p1) p3 (NOT p2) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0)))), (X (AND p3 (NOT p2) (NOT p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p3 (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 p3 (NOT p0))))), (X (X (NOT (AND p1 (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p3 (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p3 (NOT p0)))), (X (X (AND p3 (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p3))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 25 factoid took 972 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 2 out of 598 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 704/704 transitions.
Applied a total of 0 rules in 16 ms. Remains 598 /598 variables (removed 0) and now considering 704/704 (removed 0) transitions.
// Phase 1: matrix 704 rows 598 cols
[2022-06-09 09:44:26] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-09 09:44:26] [INFO ] Implicit Places using invariants in 229 ms returned []
// Phase 1: matrix 704 rows 598 cols
[2022-06-09 09:44:26] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 09:44:27] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
// Phase 1: matrix 704 rows 598 cols
[2022-06-09 09:44:27] [INFO ] Computed 4 place invariants in 6 ms
[2022-06-09 09:44:28] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 598/598 places, 704/704 transitions.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND (NOT p0) p3), (X (AND (NOT p0) p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 326 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Incomplete random walk after 10000 steps, including 162 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 923095 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 923095 steps, saw 204867 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 704 rows 598 cols
[2022-06-09 09:44:32] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 09:44:32] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 09:44:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 6 ms returned sat
[2022-06-09 09:44:32] [INFO ] After 325ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 09:44:32] [INFO ] Deduced a trap composed of 300 places in 201 ms of which 0 ms to minimize.
[2022-06-09 09:44:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2022-06-09 09:44:32] [INFO ] After 608ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-06-09 09:44:32] [INFO ] After 770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 598/598 places, 704/704 transitions.
Graph (trivial) has 593 edges and 598 vertex of which 51 / 598 are part of one of the 9 SCC in 2 ms
Free SCC test removed 42 places
Drop transitions removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 825 edges and 556 vertex of which 553 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 414 transitions
Trivial Post-agglo rules discarded 414 transitions
Performed 414 trivial Post agglomeration. Transition count delta: 414
Iterating post reduction 0 with 417 rules applied. Total rules applied 419 place count 553 transition count 230
Reduce places removed 414 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 421 rules applied. Total rules applied 840 place count 139 transition count 223
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 843 place count 137 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 844 place count 136 transition count 222
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 844 place count 136 transition count 189
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 4 with 66 rules applied. Total rules applied 910 place count 103 transition count 189
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 911 place count 102 transition count 188
Iterating global reduction 4 with 1 rules applied. Total rules applied 912 place count 102 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 912 place count 102 transition count 187
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 914 place count 101 transition count 187
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 915 place count 101 transition count 186
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 959 place count 79 transition count 164
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 965 place count 79 transition count 158
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 984 place count 60 transition count 102
Iterating global reduction 6 with 19 rules applied. Total rules applied 1003 place count 60 transition count 102
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 1012 place count 60 transition count 93
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1020 place count 52 transition count 85
Iterating global reduction 7 with 8 rules applied. Total rules applied 1028 place count 52 transition count 85
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 1034 place count 46 transition count 79
Iterating global reduction 7 with 6 rules applied. Total rules applied 1040 place count 46 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1043 place count 46 transition count 76
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1049 place count 43 transition count 73
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1057 place count 39 transition count 93
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1058 place count 39 transition count 92
Free-agglomeration rule applied 17 times with reduction of 7 identical transitions.
Iterating global reduction 8 with 17 rules applied. Total rules applied 1075 place count 39 transition count 68
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 29 rules applied. Total rules applied 1104 place count 22 transition count 56
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 1107 place count 19 transition count 53
Iterating global reduction 9 with 3 rules applied. Total rules applied 1110 place count 19 transition count 53
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 1113 place count 19 transition count 50
Drop transitions removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 10 with 13 rules applied. Total rules applied 1126 place count 19 transition count 37
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1127 place count 19 transition count 37
Applied a total of 1127 rules in 50 ms. Remains 19 /598 variables (removed 579) and now considering 37/704 (removed 667) transitions.
Finished structural reductions, in 1 iterations. Remains : 19/598 places, 37/704 transitions.
Finished random walk after 78 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=78 )
Knowledge obtained : [(AND (NOT p0) p3), (X (AND (NOT p0) p3)), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT p0))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p3))), (F (AND (NOT p0) (NOT p3)))]
Knowledge based reduction with 6 factoid took 278 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Product exploration explored 100000 steps with 1611 reset in 217 ms.
Product exploration explored 100000 steps with 1643 reset in 239 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 598/598 places, 704/704 transitions.
Graph (trivial) has 593 edges and 598 vertex of which 51 / 598 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 409 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 409 rules applied. Total rules applied 410 place count 556 transition count 656
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 415 place count 556 transition count 651
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 415 place count 556 transition count 655
Deduced a syphon composed of 433 places in 1 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 439 place count 556 transition count 655
Discarding 366 places :
Symmetric choice reduction at 2 with 366 rule applications. Total rules 805 place count 190 transition count 289
Deduced a syphon composed of 70 places in 0 ms
Iterating global reduction 2 with 366 rules applied. Total rules applied 1171 place count 190 transition count 289
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 103 places in 1 ms
Iterating global reduction 2 with 33 rules applied. Total rules applied 1204 place count 190 transition count 298
Discarding 55 places :
Symmetric choice reduction at 2 with 55 rule applications. Total rules 1259 place count 135 transition count 203
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 2 with 55 rules applied. Total rules applied 1314 place count 135 transition count 203
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 1325 place count 135 transition count 192
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1351 place count 109 transition count 162
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 3 with 26 rules applied. Total rules applied 1377 place count 109 transition count 162
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1385 place count 101 transition count 154
Deduced a syphon composed of 50 places in 0 ms
Iterating global reduction 3 with 8 rules applied. Total rules applied 1393 place count 101 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 1396 place count 101 transition count 151
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 1402 place count 95 transition count 145
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 4 with 6 rules applied. Total rules applied 1408 place count 95 transition count 145
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 1415 place count 95 transition count 185
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1424 place count 86 transition count 167
Deduced a syphon composed of 42 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 1433 place count 86 transition count 167
Deduced a syphon composed of 42 places in 0 ms
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 1441 place count 86 transition count 159
Deduced a syphon composed of 42 places in 0 ms
Applied a total of 1441 rules in 77 ms. Remains 86 /598 variables (removed 512) and now considering 159/704 (removed 545) transitions.
[2022-06-09 09:44:34] [INFO ] Redundant transitions in 10 ms returned []
[2022-06-09 09:44:34] [INFO ] Flow matrix only has 155 transitions (discarded 4 similar events)
// Phase 1: matrix 155 rows 86 cols
[2022-06-09 09:44:34] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 09:44:34] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/598 places, 159/704 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/598 places, 159/704 transitions.
Product exploration explored 100000 steps with 149 reset in 199 ms.
Product exploration explored 100000 steps with 507 reset in 210 ms.
Built C files in :
/tmp/ltsmin10012353666511810549
[2022-06-09 09:44:35] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10012353666511810549
Running compilation step : cd /tmp/ltsmin10012353666511810549;'/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 2396 ms.
Running link step : cd /tmp/ltsmin10012353666511810549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin10012353666511810549;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15116419004011576428.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 598 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 598/598 places, 704/704 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 597 transition count 703
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 597 transition count 703
Applied a total of 2 rules in 33 ms. Remains 597 /598 variables (removed 1) and now considering 703/704 (removed 1) transitions.
// Phase 1: matrix 703 rows 597 cols
[2022-06-09 09:44:50] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 09:44:50] [INFO ] Implicit Places using invariants in 222 ms returned []
// Phase 1: matrix 703 rows 597 cols
[2022-06-09 09:44:50] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 09:44:51] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
// Phase 1: matrix 703 rows 597 cols
[2022-06-09 09:44:51] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 09:44:51] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 597/598 places, 703/704 transitions.
Finished structural reductions, in 1 iterations. Remains : 597/598 places, 703/704 transitions.
Built C files in :
/tmp/ltsmin12260942756842642215
[2022-06-09 09:44:51] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12260942756842642215
Running compilation step : cd /tmp/ltsmin12260942756842642215;'/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 1588 ms.
Running link step : cd /tmp/ltsmin12260942756842642215;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin12260942756842642215;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15277960299299460230.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-09 09:45:07] [INFO ] Flatten gal took : 51 ms
[2022-06-09 09:45:07] [INFO ] Flatten gal took : 47 ms
[2022-06-09 09:45:07] [INFO ] Time to serialize gal into /tmp/LTL13198928953013181454.gal : 9 ms
[2022-06-09 09:45:07] [INFO ] Time to serialize properties into /tmp/LTL12679377717345208813.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13198928953013181454.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12679377717345208813.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1319892...268
Read 1 LTL properties
Checking formula 0 : !((((F(X("(p306==1)")))||((G("(p636==1)"))U(X("(p349==1)"))))||(G("(p457==0)"))))
Formula 0 simplified : !(FX"(p306==1)" | (G"(p636==1)" U X"(p349==1)") | G"(p457==0)")
Detected timeout of ITS tools.
[2022-06-09 09:45:22] [INFO ] Flatten gal took : 41 ms
[2022-06-09 09:45:22] [INFO ] Applying decomposition
[2022-06-09 09:45:22] [INFO ] Flatten gal took : 38 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/graph15362456233475579499.txt' '-o' '/tmp/graph15362456233475579499.bin' '-w' '/tmp/graph15362456233475579499.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15362456233475579499.bin' '-l' '-1' '-v' '-w' '/tmp/graph15362456233475579499.weights' '-q' '0' '-e' '0.001'
[2022-06-09 09:45:22] [INFO ] Decomposing Gal with order
[2022-06-09 09:45:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 09:45:22] [INFO ] Removed a total of 380 redundant transitions.
[2022-06-09 09:45:22] [INFO ] Flatten gal took : 197 ms
[2022-06-09 09:45:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 30 ms.
[2022-06-09 09:45:22] [INFO ] Time to serialize gal into /tmp/LTL10686470531598656096.gal : 20 ms
[2022-06-09 09:45:22] [INFO ] Time to serialize properties into /tmp/LTL2453160468310998742.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10686470531598656096.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2453160468310998742.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1068647...246
Read 1 LTL properties
Checking formula 0 : !((((F(X("(i9.u80.p306==1)")))||((G("(i18.u160.p636==1)"))U(X("(i26.u91.p349==1)"))))||(G("(i14.u128.p457==0)"))))
Formula 0 simplified : !(FX"(i9.u80.p306==1)" | (G"(i18.u160.p636==1)" U X"(i26.u91.p349==1)") | G"(i14.u128.p457==0)")
Reverse transition relation is NOT exact ! Due to transitions t70, t119, t176, t356, t414, t450, t489, t547, t619, t620, t626, t629, t634, t637, t642, t643...498
Computing Next relation with stutter on 6260 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
693 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,7.01914,164568,1,0,283586,459,7509,667371,282,1074,891044
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA StigmergyCommit-PT-02b-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property StigmergyCommit-PT-02b-LTLFireability-08 finished in 74121 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(p0)) U p1)))'
Support contains 2 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 771/771 transitions.
Graph (trivial) has 655 edges and 660 vertex of which 51 / 660 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 455 transitions
Trivial Post-agglo rules discarded 455 transitions
Performed 455 trivial Post agglomeration. Transition count delta: 455
Iterating post reduction 0 with 455 rules applied. Total rules applied 456 place count 617 transition count 267
Reduce places removed 455 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 463 rules applied. Total rules applied 919 place count 162 transition count 259
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 923 place count 159 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 924 place count 158 transition count 258
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 924 place count 158 transition count 223
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 994 place count 123 transition count 223
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1003 place count 114 transition count 214
Iterating global reduction 4 with 9 rules applied. Total rules applied 1012 place count 114 transition count 214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1012 place count 114 transition count 213
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1014 place count 113 transition count 213
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1019 place count 108 transition count 208
Iterating global reduction 4 with 5 rules applied. Total rules applied 1024 place count 108 transition count 208
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1026 place count 106 transition count 206
Iterating global reduction 4 with 2 rules applied. Total rules applied 1028 place count 106 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1029 place count 106 transition count 205
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1030 place count 105 transition count 204
Iterating global reduction 5 with 1 rules applied. Total rules applied 1031 place count 105 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1032 place count 105 transition count 203
Performed 21 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 1074 place count 84 transition count 179
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1089 place count 69 transition count 129
Iterating global reduction 6 with 15 rules applied. Total rules applied 1104 place count 69 transition count 129
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1112 place count 69 transition count 121
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1121 place count 60 transition count 109
Iterating global reduction 7 with 9 rules applied. Total rules applied 1130 place count 60 transition count 109
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1138 place count 52 transition count 99
Iterating global reduction 7 with 8 rules applied. Total rules applied 1146 place count 52 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1149 place count 52 transition count 96
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 1163 place count 45 transition count 107
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1164 place count 44 transition count 100
Iterating global reduction 8 with 1 rules applied. Total rules applied 1165 place count 44 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1166 place count 44 transition count 99
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1171 place count 44 transition count 94
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 1172 place count 44 transition count 94
Applied a total of 1172 rules in 39 ms. Remains 44 /660 variables (removed 616) and now considering 94/771 (removed 677) transitions.
[2022-06-09 09:45:30] [INFO ] Flow matrix only has 90 transitions (discarded 4 similar events)
// Phase 1: matrix 90 rows 44 cols
[2022-06-09 09:45:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:45:30] [INFO ] Implicit Places using invariants in 55 ms returned []
[2022-06-09 09:45:30] [INFO ] Flow matrix only has 90 transitions (discarded 4 similar events)
// Phase 1: matrix 90 rows 44 cols
[2022-06-09 09:45:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:45:30] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-06-09 09:45:30] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2022-06-09 09:45:30] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 09:45:30] [INFO ] Flow matrix only has 90 transitions (discarded 4 similar events)
// Phase 1: matrix 90 rows 44 cols
[2022-06-09 09:45:30] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 09:45:30] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/660 places, 94/771 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/660 places, 94/771 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s33 1), p0:(EQ s3 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]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-09 finished in 426 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (!(p1 U X(G(p1))) U p2))))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 771/771 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 649 transition count 760
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 649 transition count 760
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 640 transition count 751
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 640 transition count 751
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 640 transition count 749
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 635 transition count 744
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 635 transition count 744
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 57 place count 630 transition count 739
Iterating global reduction 1 with 5 rules applied. Total rules applied 62 place count 630 transition count 739
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 66 place count 626 transition count 735
Iterating global reduction 1 with 4 rules applied. Total rules applied 70 place count 626 transition count 735
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 74 place count 622 transition count 731
Iterating global reduction 1 with 4 rules applied. Total rules applied 78 place count 622 transition count 731
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 618 transition count 727
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 618 transition count 727
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 88 place count 616 transition count 725
Iterating global reduction 1 with 2 rules applied. Total rules applied 90 place count 616 transition count 725
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 92 place count 614 transition count 723
Iterating global reduction 1 with 2 rules applied. Total rules applied 94 place count 614 transition count 723
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 612 transition count 721
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 612 transition count 721
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 100 place count 610 transition count 719
Iterating global reduction 1 with 2 rules applied. Total rules applied 102 place count 610 transition count 719
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 104 place count 608 transition count 717
Iterating global reduction 1 with 2 rules applied. Total rules applied 106 place count 608 transition count 717
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 107 place count 608 transition count 716
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 607 transition count 715
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 607 transition count 715
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 606 transition count 714
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 606 transition count 714
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 605 transition count 713
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 605 transition count 713
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 604 transition count 712
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 604 transition count 712
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 603 transition count 711
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 603 transition count 711
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 118 place count 603 transition count 710
Applied a total of 118 rules in 504 ms. Remains 603 /660 variables (removed 57) and now considering 710/771 (removed 61) transitions.
// Phase 1: matrix 710 rows 603 cols
[2022-06-09 09:45:31] [INFO ] Computed 4 place invariants in 8 ms
[2022-06-09 09:45:31] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 710 rows 603 cols
[2022-06-09 09:45:31] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 09:45:32] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 792 ms to find 0 implicit places.
// Phase 1: matrix 710 rows 603 cols
[2022-06-09 09:45:32] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-09 09:45:33] [INFO ] Dead Transitions using invariants and state equation in 742 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 603/660 places, 710/771 transitions.
Finished structural reductions, in 1 iterations. Remains : 603/660 places, 710/771 transitions.
Stuttering acceptance computed with spot in 345 ms :[(NOT p2), (NOT p2), p1, false, (NOT p2), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 6}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND p1 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s246 1), p0:(EQ s539 1), p1:(EQ s479 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25048 reset in 717 ms.
Product exploration explored 100000 steps with 25007 reset in 851 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 865 ms. Reduced automaton from 7 states, 19 edges and 3 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), p1, false, (NOT p2)]
Finished random walk after 1543 steps, including 25 resets, run visited all 4 properties in 12 ms. (steps per millisecond=128 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F p1), (F (AND (NOT p2) p1)), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 19 factoid took 1187 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), p1, false, (NOT p2)]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), p1, false, (NOT p2)]
// Phase 1: matrix 710 rows 603 cols
[2022-06-09 09:45:37] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-09 09:45:38] [INFO ] [Real]Absence check using 4 positive place invariants in 10 ms returned sat
[2022-06-09 09:45:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:45:39] [INFO ] [Real]Absence check using state equation in 799 ms returned sat
[2022-06-09 09:45:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:45:39] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2022-06-09 09:45:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:45:40] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2022-06-09 09:45:40] [INFO ] Computed and/alt/rep : 690/917/690 causal constraints (skipped 19 transitions) in 54 ms.
[2022-06-09 09:45:49] [INFO ] Added : 523 causal constraints over 105 iterations in 8413 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 2 out of 603 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 603/603 places, 710/710 transitions.
Applied a total of 0 rules in 27 ms. Remains 603 /603 variables (removed 0) and now considering 710/710 (removed 0) transitions.
// Phase 1: matrix 710 rows 603 cols
[2022-06-09 09:45:49] [INFO ] Computed 4 place invariants in 6 ms
[2022-06-09 09:45:49] [INFO ] Implicit Places using invariants in 269 ms returned []
// Phase 1: matrix 710 rows 603 cols
[2022-06-09 09:45:49] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-09 09:45:49] [INFO ] Implicit Places using invariants and state equation in 566 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
// Phase 1: matrix 710 rows 603 cols
[2022-06-09 09:45:50] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 09:45:50] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 603/603 places, 710/710 transitions.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 213 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (NOT p2), p1, false, (NOT p2)]
Finished random walk after 1438 steps, including 24 resets, run visited all 4 properties in 33 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p2)))]
False Knowledge obtained : [(F p2), (F p1), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 5 factoid took 408 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 5 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 246 ms :[(NOT p2), (NOT p2), p1, false, (NOT p2)]
Stuttering acceptance computed with spot in 246 ms :[(NOT p2), (NOT p2), p1, false, (NOT p2)]
// Phase 1: matrix 710 rows 603 cols
[2022-06-09 09:45:51] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-09 09:45:52] [INFO ] [Real]Absence check using 4 positive place invariants in 9 ms returned sat
[2022-06-09 09:45:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 09:45:53] [INFO ] [Real]Absence check using state equation in 821 ms returned sat
[2022-06-09 09:45:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 09:45:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2022-06-09 09:45:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 09:45:54] [INFO ] [Nat]Absence check using state equation in 619 ms returned sat
[2022-06-09 09:45:54] [INFO ] Computed and/alt/rep : 690/917/690 causal constraints (skipped 19 transitions) in 86 ms.
[2022-06-09 09:45:58] [INFO ] Added : 265 causal constraints over 53 iterations in 3965 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 264 ms :[(NOT p2), (NOT p2), p1, false, (NOT p2)]
Product exploration explored 100000 steps with 20032 reset in 462 ms.
Product exploration explored 100000 steps with 19945 reset in 388 ms.
Applying partial POR strategy [false, false, true, false, false]
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (NOT p2), p1, false, (NOT p2)]
Support contains 2 out of 603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 603/603 places, 710/710 transitions.
Graph (trivial) has 599 edges and 603 vertex of which 51 / 603 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Performed 414 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 414 rules applied. Total rules applied 415 place count 561 transition count 662
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 421 place count 561 transition count 656
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 421 place count 561 transition count 659
Deduced a syphon composed of 438 places in 0 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 445 place count 561 transition count 659
Discarding 369 places :
Symmetric choice reduction at 2 with 369 rule applications. Total rules 814 place count 192 transition count 290
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 2 with 369 rules applied. Total rules applied 1183 place count 192 transition count 290
Performed 34 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 1217 place count 192 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1218 place count 192 transition count 298
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 1275 place count 135 transition count 201
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 3 with 57 rules applied. Total rules applied 1332 place count 135 transition count 201
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1344 place count 135 transition count 189
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 1369 place count 110 transition count 161
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 4 with 25 rules applied. Total rules applied 1394 place count 110 transition count 161
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 1403 place count 101 transition count 152
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 1412 place count 101 transition count 152
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 1415 place count 101 transition count 149
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1421 place count 95 transition count 143
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 5 with 6 rules applied. Total rules applied 1427 place count 95 transition count 143
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1434 place count 95 transition count 181
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1443 place count 86 transition count 163
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 5 with 9 rules applied. Total rules applied 1452 place count 86 transition count 163
Deduced a syphon composed of 43 places in 0 ms
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 1458 place count 86 transition count 157
Deduced a syphon composed of 43 places in 0 ms
Applied a total of 1458 rules in 57 ms. Remains 86 /603 variables (removed 517) and now considering 157/710 (removed 553) transitions.
[2022-06-09 09:46:00] [INFO ] Redundant transitions in 1 ms returned []
[2022-06-09 09:46:00] [INFO ] Flow matrix only has 153 transitions (discarded 4 similar events)
// Phase 1: matrix 153 rows 86 cols
[2022-06-09 09:46:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:46:00] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/603 places, 157/710 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/603 places, 157/710 transitions.
Product exploration explored 100000 steps with 20029 reset in 823 ms.
Product exploration explored 100000 steps with 20021 reset in 736 ms.
Built C files in :
/tmp/ltsmin15406707205151681928
[2022-06-09 09:46:01] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15406707205151681928
Running compilation step : cd /tmp/ltsmin15406707205151681928;'/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 1855 ms.
Running link step : cd /tmp/ltsmin15406707205151681928;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15406707205151681928;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5872371908163760044.hoa' '--buchi-type=spotba'
LTSmin run took 167 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-02b-LTLFireability-11 finished in 32702 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0 U !G(!p1))))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 771/771 transitions.
Graph (trivial) has 655 edges and 660 vertex of which 51 / 660 are part of one of the 9 SCC in 0 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Drop transitions removed 455 transitions
Trivial Post-agglo rules discarded 455 transitions
Performed 455 trivial Post agglomeration. Transition count delta: 455
Iterating post reduction 0 with 455 rules applied. Total rules applied 456 place count 618 transition count 268
Reduce places removed 455 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 465 rules applied. Total rules applied 921 place count 163 transition count 258
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 925 place count 159 transition count 258
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 925 place count 159 transition count 223
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 995 place count 124 transition count 223
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 1003 place count 116 transition count 215
Iterating global reduction 3 with 8 rules applied. Total rules applied 1011 place count 116 transition count 215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1011 place count 116 transition count 214
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1013 place count 115 transition count 214
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 1017 place count 111 transition count 210
Iterating global reduction 3 with 4 rules applied. Total rules applied 1021 place count 111 transition count 210
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1022 place count 110 transition count 209
Iterating global reduction 3 with 1 rules applied. Total rules applied 1023 place count 110 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1024 place count 110 transition count 208
Performed 23 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1070 place count 87 transition count 183
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1086 place count 71 transition count 127
Iterating global reduction 4 with 16 rules applied. Total rules applied 1102 place count 71 transition count 127
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 1112 place count 71 transition count 117
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1121 place count 62 transition count 105
Iterating global reduction 5 with 9 rules applied. Total rules applied 1130 place count 62 transition count 105
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 1139 place count 53 transition count 96
Iterating global reduction 5 with 9 rules applied. Total rules applied 1148 place count 53 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 1151 place count 53 transition count 93
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1157 place count 50 transition count 90
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1163 place count 47 transition count 100
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1166 place count 47 transition count 97
Applied a total of 1166 rules in 22 ms. Remains 47 /660 variables (removed 613) and now considering 97/771 (removed 674) transitions.
[2022-06-09 09:46:03] [INFO ] Flow matrix only has 93 transitions (discarded 4 similar events)
// Phase 1: matrix 93 rows 47 cols
[2022-06-09 09:46:03] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 09:46:03] [INFO ] Implicit Places using invariants in 41 ms returned []
[2022-06-09 09:46:03] [INFO ] Flow matrix only has 93 transitions (discarded 4 similar events)
// Phase 1: matrix 93 rows 47 cols
[2022-06-09 09:46:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:46:03] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-09 09:46:03] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2022-06-09 09:46:03] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-09 09:46:04] [INFO ] Flow matrix only has 93 transitions (discarded 4 similar events)
// Phase 1: matrix 93 rows 47 cols
[2022-06-09 09:46:04] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 09:46:04] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/660 places, 97/771 transitions.
Finished structural reductions, in 1 iterations. Remains : 47/660 places, 97/771 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (EQ s38 1) (EQ s1 1) (EQ s24 1)) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-12 finished in 290 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G((p1 U p2))&&G(p1))))'
Support contains 4 out of 660 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 660/660 places, 771/771 transitions.
Graph (trivial) has 651 edges and 660 vertex of which 51 / 660 are part of one of the 9 SCC in 0 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 450 transitions
Trivial Post-agglo rules discarded 450 transitions
Performed 450 trivial Post agglomeration. Transition count delta: 450
Iterating post reduction 0 with 450 rules applied. Total rules applied 451 place count 617 transition count 272
Reduce places removed 450 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 460 rules applied. Total rules applied 911 place count 167 transition count 262
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 916 place count 163 transition count 261
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 917 place count 162 transition count 261
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 917 place count 162 transition count 225
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 989 place count 126 transition count 225
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 996 place count 119 transition count 218
Iterating global reduction 4 with 7 rules applied. Total rules applied 1003 place count 119 transition count 218
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1003 place count 119 transition count 217
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1005 place count 118 transition count 217
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 1008 place count 115 transition count 214
Iterating global reduction 4 with 3 rules applied. Total rules applied 1011 place count 115 transition count 214
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1013 place count 113 transition count 212
Iterating global reduction 4 with 2 rules applied. Total rules applied 1015 place count 113 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1016 place count 113 transition count 211
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1017 place count 112 transition count 210
Iterating global reduction 5 with 1 rules applied. Total rules applied 1018 place count 112 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1019 place count 112 transition count 209
Performed 22 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 1063 place count 90 transition count 185
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1078 place count 75 transition count 135
Iterating global reduction 6 with 15 rules applied. Total rules applied 1093 place count 75 transition count 135
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 1101 place count 75 transition count 127
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1109 place count 67 transition count 116
Iterating global reduction 7 with 8 rules applied. Total rules applied 1117 place count 67 transition count 116
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1125 place count 59 transition count 105
Iterating global reduction 7 with 8 rules applied. Total rules applied 1133 place count 59 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1135 place count 59 transition count 103
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 1149 place count 52 transition count 118
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1150 place count 51 transition count 112
Iterating global reduction 8 with 1 rules applied. Total rules applied 1151 place count 51 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1152 place count 51 transition count 111
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1155 place count 51 transition count 108
Applied a total of 1155 rules in 25 ms. Remains 51 /660 variables (removed 609) and now considering 108/771 (removed 663) transitions.
[2022-06-09 09:46:04] [INFO ] Flow matrix only has 104 transitions (discarded 4 similar events)
// Phase 1: matrix 104 rows 51 cols
[2022-06-09 09:46:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:46:04] [INFO ] Implicit Places using invariants in 43 ms returned []
[2022-06-09 09:46:04] [INFO ] Flow matrix only has 104 transitions (discarded 4 similar events)
// Phase 1: matrix 104 rows 51 cols
[2022-06-09 09:46:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:46:04] [INFO ] State equation strengthened by 19 read => feed constraints.
[2022-06-09 09:46:04] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2022-06-09 09:46:04] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-09 09:46:04] [INFO ] Flow matrix only has 104 transitions (discarded 4 similar events)
// Phase 1: matrix 104 rows 51 cols
[2022-06-09 09:46:04] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 09:46:04] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/660 places, 108/771 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/660 places, 108/771 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s15 1), p0:(OR (NEQ s12 1) (EQ s29 1)), p2:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-02b-LTLFireability-14 finished in 504 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(!(G(p1) U p2)))&&F(G(F(p3)))))'
Support contains 3 out of 660 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 660/660 places, 771/771 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 648 transition count 759
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 648 transition count 759
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 638 transition count 749
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 638 transition count 749
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 46 place count 638 transition count 747
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 52 place count 632 transition count 741
Iterating global reduction 1 with 6 rules applied. Total rules applied 58 place count 632 transition count 741
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 64 place count 626 transition count 735
Iterating global reduction 1 with 6 rules applied. Total rules applied 70 place count 626 transition count 735
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 621 transition count 730
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 621 transition count 730
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 616 transition count 725
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 616 transition count 725
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 611 transition count 720
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 611 transition count 720
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 101 place count 611 transition count 719
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 609 transition count 717
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 609 transition count 717
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 607 transition count 715
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 607 transition count 715
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 605 transition count 713
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 605 transition count 713
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 115 place count 603 transition count 711
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 603 transition count 711
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 601 transition count 709
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 601 transition count 709
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 122 place count 601 transition count 708
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 123 place count 600 transition count 707
Iterating global reduction 3 with 1 rules applied. Total rules applied 124 place count 600 transition count 707
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 599 transition count 706
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 599 transition count 706
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 127 place count 598 transition count 705
Iterating global reduction 3 with 1 rules applied. Total rules applied 128 place count 598 transition count 705
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 129 place count 597 transition count 704
Iterating global reduction 3 with 1 rules applied. Total rules applied 130 place count 597 transition count 704
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 131 place count 596 transition count 703
Iterating global reduction 3 with 1 rules applied. Total rules applied 132 place count 596 transition count 703
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 133 place count 596 transition count 702
Applied a total of 133 rules in 310 ms. Remains 596 /660 variables (removed 64) and now considering 702/771 (removed 69) transitions.
// Phase 1: matrix 702 rows 596 cols
[2022-06-09 09:46:04] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 09:46:05] [INFO ] Implicit Places using invariants in 175 ms returned []
// Phase 1: matrix 702 rows 596 cols
[2022-06-09 09:46:05] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-09 09:46:05] [INFO ] Implicit Places using invariants and state equation in 491 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
// Phase 1: matrix 702 rows 596 cols
[2022-06-09 09:46:05] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-09 09:46:06] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 596/660 places, 702/771 transitions.
Finished structural reductions, in 1 iterations. Remains : 596/660 places, 702/771 transitions.
Stuttering acceptance computed with spot in 333 ms :[(OR (NOT p3) p2), (NOT p3), (NOT p3), (AND (NOT p0) p2), p2, (NOT p0), (AND (NOT p0) p2 p1), (AND p1 p2), (AND (NOT p0) p1)]
Running random walk in product with property : StigmergyCommit-PT-02b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p3), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p1 p2), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p3:(EQ s179 0), p0:(EQ s539 1), p2:(EQ s501 1), p1:(EQ s179 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3279 reset in 162 ms.
Product exploration explored 100000 steps with 4688 reset in 199 ms.
Computed a total of 123 stabilizing places and 129 stable transitions
Computed a total of 123 stabilizing places and 129 stable transitions
Detected a total of 123/596 stabilizing places and 129/702 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND p3 (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p2))), true, (X (X p3)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 955 ms. Reduced automaton from 9 states, 18 edges and 4 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p3), (NOT p3)]
Incomplete random walk after 10000 steps, including 166 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 40 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 901661 steps, run timeout after 3001 ms. (steps per millisecond=300 ) properties seen :{}
Probabilistic random walk after 901661 steps, saw 200373 distinct states, run finished after 3001 ms. (steps per millisecond=300 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 702 rows 596 cols
[2022-06-09 09:46:11] [INFO ] Computed 4 place invariants in 4 ms
[2022-06-09 09:46:11] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 09:46:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2022-06-09 09:46:11] [INFO ] After 424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 09:46:11] [INFO ] After 489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2022-06-09 09:46:11] [INFO ] After 715ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 27 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p3 (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p2))), true, (X (X p3)), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p1 p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 18 factoid took 921 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 94 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p3), (NOT p3)]
Support contains 1 out of 596 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 596/596 places, 702/702 transitions.
Graph (trivial) has 585 edges and 596 vertex of which 51 / 596 are part of one of the 9 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 402 transitions
Trivial Post-agglo rules discarded 402 transitions
Performed 402 trivial Post agglomeration. Transition count delta: 402
Iterating post reduction 0 with 402 rules applied. Total rules applied 403 place count 553 transition count 251
Reduce places removed 402 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 410 rules applied. Total rules applied 813 place count 151 transition count 243
Reduce places removed 3 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 8 rules applied. Total rules applied 821 place count 148 transition count 238
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 827 place count 143 transition count 237
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 31 Pre rules applied. Total rules applied 827 place count 143 transition count 206
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 889 place count 112 transition count 206
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 891 place count 110 transition count 204
Iterating global reduction 4 with 2 rules applied. Total rules applied 893 place count 110 transition count 204
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 937 place count 88 transition count 182
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 955 place count 70 transition count 129
Iterating global reduction 4 with 18 rules applied. Total rules applied 973 place count 70 transition count 129
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 981 place count 70 transition count 121
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 990 place count 61 transition count 109
Iterating global reduction 5 with 9 rules applied. Total rules applied 999 place count 61 transition count 109
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 1007 place count 53 transition count 98
Iterating global reduction 5 with 8 rules applied. Total rules applied 1015 place count 53 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 1017 place count 53 transition count 96
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1031 place count 46 transition count 108
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1032 place count 45 transition count 102
Iterating global reduction 6 with 1 rules applied. Total rules applied 1033 place count 45 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1034 place count 45 transition count 101
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 1037 place count 45 transition count 98
Applied a total of 1037 rules in 21 ms. Remains 45 /596 variables (removed 551) and now considering 98/702 (removed 604) transitions.
[2022-06-09 09:46:13] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
// Phase 1: matrix 94 rows 45 cols
[2022-06-09 09:46:13] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 09:46:13] [INFO ] Implicit Places using invariants in 42 ms returned []
[2022-06-09 09:46:13] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
// Phase 1: matrix 94 rows 45 cols
[2022-06-09 09:46:13] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 09:46:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-06-09 09:46:13] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2022-06-09 09:46:13] [INFO ] Redundant transitions in 0 ms returned []
[2022-06-09 09:46:13] [INFO ] Flow matrix only has 94 transitions (discarded 4 similar events)
// Phase 1: matrix 94 rows 45 cols
[2022-06-09 09:46:13] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 09:46:13] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/596 places, 98/702 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/596 places, 98/702 transitions.
Computed a total of 4 stabilizing places and 15 stable transitions
Computed a total of 4 stabilizing places and 15 stable transitions
Detected a total of 4/45 stabilizing places and 15/98 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p3, (X p3), (X (X p3)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 85 ms :[(NOT p3), (NOT p3)]
Finished random walk after 17 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=8 )
Knowledge obtained : [p3, (X p3), (X (X p3)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 59 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 29 reset in 55 ms.
Product exploration explored 100000 steps with 253 reset in 63 ms.
Built C files in :
/tmp/ltsmin14732703712773829724
[2022-06-09 09:46:14] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2022-06-09 09:46:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 09:46:14] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2022-06-09 09:46:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 09:46:14] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2022-06-09 09:46:14] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 09:46:14] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14732703712773829724
Running compilation step : cd /tmp/ltsmin14732703712773829724;'/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 440 ms.
Running link step : cd /tmp/ltsmin14732703712773829724;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin14732703712773829724;'/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/stateBased15302669412841769488.hoa' '--buchi-type=spotba'
LTSmin run took 211 ms.
FORMULA StigmergyCommit-PT-02b-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-02b-LTLFireability-15 finished in 10183 ms.
All properties solved by simple procedures.
Total runtime 154739 ms.

BK_STOP 1654767975081

--------------------
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="StigmergyCommit-PT-02b"
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 StigmergyCommit-PT-02b, 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 r294-smll-165463872400100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-02b.tgz
mv StigmergyCommit-PT-02b 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 ;