Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 11 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 11 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 627K May 18 16:43 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-04b-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-04b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716986239157

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 12:37:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 12:37:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:37:20] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2024-05-29 12:37:20] [INFO ] Transformed 1534 places.
[2024-05-29 12:37:20] [INFO ] Transformed 2136 transitions.
[2024-05-29 12:37:20] [INFO ] Found NUPN structural information;
[2024-05-29 12:37:20] [INFO ] Parsed PT model containing 1534 places and 2136 transitions and 8601 arcs in 276 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA StigmergyCommit-PT-04b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04b-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 1534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1534/1534 places, 2136/2136 transitions.
Discarding 123 places :
Symmetric choice reduction at 0 with 123 rule applications. Total rules 123 place count 1411 transition count 2013
Iterating global reduction 0 with 123 rules applied. Total rules applied 246 place count 1411 transition count 2013
Discarding 76 places :
Symmetric choice reduction at 0 with 76 rule applications. Total rules 322 place count 1335 transition count 1937
Iterating global reduction 0 with 76 rules applied. Total rules applied 398 place count 1335 transition count 1937
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 443 place count 1290 transition count 1892
Iterating global reduction 0 with 45 rules applied. Total rules applied 488 place count 1290 transition count 1892
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 528 place count 1250 transition count 1852
Iterating global reduction 0 with 40 rules applied. Total rules applied 568 place count 1250 transition count 1852
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 602 place count 1216 transition count 1818
Iterating global reduction 0 with 34 rules applied. Total rules applied 636 place count 1216 transition count 1818
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 670 place count 1182 transition count 1784
Iterating global reduction 0 with 34 rules applied. Total rules applied 704 place count 1182 transition count 1784
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 738 place count 1148 transition count 1750
Iterating global reduction 0 with 34 rules applied. Total rules applied 772 place count 1148 transition count 1750
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 806 place count 1114 transition count 1716
Iterating global reduction 0 with 34 rules applied. Total rules applied 840 place count 1114 transition count 1716
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 869 place count 1085 transition count 1687
Iterating global reduction 0 with 29 rules applied. Total rules applied 898 place count 1085 transition count 1687
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 922 place count 1061 transition count 1663
Iterating global reduction 0 with 24 rules applied. Total rules applied 946 place count 1061 transition count 1663
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 951 place count 1061 transition count 1658
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 960 place count 1052 transition count 1649
Iterating global reduction 1 with 9 rules applied. Total rules applied 969 place count 1052 transition count 1649
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 978 place count 1043 transition count 1640
Iterating global reduction 1 with 9 rules applied. Total rules applied 987 place count 1043 transition count 1640
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 991 place count 1039 transition count 1636
Iterating global reduction 1 with 4 rules applied. Total rules applied 995 place count 1039 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 999 place count 1035 transition count 1632
Iterating global reduction 1 with 4 rules applied. Total rules applied 1003 place count 1035 transition count 1632
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1007 place count 1031 transition count 1628
Iterating global reduction 1 with 4 rules applied. Total rules applied 1011 place count 1031 transition count 1628
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1015 place count 1027 transition count 1624
Iterating global reduction 1 with 4 rules applied. Total rules applied 1019 place count 1027 transition count 1624
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 1023 place count 1023 transition count 1620
Iterating global reduction 1 with 4 rules applied. Total rules applied 1027 place count 1023 transition count 1620
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1030 place count 1020 transition count 1617
Iterating global reduction 1 with 3 rules applied. Total rules applied 1033 place count 1020 transition count 1617
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1036 place count 1017 transition count 1614
Iterating global reduction 1 with 3 rules applied. Total rules applied 1039 place count 1017 transition count 1614
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1042 place count 1014 transition count 1611
Iterating global reduction 1 with 3 rules applied. Total rules applied 1045 place count 1014 transition count 1611
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1048 place count 1011 transition count 1608
Iterating global reduction 1 with 3 rules applied. Total rules applied 1051 place count 1011 transition count 1608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 1054 place count 1008 transition count 1605
Iterating global reduction 1 with 3 rules applied. Total rules applied 1057 place count 1008 transition count 1605
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 1060 place count 1008 transition count 1602
Applied a total of 1060 rules in 1462 ms. Remains 1008 /1534 variables (removed 526) and now considering 1602/2136 (removed 534) transitions.
// Phase 1: matrix 1602 rows 1008 cols
[2024-05-29 12:37:22] [INFO ] Computed 6 invariants in 36 ms
[2024-05-29 12:37:22] [INFO ] Implicit Places using invariants in 474 ms returned []
[2024-05-29 12:37:22] [INFO ] Invariant cache hit.
[2024-05-29 12:37:23] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 1187 ms to find 0 implicit places.
Running 1601 sub problems to find dead transitions.
[2024-05-29 12:37:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1007 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1601 unsolved
SMT process timed out in 32636ms, After SMT, problems are : Problem set: 0 solved, 1601 unsolved
Search for dead transitions found 0 dead transitions in 32669ms
Starting structural reductions in LTL mode, iteration 1 : 1008/1534 places, 1602/2136 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35349 ms. Remains : 1008/1534 places, 1602/2136 transitions.
Support contains 51 out of 1008 places after structural reductions.
[2024-05-29 12:37:56] [INFO ] Flatten gal took : 146 ms
[2024-05-29 12:37:56] [INFO ] Flatten gal took : 92 ms
[2024-05-29 12:37:56] [INFO ] Input system was already deterministic with 1602 transitions.
Support contains 47 out of 1008 places (down from 51) after GAL structural reductions.
RANDOM walk for 40000 steps (416 resets) in 1933 ms. (20 steps per ms) remains 14/28 properties
BEST_FIRST walk for 40002 steps (77 resets) in 200 ms. (199 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (76 resets) in 261 ms. (152 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (78 resets) in 187 ms. (212 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (75 resets) in 105 ms. (377 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (77 resets) in 77 ms. (512 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (74 resets) in 99 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (79 resets) in 109 ms. (363 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (72 resets) in 282 ms. (141 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (76 resets) in 131 ms. (303 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (76 resets) in 104 ms. (380 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (77 resets) in 110 ms. (360 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (73 resets) in 97 ms. (408 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (75 resets) in 105 ms. (377 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (54 resets) in 87 ms. (454 steps per ms) remains 14/14 properties
[2024-05-29 12:37:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 959/994 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/994 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 14/1008 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1008 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1602/2610 variables, 1008/1014 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2610 variables, 0/1014 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/2610 variables, 0/1014 constraints. Problems are: Problem set: 1 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2610/2610 variables, and 1014 constraints, problems are : Problem set: 1 solved, 13 unsolved in 2366 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1008/1008 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 962/994 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-29 12:38:01] [INFO ] Deduced a trap composed of 301 places in 364 ms of which 42 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/994 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/994 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 14/1008 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1008 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 1602/2610 variables, 1008/1015 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2610 variables, 13/1028 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2610 variables, 0/1028 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2610/2610 variables, and 1028 constraints, problems are : Problem set: 1 solved, 13 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 1008/1008 constraints, PredecessorRefiner: 13/14 constraints, Known Traps: 1/1 constraints]
After SMT, in 7475ms problems are : Problem set: 1 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 1008 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1008/1008 places, 1602/1602 transitions.
Graph (trivial) has 939 edges and 1008 vertex of which 85 / 1008 are part of one of the 15 SCC in 9 ms
Free SCC test removed 70 places
Drop transitions (Empty/Sink Transition effects.) removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Graph (complete) has 1614 edges and 938 vertex of which 933 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 650 transitions
Trivial Post-agglo rules discarded 650 transitions
Performed 650 trivial Post agglomeration. Transition count delta: 650
Iterating post reduction 0 with 655 rules applied. Total rules applied 657 place count 933 transition count 853
Reduce places removed 650 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 665 rules applied. Total rules applied 1322 place count 283 transition count 838
Reduce places removed 5 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 2 with 36 rules applied. Total rules applied 1358 place count 278 transition count 807
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 1389 place count 247 transition count 807
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 53 Pre rules applied. Total rules applied 1389 place count 247 transition count 754
Deduced a syphon composed of 53 places in 1 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 1495 place count 194 transition count 754
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 1567 place count 158 transition count 718
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1576 place count 158 transition count 709
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 1596 place count 138 transition count 680
Iterating global reduction 5 with 20 rules applied. Total rules applied 1616 place count 138 transition count 680
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1622 place count 138 transition count 674
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 1635 place count 125 transition count 661
Iterating global reduction 6 with 13 rules applied. Total rules applied 1648 place count 125 transition count 661
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 1657 place count 116 transition count 652
Iterating global reduction 6 with 9 rules applied. Total rules applied 1666 place count 116 transition count 652
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1670 place count 116 transition count 648
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 1682 place count 110 transition count 642
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1688 place count 107 transition count 657
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 1690 place count 107 transition count 655
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1692 place count 107 transition count 653
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1694 place count 105 transition count 653
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1699 place count 100 transition count 648
Iterating global reduction 8 with 5 rules applied. Total rules applied 1704 place count 100 transition count 648
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1705 place count 100 transition count 647
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1706 place count 99 transition count 647
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 1722 place count 99 transition count 647
Applied a total of 1722 rules in 232 ms. Remains 99 /1008 variables (removed 909) and now considering 647/1602 (removed 955) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 99/1008 places, 647/1602 transitions.
RANDOM walk for 40000 steps (1682 resets) in 818 ms. (48 steps per ms) remains 8/13 properties
BEST_FIRST walk for 40004 steps (238 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (239 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (246 resets) in 53 ms. (740 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (149 resets) in 49 ms. (800 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40001 steps (241 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (242 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (91 resets) in 59 ms. (666 steps per ms) remains 5/6 properties
// Phase 1: matrix 647 rows 99 cols
[2024-05-29 12:38:06] [INFO ] Computed 6 invariants in 7 ms
[2024-05-29 12:38:06] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 79/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 647/746 variables, 99/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 31/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/746 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/746 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 746/746 variables, and 136 constraints, problems are : Problem set: 0 solved, 5 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 99/99 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 79/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/99 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 647/746 variables, 99/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 31/136 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/746 variables, 5/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/746 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/746 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 746/746 variables, and 141 constraints, problems are : Problem set: 0 solved, 5 unsolved in 842 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 99/99 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1183ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 3 properties in 450 ms.
Support contains 8 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 647/647 transitions.
Graph (trivial) has 66 edges and 99 vertex of which 2 / 99 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 98 transition count 631
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 84 transition count 631
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 37 place count 76 transition count 337
Iterating global reduction 2 with 8 rules applied. Total rules applied 45 place count 76 transition count 337
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 51 place count 76 transition count 331
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 53 place count 74 transition count 329
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 74 transition count 329
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 69 place count 67 transition count 322
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 67 transition count 321
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 72 place count 65 transition count 319
Iterating global reduction 4 with 2 rules applied. Total rules applied 74 place count 65 transition count 319
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 82 place count 65 transition count 311
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 83 place count 64 transition count 310
Iterating global reduction 5 with 1 rules applied. Total rules applied 84 place count 64 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 85 place count 64 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 90 place count 64 transition count 304
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 91 place count 63 transition count 302
Iterating global reduction 6 with 1 rules applied. Total rules applied 92 place count 63 transition count 302
Free-agglomeration rule applied 29 times.
Iterating global reduction 6 with 29 rules applied. Total rules applied 121 place count 63 transition count 273
Reduce places removed 29 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 153 place count 34 transition count 270
Drop transitions (Redundant composition of simpler transitions.) removed 38 transitions
Redundant transition composition rules discarded 38 transitions
Iterating global reduction 7 with 38 rules applied. Total rules applied 191 place count 34 transition count 232
Applied a total of 191 rules in 89 ms. Remains 34 /99 variables (removed 65) and now considering 232/647 (removed 415) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 34/99 places, 232/647 transitions.
RANDOM walk for 1330 steps (0 resets) in 10 ms. (120 steps per ms) remains 0/2 properties
FORMULA StigmergyCommit-PT-04b-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 205 stabilizing places and 215 stable transitions
FORMULA StigmergyCommit-PT-04b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1)&&G(p2))))'
Support contains 7 out of 1008 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1008/1008 places, 1602/1602 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1005 transition count 1599
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1005 transition count 1599
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 1003 transition count 1597
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1003 transition count 1597
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 1001 transition count 1595
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 1001 transition count 1595
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 999 transition count 1593
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 999 transition count 1593
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 997 transition count 1591
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 997 transition count 1591
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 997 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 996 transition count 1589
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 996 transition count 1589
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 995 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 995 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 994 transition count 1587
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 994 transition count 1587
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 993 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 993 transition count 1586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 992 transition count 1585
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 992 transition count 1585
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 991 transition count 1584
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 991 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 990 transition count 1583
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 990 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 989 transition count 1582
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 989 transition count 1582
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 988 transition count 1581
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 988 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 987 transition count 1580
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 987 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 986 transition count 1579
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 986 transition count 1579
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 985 transition count 1578
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 985 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 984 transition count 1577
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 984 transition count 1577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 984 transition count 1576
Applied a total of 50 rules in 494 ms. Remains 984 /1008 variables (removed 24) and now considering 1576/1602 (removed 26) transitions.
// Phase 1: matrix 1576 rows 984 cols
[2024-05-29 12:38:08] [INFO ] Computed 6 invariants in 16 ms
[2024-05-29 12:38:09] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-29 12:38:09] [INFO ] Invariant cache hit.
[2024-05-29 12:38:09] [INFO ] Implicit Places using invariants and state equation in 776 ms returned []
Implicit Place search using SMT with State Equation took 1039 ms to find 0 implicit places.
Running 1575 sub problems to find dead transitions.
[2024-05-29 12:38:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/983 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1575 unsolved
SMT process timed out in 32384ms, After SMT, problems are : Problem set: 0 solved, 1575 unsolved
Search for dead transitions found 0 dead transitions in 32401ms
Starting structural reductions in LTL mode, iteration 1 : 984/1008 places, 1576/1602 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33944 ms. Remains : 984/1008 places, 1576/1602 transitions.
Stuttering acceptance computed with spot in 332 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLFireability-01 finished in 34361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 1 out of 1008 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1008/1008 places, 1602/1602 transitions.
Graph (trivial) has 1002 edges and 1008 vertex of which 86 / 1008 are part of one of the 15 SCC in 3 ms
Free SCC test removed 71 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 692 transitions
Trivial Post-agglo rules discarded 692 transitions
Performed 692 trivial Post agglomeration. Transition count delta: 692
Iterating post reduction 0 with 692 rules applied. Total rules applied 693 place count 936 transition count 828
Reduce places removed 692 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 709 rules applied. Total rules applied 1402 place count 244 transition count 811
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 1410 place count 238 transition count 809
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1412 place count 236 transition count 809
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 53 Pre rules applied. Total rules applied 1412 place count 236 transition count 756
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 1518 place count 183 transition count 756
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1523 place count 178 transition count 751
Iterating global reduction 4 with 5 rules applied. Total rules applied 1528 place count 178 transition count 751
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1529 place count 177 transition count 750
Iterating global reduction 4 with 1 rules applied. Total rules applied 1530 place count 177 transition count 750
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1608 place count 138 transition count 711
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 1638 place count 108 transition count 264
Iterating global reduction 4 with 30 rules applied. Total rules applied 1668 place count 108 transition count 264
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 1683 place count 108 transition count 249
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1699 place count 92 transition count 228
Iterating global reduction 5 with 16 rules applied. Total rules applied 1715 place count 92 transition count 228
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1731 place count 76 transition count 207
Iterating global reduction 5 with 16 rules applied. Total rules applied 1747 place count 76 transition count 207
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1753 place count 76 transition count 201
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1771 place count 67 transition count 208
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1772 place count 66 transition count 198
Iterating global reduction 6 with 1 rules applied. Total rules applied 1773 place count 66 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1774 place count 66 transition count 197
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 1779 place count 66 transition count 192
Applied a total of 1779 rules in 98 ms. Remains 66 /1008 variables (removed 942) and now considering 192/1602 (removed 1410) transitions.
[2024-05-29 12:38:42] [INFO ] Flow matrix only has 186 transitions (discarded 6 similar events)
// Phase 1: matrix 186 rows 66 cols
[2024-05-29 12:38:42] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 12:38:42] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-29 12:38:42] [INFO ] Flow matrix only has 186 transitions (discarded 6 similar events)
[2024-05-29 12:38:42] [INFO ] Invariant cache hit.
[2024-05-29 12:38:42] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 12:38:42] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-29 12:38:42] [INFO ] Redundant transitions in 8 ms returned []
Running 175 sub problems to find dead transitions.
[2024-05-29 12:38:42] [INFO ] Flow matrix only has 186 transitions (discarded 6 similar events)
[2024-05-29 12:38:42] [INFO ] Invariant cache hit.
[2024-05-29 12:38:42] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-29 12:38:43] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-05-29 12:38:43] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-29 12:38:43] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:38:43] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:38:43] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2024-05-29 12:38:44] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:38:44] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 12:38:44] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:38:44] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:38:44] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:38:44] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2024-05-29 12:38:44] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 12:38:44] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:38:44] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-29 12:38:44] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:38:44] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:38:44] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 3 ms to minimize.
[2024-05-29 12:38:44] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-29 12:38:44] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:38:44] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-29 12:38:45] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:38:45] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 0 ms to minimize.
[2024-05-29 12:38:45] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:38:45] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-29 12:38:45] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 185/251 variables, 66/93 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 30/123 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 1/252 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 124 constraints, problems are : Problem set: 0 solved, 175 unsolved in 6917 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (OVERLAPS) 1/66 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (OVERLAPS) 185/251 variables, 66/93 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 30/123 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 175/298 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 1/252 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-29 12:38:56] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-29 12:38:59] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/252 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-29 12:39:02] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/252 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/252 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 14 (OVERLAPS) 0/252 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 302 constraints, problems are : Problem set: 0 solved, 175 unsolved in 20419 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 28/28 constraints]
After SMT, in 27469ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 27471ms
Starting structural reductions in SI_LTL mode, iteration 1 : 66/1008 places, 192/1602 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27749 ms. Remains : 66/1008 places, 192/1602 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-02
Product exploration explored 100000 steps with 4630 reset in 280 ms.
Product exploration explored 100000 steps with 554 reset in 91 ms.
Computed a total of 3 stabilizing places and 19 stable transitions
Computed a total of 3 stabilizing places and 19 stable transitions
Detected a total of 3/66 stabilizing places and 19/192 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 519 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (4207 resets) in 381 ms. (104 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (503 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
[2024-05-29 12:39:11] [INFO ] Flow matrix only has 186 transitions (discarded 6 similar events)
[2024-05-29 12:39:11] [INFO ] Invariant cache hit.
[2024-05-29 12:39:11] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 184/248 variables, 64/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 30/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/251 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/251 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/251 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/252 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/252 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/252 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 63/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 12:39:12] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-29 12:39:12] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-29 12:39:12] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-29 12:39:12] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:39:12] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:39:12] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 248/252 variables, and 71 constraints, problems are : Problem set: 1 solved, 0 unsolved in 397 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 64/66 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 629ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p0 p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 13 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-04b-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-04b-LTLFireability-02 finished in 29675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 1008 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1008/1008 places, 1602/1602 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1005 transition count 1599
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1005 transition count 1599
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 1003 transition count 1597
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1003 transition count 1597
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 1001 transition count 1595
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 1001 transition count 1595
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 999 transition count 1593
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 999 transition count 1593
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 997 transition count 1591
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 997 transition count 1591
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 997 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 996 transition count 1589
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 996 transition count 1589
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 995 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 995 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 994 transition count 1587
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 994 transition count 1587
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 993 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 993 transition count 1586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 992 transition count 1585
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 992 transition count 1585
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 991 transition count 1584
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 991 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 990 transition count 1583
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 990 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 989 transition count 1582
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 989 transition count 1582
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 988 transition count 1581
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 988 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 987 transition count 1580
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 987 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 986 transition count 1579
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 986 transition count 1579
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 985 transition count 1578
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 985 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 984 transition count 1577
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 984 transition count 1577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 984 transition count 1576
Applied a total of 50 rules in 477 ms. Remains 984 /1008 variables (removed 24) and now considering 1576/1602 (removed 26) transitions.
// Phase 1: matrix 1576 rows 984 cols
[2024-05-29 12:39:12] [INFO ] Computed 6 invariants in 11 ms
[2024-05-29 12:39:13] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-29 12:39:13] [INFO ] Invariant cache hit.
[2024-05-29 12:39:13] [INFO ] Implicit Places using invariants and state equation in 774 ms returned []
Implicit Place search using SMT with State Equation took 1024 ms to find 0 implicit places.
Running 1575 sub problems to find dead transitions.
[2024-05-29 12:39:13] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/983 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1575 unsolved
SMT process timed out in 32189ms, After SMT, problems are : Problem set: 0 solved, 1575 unsolved
Search for dead transitions found 0 dead transitions in 32203ms
Starting structural reductions in LTL mode, iteration 1 : 984/1008 places, 1576/1602 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33716 ms. Remains : 984/1008 places, 1576/1602 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-03
Product exploration explored 100000 steps with 1058 reset in 191 ms.
Product exploration explored 100000 steps with 1050 reset in 162 ms.
Computed a total of 205 stabilizing places and 215 stable transitions
Computed a total of 205 stabilizing places and 215 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (424 resets) in 100 ms. (396 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (78 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 590502 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 1
Probabilistic random walk after 590502 steps, saw 113780 distinct states, run finished after 3004 ms. (steps per millisecond=196 ) properties seen :0
[2024-05-29 12:39:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 965/970 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/970 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/984 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/984 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1576/2560 variables, 984/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2560 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2560 variables, 0/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2560/2560 variables, and 990 constraints, problems are : Problem set: 0 solved, 1 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 984/984 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 965/970 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/970 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/984 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/984 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1576/2560 variables, 984/990 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2560 variables, 1/991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2560 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2560 variables, 0/991 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2560/2560 variables, and 991 constraints, problems are : Problem set: 0 solved, 1 unsolved in 853 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 984/984 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1480ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 66 ms.
Support contains 5 out of 984 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 984/984 places, 1576/1576 transitions.
Graph (trivial) has 978 edges and 984 vertex of which 85 / 984 are part of one of the 15 SCC in 2 ms
Free SCC test removed 70 places
Drop transitions (Empty/Sink Transition effects.) removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Graph (complete) has 1581 edges and 914 vertex of which 909 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 684 transitions
Trivial Post-agglo rules discarded 684 transitions
Performed 684 trivial Post agglomeration. Transition count delta: 684
Iterating post reduction 0 with 689 rules applied. Total rules applied 691 place count 909 transition count 792
Reduce places removed 684 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 699 rules applied. Total rules applied 1390 place count 225 transition count 777
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 1395 place count 220 transition count 777
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 1395 place count 220 transition count 721
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1507 place count 164 transition count 721
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1508 place count 164 transition count 720
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
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 1580 place count 128 transition count 684
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 1590 place count 128 transition count 674
Discarding 26 places :
Symmetric choice reduction at 5 with 26 rule applications. Total rules 1616 place count 102 transition count 433
Iterating global reduction 5 with 26 rules applied. Total rules applied 1642 place count 102 transition count 433
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1653 place count 102 transition count 422
Discarding 15 places :
Symmetric choice reduction at 6 with 15 rule applications. Total rules 1668 place count 87 transition count 407
Iterating global reduction 6 with 15 rules applied. Total rules applied 1683 place count 87 transition count 407
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1693 place count 77 transition count 397
Iterating global reduction 6 with 10 rules applied. Total rules applied 1703 place count 77 transition count 397
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1708 place count 77 transition count 392
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 1718 place count 72 transition count 387
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 1724 place count 69 transition count 395
Free-agglomeration rule applied 31 times.
Iterating global reduction 7 with 31 rules applied. Total rules applied 1755 place count 69 transition count 364
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 33 transitions.
Iterating post reduction 7 with 64 rules applied. Total rules applied 1819 place count 38 transition count 331
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 1824 place count 33 transition count 326
Iterating global reduction 8 with 5 rules applied. Total rules applied 1829 place count 33 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 170 transitions
Redundant transition composition rules discarded 170 transitions
Iterating global reduction 8 with 170 rules applied. Total rules applied 1999 place count 33 transition count 156
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 8 with 2 rules applied. Total rules applied 2001 place count 32 transition count 155
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2005 place count 30 transition count 173
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2006 place count 30 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2007 place count 29 transition count 172
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 2010 place count 29 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 2012 place count 29 transition count 170
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2013 place count 28 transition count 168
Iterating global reduction 9 with 1 rules applied. Total rules applied 2014 place count 28 transition count 168
Applied a total of 2014 rules in 101 ms. Remains 28 /984 variables (removed 956) and now considering 168/1576 (removed 1408) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 28/984 places, 168/1576 transitions.
RANDOM walk for 240 steps (0 resets) in 5 ms. (40 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-04b-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-04b-LTLFireability-03 finished in 39192 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&G(p2))))))'
Support contains 7 out of 1008 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1008/1008 places, 1602/1602 transitions.
Graph (trivial) has 997 edges and 1008 vertex of which 86 / 1008 are part of one of the 15 SCC in 1 ms
Free SCC test removed 71 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 687 transitions
Trivial Post-agglo rules discarded 687 transitions
Performed 687 trivial Post agglomeration. Transition count delta: 687
Iterating post reduction 0 with 687 rules applied. Total rules applied 688 place count 936 transition count 833
Reduce places removed 687 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 702 rules applied. Total rules applied 1390 place count 249 transition count 818
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 1396 place count 244 transition count 817
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1397 place count 243 transition count 817
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 53 Pre rules applied. Total rules applied 1397 place count 243 transition count 764
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 1503 place count 190 transition count 764
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1508 place count 185 transition count 759
Iterating global reduction 4 with 5 rules applied. Total rules applied 1513 place count 185 transition count 759
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1514 place count 184 transition count 758
Iterating global reduction 4 with 1 rules applied. Total rules applied 1515 place count 184 transition count 758
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1593 place count 145 transition count 719
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 1620 place count 118 transition count 348
Iterating global reduction 4 with 27 rules applied. Total rules applied 1647 place count 118 transition count 348
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1659 place count 118 transition count 336
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1675 place count 102 transition count 315
Iterating global reduction 5 with 16 rules applied. Total rules applied 1691 place count 102 transition count 315
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 1706 place count 87 transition count 296
Iterating global reduction 5 with 15 rules applied. Total rules applied 1721 place count 87 transition count 296
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 1726 place count 87 transition count 291
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1744 place count 78 transition count 300
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1745 place count 77 transition count 289
Iterating global reduction 6 with 1 rules applied. Total rules applied 1746 place count 77 transition count 289
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1747 place count 77 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 1754 place count 77 transition count 281
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1755 place count 77 transition count 281
Applied a total of 1755 rules in 79 ms. Remains 77 /1008 variables (removed 931) and now considering 281/1602 (removed 1321) transitions.
[2024-05-29 12:39:51] [INFO ] Flow matrix only has 275 transitions (discarded 6 similar events)
// Phase 1: matrix 275 rows 77 cols
[2024-05-29 12:39:51] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 12:39:51] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-29 12:39:51] [INFO ] Flow matrix only has 275 transitions (discarded 6 similar events)
[2024-05-29 12:39:51] [INFO ] Invariant cache hit.
[2024-05-29 12:39:51] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 12:39:51] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-29 12:39:51] [INFO ] Redundant transitions in 13 ms returned []
Running 264 sub problems to find dead transitions.
[2024-05-29 12:39:51] [INFO ] Flow matrix only has 275 transitions (discarded 6 similar events)
[2024-05-29 12:39:51] [INFO ] Invariant cache hit.
[2024-05-29 12:39:51] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-29 12:39:53] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 0 ms to minimize.
[2024-05-29 12:39:53] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2024-05-29 12:39:53] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-29 12:39:53] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 0 ms to minimize.
[2024-05-29 12:39:53] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-29 12:39:53] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-29 12:39:53] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-29 12:39:53] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-29 12:39:53] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 0 ms to minimize.
[2024-05-29 12:39:54] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-29 12:39:54] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-29 12:39:54] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-29 12:39:54] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 1 ms to minimize.
[2024-05-29 12:39:54] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2024-05-29 12:39:54] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 0 ms to minimize.
[2024-05-29 12:39:54] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-29 12:39:54] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 0 ms to minimize.
[2024-05-29 12:39:54] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-29 12:39:55] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2024-05-29 12:39:55] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-29 12:39:55] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-29 12:39:56] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:39:56] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-29 12:39:56] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-29 12:39:57] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-29 12:39:58] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (OVERLAPS) 274/351 variables, 77/105 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 30/135 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-29 12:40:00] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-29 12:40:00] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/351 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/351 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 14 (OVERLAPS) 1/352 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/352 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 264 unsolved
[2024-05-29 12:40:08] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/352 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/352 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 18 (OVERLAPS) 0/352 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 139 constraints, problems are : Problem set: 0 solved, 264 unsolved in 21133 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 1/77 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 274/351 variables, 77/108 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/351 variables, 30/138 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/351 variables, 264/402 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/351 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 9 (OVERLAPS) 1/352 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 11 (OVERLAPS) 0/352 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 403 constraints, problems are : Problem set: 0 solved, 264 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 77/77 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 29/29 constraints]
After SMT, in 51451ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 51454ms
Starting structural reductions in SI_LTL mode, iteration 1 : 77/1008 places, 281/1602 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 51757 ms. Remains : 77/1008 places, 281/1602 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-05
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLFireability-05 finished in 51923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||((!p1 U (p2||G(!p1))) U p3))))'
Support contains 12 out of 1008 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1008/1008 places, 1602/1602 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1005 transition count 1599
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1005 transition count 1599
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 1003 transition count 1597
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1003 transition count 1597
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 1001 transition count 1595
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 1001 transition count 1595
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 999 transition count 1593
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 999 transition count 1593
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 997 transition count 1591
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 997 transition count 1591
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 997 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 996 transition count 1589
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 996 transition count 1589
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 995 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 995 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 994 transition count 1587
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 994 transition count 1587
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 993 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 993 transition count 1586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 992 transition count 1585
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 992 transition count 1585
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 991 transition count 1584
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 991 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 990 transition count 1583
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 990 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 989 transition count 1582
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 989 transition count 1582
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 988 transition count 1581
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 988 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 987 transition count 1580
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 987 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 986 transition count 1579
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 986 transition count 1579
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 985 transition count 1578
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 985 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 984 transition count 1577
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 984 transition count 1577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 984 transition count 1576
Applied a total of 50 rules in 452 ms. Remains 984 /1008 variables (removed 24) and now considering 1576/1602 (removed 26) transitions.
// Phase 1: matrix 1576 rows 984 cols
[2024-05-29 12:40:43] [INFO ] Computed 6 invariants in 18 ms
[2024-05-29 12:40:44] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-05-29 12:40:44] [INFO ] Invariant cache hit.
[2024-05-29 12:40:44] [INFO ] Implicit Places using invariants and state equation in 764 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
Running 1575 sub problems to find dead transitions.
[2024-05-29 12:40:44] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/983 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1575 unsolved
SMT process timed out in 32044ms, After SMT, problems are : Problem set: 0 solved, 1575 unsolved
Search for dead transitions found 0 dead transitions in 32061ms
Starting structural reductions in LTL mode, iteration 1 : 984/1008 places, 1576/1602 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33528 ms. Remains : 984/1008 places, 1576/1602 transitions.
Stuttering acceptance computed with spot in 210 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-06
Stuttering criterion allowed to conclude after 78 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLFireability-06 finished in 33770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 1008 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1008/1008 places, 1602/1602 transitions.
Graph (trivial) has 1002 edges and 1008 vertex of which 86 / 1008 are part of one of the 15 SCC in 2 ms
Free SCC test removed 71 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 689 transitions
Trivial Post-agglo rules discarded 689 transitions
Performed 689 trivial Post agglomeration. Transition count delta: 689
Iterating post reduction 0 with 689 rules applied. Total rules applied 690 place count 936 transition count 831
Reduce places removed 689 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 706 rules applied. Total rules applied 1396 place count 247 transition count 814
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 1404 place count 241 transition count 812
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1406 place count 239 transition count 812
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 53 Pre rules applied. Total rules applied 1406 place count 239 transition count 759
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 1512 place count 186 transition count 759
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 1517 place count 181 transition count 754
Iterating global reduction 4 with 5 rules applied. Total rules applied 1522 place count 181 transition count 754
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 1523 place count 180 transition count 753
Iterating global reduction 4 with 1 rules applied. Total rules applied 1524 place count 180 transition count 753
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1602 place count 141 transition count 714
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 1632 place count 111 transition count 267
Iterating global reduction 4 with 30 rules applied. Total rules applied 1662 place count 111 transition count 267
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 1676 place count 111 transition count 253
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1692 place count 95 transition count 232
Iterating global reduction 5 with 16 rules applied. Total rules applied 1708 place count 95 transition count 232
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 1724 place count 79 transition count 211
Iterating global reduction 5 with 16 rules applied. Total rules applied 1740 place count 79 transition count 211
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1746 place count 79 transition count 205
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 1764 place count 70 transition count 212
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1765 place count 69 transition count 202
Iterating global reduction 6 with 1 rules applied. Total rules applied 1766 place count 69 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1767 place count 69 transition count 201
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 7 with 5 rules applied. Total rules applied 1772 place count 69 transition count 196
Applied a total of 1772 rules in 61 ms. Remains 69 /1008 variables (removed 939) and now considering 196/1602 (removed 1406) transitions.
[2024-05-29 12:41:17] [INFO ] Flow matrix only has 190 transitions (discarded 6 similar events)
// Phase 1: matrix 190 rows 69 cols
[2024-05-29 12:41:17] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 12:41:17] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-29 12:41:17] [INFO ] Flow matrix only has 190 transitions (discarded 6 similar events)
[2024-05-29 12:41:17] [INFO ] Invariant cache hit.
[2024-05-29 12:41:17] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 12:41:17] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-29 12:41:17] [INFO ] Redundant transitions in 4 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-29 12:41:17] [INFO ] Flow matrix only has 190 transitions (discarded 6 similar events)
[2024-05-29 12:41:17] [INFO ] Invariant cache hit.
[2024-05-29 12:41:17] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-29 12:41:18] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-29 12:41:18] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:41:18] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:41:18] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:41:18] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:41:18] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:41:18] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2024-05-29 12:41:18] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:41:18] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:41:18] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2024-05-29 12:41:19] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:41:19] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:41:19] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:41:19] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:41:19] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:41:19] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 0 ms to minimize.
[2024-05-29 12:41:19] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 12:41:19] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:41:19] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 0 ms to minimize.
[2024-05-29 12:41:19] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-29 12:41:19] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:41:19] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 12:41:20] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2024-05-29 12:41:20] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-29 12:41:20] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-29 12:41:20] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:41:20] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-29 12:41:20] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 189/258 variables, 69/99 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 30/129 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (OVERLAPS) 1/259 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-29 12:41:23] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 13 (OVERLAPS) 0/259 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/259 variables, and 131 constraints, problems are : Problem set: 0 solved, 179 unsolved in 8777 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 29/31 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (OVERLAPS) 189/258 variables, 69/100 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 30/130 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 179/309 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-29 12:41:29] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-29 12:41:29] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2024-05-29 12:41:29] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:41:30] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:41:30] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-29 12:41:33] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 0 ms to minimize.
[2024-05-29 12:41:33] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:41:33] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-29 12:41:36] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 12 (OVERLAPS) 1/259 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 14 (OVERLAPS) 0/259 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/259 variables, and 319 constraints, problems are : Problem set: 0 solved, 179 unsolved in 24920 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 38/38 constraints]
After SMT, in 33816ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 33817ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/1008 places, 196/1602 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34065 ms. Remains : 69/1008 places, 196/1602 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-07
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLFireability-07 finished in 34138 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 5 out of 1008 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1008/1008 places, 1602/1602 transitions.
Graph (trivial) has 1001 edges and 1008 vertex of which 86 / 1008 are part of one of the 15 SCC in 2 ms
Free SCC test removed 71 places
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 690 transitions
Trivial Post-agglo rules discarded 690 transitions
Performed 690 trivial Post agglomeration. Transition count delta: 690
Iterating post reduction 0 with 690 rules applied. Total rules applied 691 place count 936 transition count 830
Reduce places removed 690 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 707 rules applied. Total rules applied 1398 place count 246 transition count 813
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1404 place count 240 transition count 813
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 1404 place count 240 transition count 760
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 1510 place count 187 transition count 760
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1515 place count 182 transition count 755
Iterating global reduction 3 with 5 rules applied. Total rules applied 1520 place count 182 transition count 755
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1521 place count 181 transition count 754
Iterating global reduction 3 with 1 rules applied. Total rules applied 1522 place count 181 transition count 754
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 1600 place count 142 transition count 715
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1627 place count 115 transition count 344
Iterating global reduction 3 with 27 rules applied. Total rules applied 1654 place count 115 transition count 344
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1666 place count 115 transition count 332
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1682 place count 99 transition count 311
Iterating global reduction 4 with 16 rules applied. Total rules applied 1698 place count 99 transition count 311
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 1714 place count 83 transition count 290
Iterating global reduction 4 with 16 rules applied. Total rules applied 1730 place count 83 transition count 290
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 1736 place count 83 transition count 284
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 1754 place count 74 transition count 291
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 1755 place count 73 transition count 281
Iterating global reduction 5 with 1 rules applied. Total rules applied 1756 place count 73 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1757 place count 73 transition count 280
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 1762 place count 73 transition count 275
Applied a total of 1762 rules in 74 ms. Remains 73 /1008 variables (removed 935) and now considering 275/1602 (removed 1327) transitions.
[2024-05-29 12:41:51] [INFO ] Flow matrix only has 269 transitions (discarded 6 similar events)
// Phase 1: matrix 269 rows 73 cols
[2024-05-29 12:41:51] [INFO ] Computed 2 invariants in 7 ms
[2024-05-29 12:41:51] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-29 12:41:51] [INFO ] Flow matrix only has 269 transitions (discarded 6 similar events)
[2024-05-29 12:41:51] [INFO ] Invariant cache hit.
[2024-05-29 12:41:51] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 12:41:51] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2024-05-29 12:41:51] [INFO ] Redundant transitions in 4 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-29 12:41:51] [INFO ] Flow matrix only has 269 transitions (discarded 6 similar events)
[2024-05-29 12:41:51] [INFO ] Invariant cache hit.
[2024-05-29 12:41:51] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 12:41:52] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 0 ms to minimize.
[2024-05-29 12:41:52] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2024-05-29 12:41:53] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-29 12:41:53] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-29 12:41:53] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-29 12:41:53] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-29 12:41:53] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-29 12:41:53] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-29 12:41:53] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-29 12:41:53] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2024-05-29 12:41:53] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-29 12:41:54] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-29 12:41:54] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-29 12:41:54] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-29 12:41:54] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 0 ms to minimize.
[2024-05-29 12:41:54] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-29 12:41:54] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-29 12:41:54] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-29 12:41:54] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 12:41:55] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
[2024-05-29 12:41:55] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 268/341 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 30/126 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 12:41:57] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2024-05-29 12:41:57] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (OVERLAPS) 1/342 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 12 (OVERLAPS) 0/342 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 129 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13660 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 268/341 variables, 73/98 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 258/386 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (OVERLAPS) 1/342 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 11 (OVERLAPS) 0/342 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 387 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 23/23 constraints]
After SMT, in 43983ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43987ms
Starting structural reductions in SI_LTL mode, iteration 1 : 73/1008 places, 275/1602 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 44275 ms. Remains : 73/1008 places, 275/1602 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-08
Product exploration explored 100000 steps with 3213 reset in 72 ms.
Product exploration explored 100000 steps with 6956 reset in 116 ms.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 37406 steps (4056 resets) in 77 ms. (479 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Support contains 5 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 275/275 transitions.
Applied a total of 0 rules in 8 ms. Remains 73 /73 variables (removed 0) and now considering 275/275 (removed 0) transitions.
[2024-05-29 12:42:36] [INFO ] Flow matrix only has 269 transitions (discarded 6 similar events)
[2024-05-29 12:42:36] [INFO ] Invariant cache hit.
[2024-05-29 12:42:36] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-29 12:42:36] [INFO ] Flow matrix only has 269 transitions (discarded 6 similar events)
[2024-05-29 12:42:36] [INFO ] Invariant cache hit.
[2024-05-29 12:42:36] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 12:42:36] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2024-05-29 12:42:36] [INFO ] Redundant transitions in 2 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-29 12:42:36] [INFO ] Flow matrix only has 269 transitions (discarded 6 similar events)
[2024-05-29 12:42:36] [INFO ] Invariant cache hit.
[2024-05-29 12:42:36] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 12:42:37] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 1 ms to minimize.
[2024-05-29 12:42:37] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-29 12:42:37] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-29 12:42:38] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2024-05-29 12:42:38] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2024-05-29 12:42:38] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 1 ms to minimize.
[2024-05-29 12:42:38] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-29 12:42:38] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-29 12:42:38] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 12:42:38] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-29 12:42:38] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-05-29 12:42:38] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-29 12:42:39] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-29 12:42:39] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 0 ms to minimize.
[2024-05-29 12:42:39] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 0 ms to minimize.
[2024-05-29 12:42:39] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-29 12:42:39] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2024-05-29 12:42:39] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 3 ms to minimize.
[2024-05-29 12:42:39] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 12:42:40] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-05-29 12:42:40] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 268/341 variables, 73/96 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 30/126 constraints. Problems are: Problem set: 0 solved, 258 unsolved
[2024-05-29 12:42:42] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-29 12:42:42] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (OVERLAPS) 1/342 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 12 (OVERLAPS) 0/342 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 129 constraints, problems are : Problem set: 0 solved, 258 unsolved in 13595 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (OVERLAPS) 268/341 variables, 73/98 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 30/128 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 258/386 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 9 (OVERLAPS) 1/342 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 11 (OVERLAPS) 0/342 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 387 constraints, problems are : Problem set: 0 solved, 258 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 23/23 constraints]
After SMT, in 43994ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 43998ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 44214 ms. Remains : 73/73 places, 275/275 transitions.
Computed a total of 2 stabilizing places and 18 stable transitions
Computed a total of 2 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
RANDOM walk for 40000 steps (4328 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (449 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 269427 steps, run visited all 1 properties in 367 ms. (steps per millisecond=734 )
Probabilistic random walk after 269427 steps, saw 61886 distinct states, run finished after 371 ms. (steps per millisecond=726 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 10803 reset in 152 ms.
Product exploration explored 100000 steps with 10915 reset in 158 ms.
Built C files in :
/tmp/ltsmin9176096647578073067
[2024-05-29 12:43:21] [INFO ] Computing symmetric may disable matrix : 275 transitions.
[2024-05-29 12:43:21] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:43:21] [INFO ] Computing symmetric may enable matrix : 275 transitions.
[2024-05-29 12:43:21] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:43:21] [INFO ] Computing Do-Not-Accords matrix : 275 transitions.
[2024-05-29 12:43:21] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 12:43:21] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9176096647578073067
Running compilation step : cd /tmp/ltsmin9176096647578073067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 879 ms.
Running link step : cd /tmp/ltsmin9176096647578073067;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9176096647578073067;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3236594914239988394.hoa' '--buchi-type=spotba'
LTSmin run took 2910 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property StigmergyCommit-PT-04b-LTLFireability-08 finished in 94110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 1008 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1008/1008 places, 1602/1602 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1005 transition count 1599
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1005 transition count 1599
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 1003 transition count 1597
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1003 transition count 1597
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 1001 transition count 1595
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 1001 transition count 1595
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 999 transition count 1593
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 999 transition count 1593
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 997 transition count 1591
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 997 transition count 1591
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 997 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 996 transition count 1589
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 996 transition count 1589
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 995 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 995 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 994 transition count 1587
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 994 transition count 1587
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 993 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 993 transition count 1586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 992 transition count 1585
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 992 transition count 1585
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 991 transition count 1584
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 991 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 990 transition count 1583
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 990 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 989 transition count 1582
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 989 transition count 1582
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 988 transition count 1581
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 988 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 987 transition count 1580
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 987 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 986 transition count 1579
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 986 transition count 1579
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 985 transition count 1578
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 985 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 984 transition count 1577
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 984 transition count 1577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 984 transition count 1576
Applied a total of 50 rules in 488 ms. Remains 984 /1008 variables (removed 24) and now considering 1576/1602 (removed 26) transitions.
// Phase 1: matrix 1576 rows 984 cols
[2024-05-29 12:43:26] [INFO ] Computed 6 invariants in 20 ms
[2024-05-29 12:43:26] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-29 12:43:26] [INFO ] Invariant cache hit.
[2024-05-29 12:43:27] [INFO ] Implicit Places using invariants and state equation in 789 ms returned []
Implicit Place search using SMT with State Equation took 1061 ms to find 0 implicit places.
Running 1575 sub problems to find dead transitions.
[2024-05-29 12:43:27] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)timeout

(s213 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/983 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1575 unsolved
SMT process timed out in 31872ms, After SMT, problems are : Problem set: 0 solved, 1575 unsolved
Search for dead transitions found 0 dead transitions in 31889ms
Starting structural reductions in LTL mode, iteration 1 : 984/1008 places, 1576/1602 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33446 ms. Remains : 984/1008 places, 1576/1602 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 342 ms.
Product exploration explored 100000 steps with 50000 reset in 300 ms.
Computed a total of 205 stabilizing places and 215 stable transitions
Computed a total of 205 stabilizing places and 215 stable transitions
Detected a total of 205/984 stabilizing places and 215/1576 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-04b-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-04b-LTLFireability-10 finished in 34225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U (p1&&X(!p0))))'
Support contains 2 out of 1008 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1008/1008 places, 1602/1602 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1005 transition count 1599
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1005 transition count 1599
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 1003 transition count 1597
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1003 transition count 1597
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 1001 transition count 1595
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 1001 transition count 1595
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 999 transition count 1593
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 999 transition count 1593
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 997 transition count 1591
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 997 transition count 1591
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 997 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 996 transition count 1589
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 996 transition count 1589
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 995 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 995 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 994 transition count 1587
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 994 transition count 1587
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 993 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 993 transition count 1586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 992 transition count 1585
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 992 transition count 1585
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 991 transition count 1584
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 991 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 990 transition count 1583
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 990 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 989 transition count 1582
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 989 transition count 1582
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 988 transition count 1581
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 988 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 987 transition count 1580
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 987 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 986 transition count 1579
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 986 transition count 1579
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 985 transition count 1578
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 985 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 984 transition count 1577
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 984 transition count 1577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 984 transition count 1576
Applied a total of 50 rules in 530 ms. Remains 984 /1008 variables (removed 24) and now considering 1576/1602 (removed 26) transitions.
[2024-05-29 12:44:00] [INFO ] Invariant cache hit.
[2024-05-29 12:44:00] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-29 12:44:00] [INFO ] Invariant cache hit.
[2024-05-29 12:44:01] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
Running 1575 sub problems to find dead transitions.
[2024-05-29 12:44:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/983 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1575 unsolved
SMT process timed out in 32208ms, After SMT, problems are : Problem set: 0 solved, 1575 unsolved
Search for dead transitions found 0 dead transitions in 32223ms
Starting structural reductions in LTL mode, iteration 1 : 984/1008 places, 1576/1602 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33724 ms. Remains : 984/1008 places, 1576/1602 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) p0), (NOT p0), p0]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-13
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLFireability-13 finished in 33874 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&G((F(p3)||p2)))))'
Support contains 12 out of 1008 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1008/1008 places, 1602/1602 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1006 transition count 1600
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1006 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 1005 transition count 1599
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 1005 transition count 1599
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 1004 transition count 1598
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 1004 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 1003 transition count 1597
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 1003 transition count 1597
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 1002 transition count 1596
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 1002 transition count 1596
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 1002 transition count 1595
Applied a total of 13 rules in 205 ms. Remains 1002 /1008 variables (removed 6) and now considering 1595/1602 (removed 7) transitions.
// Phase 1: matrix 1595 rows 1002 cols
[2024-05-29 12:44:33] [INFO ] Computed 6 invariants in 23 ms
[2024-05-29 12:44:34] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-29 12:44:34] [INFO ] Invariant cache hit.
[2024-05-29 12:44:34] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
Running 1594 sub problems to find dead transitions.
[2024-05-29 12:44:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1001 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1594 unsolved
SMT process timed out in 32187ms, After SMT, problems are : Problem set: 0 solved, 1594 unsolved
Search for dead transitions found 0 dead transitions in 32204ms
Starting structural reductions in LTL mode, iteration 1 : 1002/1008 places, 1595/1602 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33416 ms. Remains : 1002/1008 places, 1595/1602 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLFireability-14 finished in 33698 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 6 out of 1008 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1008/1008 places, 1602/1602 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1005 transition count 1599
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1005 transition count 1599
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 1003 transition count 1597
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1003 transition count 1597
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 1001 transition count 1595
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 1001 transition count 1595
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 999 transition count 1593
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 999 transition count 1593
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 997 transition count 1591
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 997 transition count 1591
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 997 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 996 transition count 1589
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 996 transition count 1589
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 995 transition count 1588
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 995 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 994 transition count 1587
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 994 transition count 1587
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 993 transition count 1586
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 993 transition count 1586
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 992 transition count 1585
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 992 transition count 1585
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 991 transition count 1584
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 991 transition count 1584
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 990 transition count 1583
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 990 transition count 1583
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 989 transition count 1582
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 989 transition count 1582
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 988 transition count 1581
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 988 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 987 transition count 1580
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 987 transition count 1580
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 986 transition count 1579
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 986 transition count 1579
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 985 transition count 1578
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 985 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 984 transition count 1577
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 984 transition count 1577
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 50 place count 984 transition count 1576
Applied a total of 50 rules in 470 ms. Remains 984 /1008 variables (removed 24) and now considering 1576/1602 (removed 26) transitions.
// Phase 1: matrix 1576 rows 984 cols
[2024-05-29 12:45:07] [INFO ] Computed 6 invariants in 8 ms
[2024-05-29 12:45:07] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-05-29 12:45:07] [INFO ] Invariant cache hit.
[2024-05-29 12:45:08] [INFO ] Implicit Places using invariants and state equation in 740 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
Running 1575 sub problems to find dead transitions.
[2024-05-29 12:45:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/983 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1575 unsolved
SMT process timed out in 32125ms, After SMT, problems are : Problem set: 0 solved, 1575 unsolved
Search for dead transitions found 0 dead transitions in 32139ms
Starting structural reductions in LTL mode, iteration 1 : 984/1008 places, 1576/1602 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33587 ms. Remains : 984/1008 places, 1576/1602 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : StigmergyCommit-PT-04b-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-04b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04b-LTLFireability-15 finished in 33748 ms.
All properties solved by simple procedures.
Total runtime 500711 ms.

BK_STOP 1716986741097

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-04b"
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-5568"
echo " Executing tool itstools"
echo " Input is StigmergyCommit-PT-04b, 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 r400-tall-171690531700132"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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